A hybrid meta-heuristic approach for design and solving a location routing problem Considering the time window

سال انتشار: 1402
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 60

فایل این مقاله در 12 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

JR_IJDI-1-2_005

تاریخ نمایه سازی: 6 آبان 1402

چکیده مقاله:

The supply chain requires a distribution network between customers and suppliers. This distribution network can be multifaceted. Combining these two problems into a single problem increases the efficiency of the distribution network and ultimately increases the efficiency of the supply chain. Establishing a window of time to deliver goods to customers also increases their satisfaction and, as a result, more profitability in the long run. Therefore, in this research, an attempt has been made to present a routing-location problem in the multimodal transportation network. A time window is also included in this model. To solve such a model, especially in large dimensions, exact solution methods cannot be used. Based on this, a combined meta-heuristic algorithm (genetic optimization algorithm and neural network) has been proposed to solve the model, and the result has been compared with two gray wolf optimization algorithms and grasshopper optimization algorithms. The presented results indicate the effectiveness of the proposed algorithm.

کلیدواژه ها:

The problem of routing - locating ، Time Window ، Meta-heuristic algorithm of gray wolf optimization ، Meta-heuristic algorithm of locust optimization ، Hybrid meta-heuristic algorithm

نویسندگان

Mohammad amin Rahmani

PhD student of Industrial Engineering, University of Tehran

Ahamd Mirzaei

School of Computer Faculty, Islamic Azad University, electronic campus, Tehran, Iran

Milad Hamzehzadeh Aghbelagh

School of Faculty of Information Technology Engineering, Shiraz University of Technology, Shiraz.