A hybrid meta-heuristic approach for design and solving a location routing problem Considering the time window
Publish Year: 1402
نوع سند: مقاله کنفرانسی
زبان: English
View: 104
This Paper With 14 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICISE09_163
تاریخ نمایه سازی: 15 مهر 1402
Abstract:
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.
Keywords:
The problem of routing - locating , Time window , Meta-heuristic algorithm of gray wolf optimization , Meta-heuristic algorithm of locust optimization , Hybrid meta-heuristic algorithm
Authors
Mohammad Amin Rahmani
School of Industrial & Systems Engineering, College of Engineering, University of Tehran, Tehran, Iran
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