A Hybrid Meta-Heuristic Approach for Design and Solving a Location Routing Problem Considering the Time Window

Subject Areas : International Journal of Decision Intelligence

Mohammad Amin Rahmani ¹ , Ahamd Mirzaei ² , Milad Hamzehzadeh Aghbelagh ³

1 - School of Industrial Engineering, University of Tehran, Tehran, Iran
2 - School of Computer Faculty, Islamic Azad University, electronic campus, Tehran, Iran
3 - School of Faculty of Information Technology Engineering, Shiraz University of Technology, Shiraz,Iran

Received: 2023-10-14 Accepted : 2023-10-18 Published : 2024-09-22

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

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.