Industrial Innovations

Industrial Innovations

An Efficient Imperialist Competitive Algorithm for Solving Location Routing Problem in the Multi-Level Supply Chain Under Fuzzy and Probabilistic Condition

Document Type : Original Article

Authors
Amir-Mohammad Golmohammadi 1
Ashraf Norouzi 2
1 Assistant Professor, Department of Industrial Engineering, Arak University, Arak, Iran.
2 Assistant Professor, Department of Industrial Engineering, Faculty of Engineering, Arak University, Arak, Iran
10.52547/JII.1.1.83
Abstract
In the industrial world today, manufacturing units are trying to locate your requirements and the depot vehicle routing in order to transport the goods for reduce your cost. Needless to mention that the location of the warehouse is effective for vehicle routing. Therefore, in this paper, a mathematical programming model to optimize the storage location and vehicle routing are presented. The objective function of the model is minimizing the total cost associated with the transportation and storage of rental fee. Limitations of the model include vehicle capacity, the maximum distance traveled by vehicles and etc. In addition, labor costs, such as salaries, rent, warehouses, rental vehicles and etc. Approach to model the real world has been considered.

Also, since each location and routing issues alone are a NP-hard problem, then location routing problem can be combined problem and It requires the use of meta- heuristic algorithms to solve.
Keywords
Optimization
Location Routing Problem
Uncertainty
Imperialist Competitive Algorithm
[1] Webb M H J. Cost functions in the location of depots for multiple-delivery journeys. Journal of the Operational Research Society. 1968;19: 311-320.
[2] Christofides N, Eilon S. An algorithm for the vehicle-dispatching problem. Journal of the Operational     Research Society. 1969;20: 309-318.
[3] Bramel J, Simchi-Levi D. The Logic of Logistics: Theory, Algorithms and Applications for Logistics Management. Journal of the Operational Research Society. 1998;49: 1016-1017.
[4] Salhi S, Rand G K. The effect of ignoring routes when locating depots. European journal of operational research. 1989;39: 150-156.
[5] Min H, Jayaraman V, Srivastava R. Combined location-routing problems: A synthesis and future research directions. European Journal of Operational Research. 1998;108: 1-15.
[6] Tavakkoli-Moghaddam R, Rabbani M, Saremi A, Safaei N. Solving the backhaul vehicle routing problem by genetic algorithms. In 35th International Conference on Computers and Industrial Engineering. 2005: 1905-1910.
[7] Bányai T, Tamás P, Illés B, Stankevičiūtė Ž, Bányai Á. Optimization of municipal waste collection routing: Impact of industry 4.0 technologies on environmental awareness and sustainability. International journal of environmental research and public health. 2019; 16: 634.
[8] Adeleke O O, Idoko S, Kolo S S, Anwar A R, Sijuwola O O, Akinola O. Web-Based Advanced Traveller Information System for Minna Metropolis, Nigeria. Arid Zone Journal of Engineering, Technology and Environment. 2019;15: 1026-1037.
[9] Wang Y, Yuan Y, Guan X, Xu M, Wang L, Wang H, Liu Y. Collaborative two-echelon multicenter vehicle routing optimization based on state–space–time network representation. Journal of Cleaner Production. 2020; 258:120590.
[10] Rafie-Majd Z, Pasandideh S H R, Naderi B. Modelling and solving the integrated inventory-location-routing problem in a multi-period and multi-perishable product supply chain with uncertainty: Lagrangian relaxation algorithm. Computers & chemical engineering. 2018; 109:9-22.
[11] Basso R, Kulcsár B, Sanchez-Diaz I. Electric vehicle routing problem with machine learning for energy prediction. Transportation Research Part B: Methodological. 2021;145:24-55.
[12] Li P, Lan H, Saldanha-Da-Gama F. A bi-objective capacitated location-routing problem for multiple perishable commodities. IEEE Access, 7. 2019; 136729-136742.
[13] Jiménez M, Arenas M, Bilbao A, Rodrı M V. Linear programming with fuzzy parameters: an interactive method resolution. European journal of operational research. 2007; 177:1599-1609.
[14] Knowles J D, Corne DW. The Pareto archived evolution strategy: A new baseline algorithm for Pareto multi-objective optimization. In Congress on Evolutionary Computation (CEC99). 1999;1: 98–105.
Industrial Innovations
Volume 1, Issue 1 - Serial Number 1
Winter 2023
Pages 83-101

  • Receive Date 17 January 2023
  • Accept Date 16 December 2022