Proposing a New Genetic Algorithm Multi-capacity to Solve the Multi-Storage Routing problem with Multi-capacity Vehicles
Subject Areas : Industrial Management
Hossien
Afzali
1
(Researcher at the institute for Trade Student and Research (ITSR))
Gholam Reza
Einy Sarkalleh
2
(Ph.D. student of industrial management and Researcher at the institute for Trade Student and Research (ITSR))
Mojtba
Khademy Nejad
3
(M.S in Industrial management)
Elnaz
Miandoabchi
4
(Ph.D. in Industries and Faculty Member of the Institute for Trade Student and Research (ITSR))
Keywords:
Abstract :
Vehicle routing issues are one of the most common issues in supply chain management and in transport planning. So far, there have been many published academic articles and applied research papers referred in this study. A new innovative algorithm is proposed in this investigation in order to solve the problem of routing different vehicles with different capacities. The main purpose of this paper is to allocate demand points to each center and determine the best route between the points assigned to each center, as well as determine the best means of transport. The quotes are for each center and the results obtained by the new algorithm are extracted C has been compared with the original algorithms and the results show that this algorithm will be able to compete with innovative algorithms and other interoperability.
25. Wu, T. H., Low, C., & Bai, J. W. (2002). Heuristic solutions to multi-depot location-routing problems. Computers & Operations Research, 29(10), 1393–1415.
_||_25. Wu, T. H., Low, C., & Bai, J. W. (2002). Heuristic solutions to multi-depot location-routing problems. Computers & Operations Research, 29(10), 1393–1415.