پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 163 |
| تعداد شماره‌ها | 6,762 |
| تعداد مقالات | 72,833 |
| تعداد مشاهده مقاله | 131,760,467 |
| تعداد دریافت فایل اصل مقاله | 103,490,462 |
A developed model and heuristic algorithm for inventory routing problem in a cold chain with pharmaceutical products | ||
| Industrial Management Journal | ||
| مقاله 8، دوره 9، شماره 2، 2017، صفحه 383-407 اصل مقاله (423.12 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/imj.2017.127742.1006884 | ||
| نویسندگان | ||
| Parizad Vakili1؛ Seyyed-Mahdi Hosseini-Motlagh* 2؛ MohammadReza Gholamian2؛ Abbas Jokar3 | ||
| 1MA Student in Industrial Engineering, Iran University of Science and Technology, Tehran, Iran | ||
| 2Assistant Prof., Iran University of Science and Technology, Tehran, Iran | ||
| 3PhD Candidate of Economic and Social Systems, Iran University of Science and Technology, Tehran, Iran | ||
| چکیده | ||
| Inventory routing problem considers inventory allocation and routing problems simultaneously, in which the replenishment policies and routing arrangement are determined by the supplier under the vendor managed inventory mode. In this paper we study deterministic inventory routing problem in a pharmaceutical supply chain with a distributor and multiple geographically dispersed retailers. Two types of products are considered, first refrigerated which need temperature-controlled vehicles to be delivered and second non-refrigerated. Therefor our problem is defined in a cold chain which is a temperature-controlled supply chain. Vehicles capacity and holding capacity of retailers is consist of refrigerated and non-refrigerated parts. We propose a mixed integer linear programming (MILP) model. The objective is to minimize the sum of transportation and inventory costs. We also propose an adaptive large neighborhood search heuristic to solve the problem. In the initialization phase of the algorithm, a two phase heuristic algorithm is proposed. We used standard data sets to demonstrate the performance of the proposed algorithm. | ||
| کلیدواژه‌ها | ||
| inventory routing؛ pharmaceutical products؛ cold chain؛ ALNS؛ heuristic | ||
| مراجع | ||
رضوی، م.، سوخکیان، م.ع.، زیارتی، ک. (1390). ارائۀ الگوریتم فراابتکاری مبتنی بر سیستم کلونی مورچگان برای مسئلۀ مکان‌یابی مسیریابی با چندین انبار و فرض تخصیص چندین مسیر به هر وسیلۀ نقلیه. نشریۀ مدیریت صنعتی، 3 (6)، 38-17.محمدی زنجیرانی، د.، اسعدی آقاجری، م. (1388). طراحی الگوی ریاضی مسیریابی موجودیها در زنجیرۀ تأمین با بررسی موردی در شرکت دونا خزر. نشریۀ مدیریت صنعتی، 1(3)، 136-119.Abdelmaguid, T. F., & Dessouky, M. M. (2006). A genetic algorithm approach to the integrated inventory-distribution problem. International Journal of Production Research, 44(21), 4445-4464.
Abdollahi, M., Arvan, M., Omidvar, A., Ameri, F. (2014). A simulation optimization approach to apply value at risk analysis on the inventory routing problem with backlogged demand. International Journal of Industrial Engineering Computations, 5(4), 603-620.
Aghezzaf, E.H., Raa, B., Van Landeghem, H. (2006). Modeling inventory routing problems in supply chains of high consumption products. European Journal of Operational Research, 169(3), 1048-1063.
Aksen, D., Kaya, O., Salman, F. S., & Tüncel, Ö. (2014). An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem. European Journal of Operational Research, 239(2), 413-426.
Andersson, H., Hoff, A., Christiansen, M., Hasle, G., & Løkketangen, A. (2010). Industrial aspects and literature survey: Combined inventory management and routing. Computers & Operations Research, 37(9), 1515-1536.
Archetti, C., Bertazzi, L., Laporte, G., & Speranza, M. G. (2007). A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Science, 41(3), 382-391.
Bell, W. J., Dalberto, L. M., Fisher, M. L., Greenfield, A. J., Jaikumar, R., Kedia, P., ... & Prutzman, P. J. (1983). Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces, 13(6), 4-23.
Bertazzi, L., Bosco, A., Guerriero, F., & Lagana, D. (2013). A stochastic inventory routing problem with stock-out. Transportation Research Part C: Emerging Technologies, 27, 89-107.
Boudia, M. & Prins, C. (2009). A memetic algorithm with dynamic population management for an integrated production–distribution problem. European Journal of Operational Research, 195(3), 703-715.
Boudia, M., Louly, M. A. O. & Prins, C. (2007). A reactive GRASP and path relinking for a combined production–distribution problem. Computers & Operations Research, 34(11), 3402-3419.
Campbell, A. M. & Savelsbergh, M. W. (2004). A decomposition approach for the inventory-routing problem. Transportation science, 38(4), 488-502.
Campbell, A., Clarke, L., Kleywegt, A. J., & Savelsbergh, M. W. P. (1998). The inventory routing problem in Fleet Management and Logistics, Crainic, TG, and Laporte, G.
Coelho, L. C., Cordeau, J. F., & Laporte, G. (2012). The inventory-routing problem with transshipment. Computers & Operations Research, 39(11), 2537-2548.
Coelho, L. C., Cordeau, J. F., & Laporte, G. (2013). Thirty years of inventory routing. Transportation Science, 48(1), 1-19.
Esparcia-Alcazar, A. I., Lluch-Revert, L., Cardos, M., Sharman, K., & Merelo, J. J. (2007, July). Configuring an evolutionary tool for the Inventory and Transportation Problem. In Proceedings of the 9th annual conference on Genetic and evolutionary computation (pp. 1975-1982). ACM.
Kaya, O., Salman, F.S., Tüncel, Ö. (2014). An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem. European Journal of Operational Research, 239(2), 413-426.
Li, J. A., Wu, Y., Lai, K. K., & Liu, K. (2008). Replenishment routing problems between a single supplier and multiple retailers with direct delivery. European Journal of Operational Research, 190(2), 412-420.
Li, K., Chen, B., Sivakumar, A. I., & Wu, Y. (2014). An inventory–routing problem with the objective of travel time minimization. European Journal of Operational Research, 236(3), 936-945.
Liu, S. C., & Lee, W. T. (2011). A heuristic method for the inventory routing problem with time windows. Expert Systems with Applications, 38(10), 13223-13231.
Mjirda, A., Jarboui, B., Macedo, R., Hanafi, S., & Mladenović, N. (2014). A two phase variable neighborhood search for the multi-product inventory routing problem. Computers & Operations Research, 52, 291-299.
Moin, N. H., Salhi, S. & Aziz, N. A. B. (2011). An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem. International Journal of Production Economics, 133(1), 334-343.
Özener, O. Ö., Ergun, Ö., & Savelsbergh, M. (2013). Allocating cost of service to customers in inventory routing. Operations Research, 61(1), 112-125.
Qin, L., Miao, L., Ruan, Q., & Zhang, Y. (2014). A local search method for periodic inventory routing problem. Expert Systems with Applications, 41(2), 765-778.
Raa, B. (2015). Fleet optimization for cyclic inventory routing problems. International Journal of Production Economics, 160, 172-181.
Raa, B., & Aghezzaf, E. H. (2008). Designing distribution patterns for long-term inventory routing with constant demand rates. International Journal of Production Economics, 112(1), 255-263.
Ropke, S., & Pisinger, D. (2006). A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research, 171(3), 750-775.
Shah, N. (2004). Pharmaceutical supply chains: key issues and strategies for optimisation. Computers & chemical engineering, 28(6), 929-941.
Shao, S., & Huang, G. Q. (2014, January). A SHIP Inventory Routing Problem with Heterogeneous Vehicles under Order-Up-To Level Policies. In IIE Annual Conference. Proceedings (p. 1106). Institute of Industrial and Systems Engineers (IISE).
Shaw, P. (1998, October). Using constraint programming and local search methods to solve vehicle routing problems. In International Conference on Principles and Practice of Constraint Programming (pp. 417-431). Springer, Berlin, Heidelberg.
Vidović, M., Popović, D., & Ratković, B. (2014). Mixed integer and heuristics model for the inventory routing problem in fuel delivery. International Journal of Production Economics, 147, 593-604.
Wong, L., & Moin, N. H. (2014, July). A modified ant colony optimization to solve multi products inventory routing problem. In AIP Conference Proceedings (Vol. 1605, No. 1, pp. 1117-1122). AIP.
Yao, Y., Dong, Y., & Dresner, M. (2010). Managing supply chain backorders under vendor managed inventory: An incentive approach and empirical analysis. European Journal of Operational Research, 203(2), 350-359.
Yu, Y., Chen, H., & Chu, F. (2008). A new model and hybrid approach for large scale inventory routing problems. European Journal of Operational Research, 189(3), 1022-1040.
Zhao, Q. H., Chen, S., & Zang, C. X. (2008). Model and algorithm for inventory/routing decision in a three-echelon logistics system. European Journal of Operational Research, 191(3), 623-635.
| ||
|
آمار تعداد مشاهده مقاله: 1,262 تعداد دریافت فایل اصل مقاله: 1,589 |
||
سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب