Research on Emergency Logistics Vehicle Scheduling Based on Simulated Annealing Algorithm

  • Wang Cankun
Keywords: Emergency, Simulated annealing algorithm, Emergency logistics, Vehicle dispatching.

Abstract

Natural disasters put forward high requirements for emergency management, and how to deliver emergency support materials to the affected places in the fastest way is an important issue to be considered in disaster emergency management. In order to solve the problems of casualties, health and epidemic prevention, property loss, disaster relief, etc., and to prevent the expansion of disaster scope, the emergency logistics tasks will become larger and the complexity will increase. In order to ensure the success of disaster relief tasks and reduce casualties, it is necessary to establish a reasonable and perfect emergency logistics system. According to the outstanding characteristics of emergency logistics, this paper discusses the optimization of emergency logistics vehicle scheduling path, establishes a mathematical model of emergency logistics vehicle scheduling problem based on unilateral time window, and designs a simulated annealing algorithm for this mathematical model. From the analysis of the results, it can be seen that the algorithm is simple and feasible, with high computational efficiency and fast convergence speed, which is of great significance for speeding up the delivery of materials and handling emergencies.

Published
2021-08-05
How to Cite
Wang Cankun. (2021). Research on Emergency Logistics Vehicle Scheduling Based on Simulated Annealing Algorithm. Design Engineering, 6628-6643. Retrieved from http://www.thedesignengineering.com/index.php/DE/article/view/3164
Section
Articles