Open AccessA Solution to VRPTW Based on Improved GA-AMMAS Algorithm
Author(s) -
Ming Han,
Yabin Wang
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1486/3/032015
Subject(s) - vehicle routing problem , spare part , computer science , genetic algorithm , mathematical optimization , spare time , adversary , distribution (mathematics) , routing (electronic design automation) , algorithm , mathematics , engineering , operations management , computer security , mathematical analysis , computer network
Vehicle routing problem with time windows (VRPTW) is a NP difficult problem, and it has important applications in military logistics, especially the distribution of wartime military equipment, materials and spare parts. In the last decade, numerous new methods for VRPTW have sprung up. However, few researches have been made in the study of VRPTW of wartime distribution. Hence, a two-stage solution is proposed in this paper to solve the VRPTW in complex dynamic environment during the war. That is, static route optimization in the pre-planning stage and dynamic route re-planning in the execution stage for sudden or changing enemy threats. An improved hybrid algorithm of Genetic algorithm and adaptive maximum-minimum ant system (GA-AMMAS) is designed in this paper for the solution of the model above.