سامانه پشتیبانی خدمات اطلاعات

  اخبار و اعلانات

 آمار

تعداد نشریات161
تعداد شماره‌ها6,532
تعداد مقالات70,501
تعداد مشاهده مقاله124,113,691
تعداد دریافت فایل اصل مقاله97,217,424
Teymouri, Ebrahim, Aboutorabiyan, Fatemeh, Babaei, Mohammad Hosein. (1396). A Hybrid Algorithm to Solve a Bi-objective Location Routing Inventory Problem in a Supply Chain under Stochastic Demand. , 51(2), 175-193. doi: 10.22059/jieng.2017.62211
Ebrahim Teymouri; Fatemeh Aboutorabiyan; Mohammad Hosein Babaei. "A Hybrid Algorithm to Solve a Bi-objective Location Routing Inventory Problem in a Supply Chain under Stochastic Demand". , 51, 2, 1396, 175-193. doi: 10.22059/jieng.2017.62211
Teymouri, Ebrahim, Aboutorabiyan, Fatemeh, Babaei, Mohammad Hosein. (1396). 'A Hybrid Algorithm to Solve a Bi-objective Location Routing Inventory Problem in a Supply Chain under Stochastic Demand', , 51(2), pp. 175-193. doi: 10.22059/jieng.2017.62211
Teymouri, Ebrahim, Aboutorabiyan, Fatemeh, Babaei, Mohammad Hosein. A Hybrid Algorithm to Solve a Bi-objective Location Routing Inventory Problem in a Supply Chain under Stochastic Demand. , 1396; 51(2): 175-193. doi: 10.22059/jieng.2017.62211

A Hybrid Algorithm to Solve a Bi-objective Location Routing Inventory Problem in a Supply Chain under Stochastic Demand

