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.