An Optimal Model for Emergency Resource Dispatching based on Simulated Annealing Algorithm
The emergency resources dispatching problem (EMDP) has been addressed in many research papers. few of them take dynamic travel time and how to find key dispatching route into consideration. Based on previous research about the EMDP, in this paper an optimization model is presented , a new model constraint is added which aims to decide the key routes that need to be repaired priority, and the dynamic travel time also considered as the model constraint which satisfies the “first-in–first-out property. This paper adopted improved simulated annealing (SA) algorithm to improve the calculation efficiency. Computational experiments shows that the proposed model is reasonable and algorithm is valid, and the same the results can also help decision-makers identify the key routes.
Emergency Resource Dispatching Simulated Annealing Algorithm Dynamic Travel Time
LI Lei Li Ziruo Lai Xiaolin Yu Xuecai
College of Engineering, Zhe Jiang Normal University, Jin hua 321004, China
国际会议
长沙
英文
71-73
2014-05-31（万方平台首次上网日期，不代表论文的发表时间）