Advances in Industrial Engineering
مقاله 5، دوره 51، شماره 2، مهر 2017، صفحه 175-193    اصل مقاله (897.55 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22059/jieng.2017.62211
نویسندگان
Ebrahim Teymouri* 1؛ Fatemeh Aboutorabiyan2؛ Mohammad Hosein Babaei1
1Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran
2Faculty of Engineering, University of Tehran, Iran
چکیده
Nowadays, fierce competition in global markets has forced companies to improve the design and management of supply chains, and provide competitive advantages. Decision integrity is one of the main factors which highly lead to a considerable reduction of supply chain costs, and higher costumer’s satisfaction. Distribution network design is based on three major problems: location allocation, vehicle routing and inventory control. Since the effective role of reducing distribution costs in the survival of the supply chain is clear to all, in this paper, these three problems will be incorporated into an integrated model under demand uncertainty. This approach leads to the significant reduction of distribution costs, higher customer satisfaction, and also providing an efficient supply chain. Also in this study, in addition to minimizing the total cost including fixed cost of establishing depots, transportation costs and inventory costs, the customers’ satisfaction will increase by reducing their waiting time. So, a bi-objective mixed integer non-linear model is presented by using chance constrained programming, where customer demands are assumed to have a normal distribution. Then, to solve the model, a hybrid algorithm based on simulated annealing and genetic algorithm is proposed, and is evaluated on a set of instances. The computational results illustrate the algorithm efficiency to solve a wide range of problems with different sizes.
کلیدواژه‌ها
Facility location؛ Integrated supply chain؛ Inventory Control؛ Metaheuristic algorithms؛ Vehicle routing
عنوان مقاله [English]
ارائة یک الگوریتم ترکیبی برای حل مسئلۀ مکان‌یابی- مسیریابی- موجودی دوهدفه در زنجیرۀ تأمین با فرض وجود تقاضای تصادفی
نویسندگان [English]
ابراهیم تیموری1؛ فاطمه ابوترابیان2؛ محمدحسین بابایی1
1دانشیار دانشکدة صنایع، دانشگاه علم و صنعت ایران
2دانشجوی دکتری دانشکدة صنایع، پردیس دانشکده‌های فنی، دانشگاه تهران
چکیده [English]
امروزه رقابت شدید در بازار جهانی، شرکت‌ها را وادار به طراحی و مدیریت بهتر زنجیره‌های تأمین و ایجاد مزیت‌های رقابتی کرده است. یکپارچگی تصمیم­ها، از عوامل بسیار مهمی است که به میزان زیادی موجب کاهش هزینه‌های زنجیره می­شود و به افزایش رضایت مشتری می‌انجامد. طراحی شبکة توزیع، براساس سه مسئلة عمده انجام گرفته است: تخصیص مکان، مسیریابی وسیلة نقلیه و کنترل موجودی. از آنجاکه نقش مؤثر کاهش هزینه‌های توزیع در ادامة حیات زنجیرة تأمین پوشیده نیست، در این مقاله، این سه مسئله در قالب یک مدل یکپارچه در شرایط عدم قطعیت تقاضا با یکدیگر ترکیب می­شوند. این روش، به کاهش هزینه‌های توزیع، افزایش رضایت مشتریان و درنهایت، ایجاد یک زنجیرة تأمین کارا منجر می­شود. همچنین در این پژوهش، علاوه­بر کمینه­کردن مجموع هزینه‌های ثابت ایجاد انبارها، هزینه‌های حمل‌ونقل و هزینه‌های موجودی، رضایت مشتریان اولویت‌دار نیز از طریق کاهش زمان انتظار افزایش می­یابد. به همین دلیل، یک مدل دوهدفة برنامه‌ریزی غیرخطی مختلط، با فرض پیروی عامل تصادفی (تقاضا) از توزیع شناخته‌شده (نرمال) با استفاده از برنامه‌ریزی شانس محدودیت­دار ارائه می‌شود. در ادامه برای حل مدل، یک الگوریتم حل ترکیبی بر پایۀ تبرید شبیه‌سازی‌شده و الگوریتم ژنتیک، ارائه و با استفاده از مجموعه‌ای از مسائل نمونه ارزیابی می­شود. نتایج محاسباتی، نشانگر کارایی آن برای طیف وسیعی از مسائل با اندازه‌های متفاوت است.
کلیدواژه‌ها [English]
الگوریتم‌های فراابتکاری, زنجیرة تأمین یکپارچه, کنترل موجودی, مسیریابی وسیلة نقلیه, مکان‌یابی تسهیلات
مراجع
  1. Salhi, S. and Rand, G. K. (1989). “The effect of ignoring routes when locating depots”, European Journal of Operational Research, Vol. 39, No. 2, PP. 150–156.
  2. Ahmadi Javid, A. and Seddighi, A. H. (2012). “A location-routing-inventory model for designing multisource distribution networks”, Engineering Optimization, Vol. 44, No. 6, PP. 637–656.
  3. Teimoury, E., Modarres, M., Ghasemzadeh, F. and Fathi, M. (2010). “A queueing approach to production-inventory planning for supply chain with uncertain demands: Case study of PAKSHOO Chemicals Company”, Journal of Manufacturing Systems, Vol. 29, No. 2, PP 55–62.
  4. Min, H., Jayaraman, V. and Srivastava, R. (1998). “Combined location-routing problems: A synthesis and future research directions”, European Journal of Operational Research, Vol. 108, No. 1, PP. 1–15.
  5. Nagy, G. and Salhi, S. (2007). “Location-routing: Issues, models and methods”, European Journal of Operational Research, Vol. 177, No. 2, PP. 649–672.
  6. Quintero‐Araujo, C. L., Caballero‐Villalobos, J. P., Juan, A. A. and Montoya‐Torres, J. R. (2016). “A biased‐randomized metaheuristic for the capacitated location routing problem”, International Transactions in Operational Research, Vol. 24, No. 5, PP. 1079-1098.
  7. Baita, F., Ukovich, W., Pesenti, R. and Favaretto, D. (1998). “Dynamic routing-and-inventory problems: a review”, Transportation Research Part A: Policy and Practice, Vol. 32, No. 8, PP. 585–598.
  8. Jaillet, P., Bard, J. F., Huang, L. and Dror, M. (2002). “Delivery cost approximations for inventory routing problems in a rolling horizon framework”, Transportation Science, Vol. 36, No. 3, PP. 292–300.
  9. Kleywegt, A. J., Nori, V. S. and Savelsbergh, M. W. (2002). “The stochastic inventory routing problem with direct deliveries”, Transportation Science, Vol. 36, No. 1, PP. 94–118.
  10. Adelman, D. (2004). “A price-directed approach to stochastic inventory/routing”, Operations Research, Vol. 52, No. 4, PP. 499–514.
  11. Gaur, V. and Fisher, M. L. (2004). “A periodic inventory routing problem at a supermarket chain.” Operations Research, Vol. 52, No. 6, PP. 813–822.
  12. Zhao, Q. H., Chen, S. and Zang, C. X. (2008). “Model and algorithm for inventory/routing decision in a three-echelon logistics system”, European Journal of Operational Research, Vol. 191, No. 3, PP. 623–635.
  13. Yu, Y., Chen, H. and Chu, F. (2008). “A new model and hybrid approach for large scale inventory routing problems”, European Journal of Operational Research, Vol. 189, No. 3, PP. 1022–1040.
  14. Day, J. M., Wright, P. D., Schoenherr, T., Venkataramanan, M. and Gaudette, K. (2009). “Improving routing and scheduling decisions at a distributor of industrial gasses”, Omega, Vol. 37, No. 1, PP. 227–237.
  15. Andersson, H., Christiansen, M. and Desaulniers, G. (2016). “A new decomposition algorithm for a liquefied natural gas inventory routing problem”, International Journal of Production Research, Vol. 54, No. 2, PP. 564–578.
  16. Daskin, M. S., Coullard, C. R. and Shen, Z. J. M. (2002). “An inventory-location model: Formulation, solution algorithm and computational results”, Annals of Operations Research, Vol. 110, No. 1, PP. 83–106.
  17. Shen, Z. J. M., Coullard, C. and Daskin, M. S. (2003). “A joint location-inventory model”, Transportation Science, Vol. 37, No. 1, PP. 40–55.
  18. Diabat, A., Richard, J. P. and Codrington, C. W. (2013). “A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design”, Annals of Operations Research, Vol. 203, No. 1, PP. 55-80
  19. Puga, M. S. and Tancrez, J. S. (2017). “A heuristic algorithm for solving large location–inventory problems with demand uncertainty”, European Journal of Operational Research, Vol. 259, No. 2, PP. 413–423.
  20. Liu, S. C. and Lee, S. B. (2003). “A two-phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration”, The International Journal of Advanced Manufacturing Technology, Vol. 22, No. 11, PP. 941–950.
  21. Liu, S. C. and Lin, C. C. (2005). “A heuristic method for the combined location routing and inventory problem”, The International Journal of Advanced Manufacturing Technology, Vol. 26, No. 4, PP. 372–381.
  22. Shen, Z. J. M. and Qi, L. (2007). “Incorporating inventory and routing costs in strategic location models”, European Journal of Operational Research, Vol. 179, No. 2, PP. 372–389.
  23. Javid, A. A. and Azad, N. (2010). “Incorporating location, routing and inventory decisions in supply chain network design”, Transportation Research Part E: Logistics and Transportation Review, Vol. 46, No. 5, PP. 582–597.
  24. Wang, C., Ma, Z. and Li, H. (2008, October). “Stochastic dynamic location-routing-inventory problem in closed-loop logistics system for reusing end-of-use products.” In Intelligent Computation Technology and Automation (ICICTA), 2008 International Conference (Vol. 2, PP. 691–695). IEEE.
  25. Sajjadi, S. R. and Cheraghi, S. H. (2011). “Multi-products location–routing problem integrated with inventory under stochastic demand”, International Journal of Industrial and Systems Engineering, Vol. 7, No. 4, PP. 454–476.
  26. Guerrero, W. J., Prodhon, C., Velasco, N. and Amaya, C. A. (2013). “Hybrid heuristic for the inventory location-routing problem with deterministic demand”, International Journal of Production Economics, Vol. 146, No. 1, PP. 359–370.
  27.  Tavakkoli-Moghaddam, R., Forouzanfar, F. and Ebrahimnejad, S. (2013). “Incorporating location, routing, and inventory decisions in a bi-objective supply chain design problem with risk-pooling”, Journal of Industrial Engineering International, Vol. 9, No. 1, PP. 9-19
  28. Tavakkoli-Moghaddam, R. and Raziei, Z. (2016). “A New Bi-Objective Location-Routing-Inventory Problem with Fuzzy Demands”, IFAC-PapersOnLine, Vol. 49, No. 12, PP. 1116–1121.
  29. Turan, B., Minner, S. and Hartl, R. F. (2017). “A VNS approach to multi-location inventory redistribution with vehicle routing”, Computers and Operations Research, Vol. 78, February 2017,PP. 526–536.
  30. Hiassat, A., Diabat, A. and Rahwan, I. (2017). “A genetic algorithm approach for location-inventory-routing problem with perishable products”, Journal of Manufacturing Systems, Vol. 42, January 2017,PP. 93–103.
  31. Norouzi, N., Tavakkoli, M. R., Sadegh, A. M. and Khaefi, S. (2015). “New mathematical modeling for a facilities location and vehicle routing problem solving by a hybrid imperialist competitive algorithm.” Vol. 49, No. 1, PP. 129–137.
  32. Gholami, M. and Honarvar, M. (2015). “Developing a Mathematical Model for Vendor Managed Inventory Considering Deterioration and Amelioration Items in a Three-Level Supply Chain”, Journal of Industrial Engineering???, Vol. 49, No. 2, PP. 237–256.
  33. Kiani, M., Seidgar, H., Mahdavi, I. and Tavakkoli, M. R. (2015), “An Efficient Genetic Algorithm for a Vehicle Routing Problem Considering the Competency of Working Teams”, Journal of Industrial Engineering, Vol. 49, No. 2, PP. 257–271.
  34. Cordeau, J. F., Laporte, G., Savelsbergh, M. W. P. and Vigo, D. (2006). “Vehicle Routing”, in Handbook of Operations Research and Management Science, Transportation, C. Barnhart and G. Laporte, Editors, Elsevier: Amsterdam, PP. 367–428.
  35. Megiddo, N. and Supowit, K. J. (1984). “On the complexity of some common geometric location problems”, SIAM Journal on Computing, Vol. 13, No. 1, PP. 182–196.
  36. Derbel, H., Jarboui, B., Hanafi, S. and Chabchoub, H. (2012). “Genetic algorithm with iterated local search for solving a location-routing problem”, Expert Systems with Applications, Vol. 39, No. 3, PP. 2865–2871.
  37. Vincent, F. Y., Lin, S. W., Lee, W. and Ting, C. J. (2010). “A simulated annealing heuristic for the capacitated location routing problem”, Computers and Industrial Engineering, Vol. 58, No. 2, PP. 288–299.
  38. Ting, C. J. and Chen, C. H. (2013). “A multiple ant colony optimization algorithm for the capacitated location routing problem”, International Journal of Production Economics, Vol. 141, No. 1, PP. 34–44.
  39. Barreto, S., Ferreira, C., Paixao, J. and Santos, B. S. (2007). “Using clustering analysis in a capacitated location-routing problem”, European Journal of Operational Research, Vol. 179, No. 3, PP. 968–977.
  40. Prins, C., Prodhon, C. and Calvo, R. W. (2006, April). “A memetic algorithm with population management (MA| PM) for the capacitated location-routing problem.” In European Conference on Evolutionary Computation in Combinatorial Optimization (PP. 183–194). Springer Berlin Heidelberg.
  41. Contardo, C., Cordeau, J. F. and Gendron, B. (2014). “A GRASP+ ILP-based metaheuristic for the capacitated location-routing problem”, Journal of Heuristics, Vol. 20, No. 1, PP. 1–38.
آمار
تعداد مشاهده مقاله: 1,205
تعداد دریافت فایل اصل مقاله: 1,011


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب