The Study on Optimal Model and algorithm for Emergency Materials Dispatching with Dynamic Travel Time
The emergency materials 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 we add a new constriant for the model which aims to decide the key routes that need to be reparied or evanesced priority,and we also consider dynamic travel time as the model constraint and it satisfies the ‘‘first-in-first-out’’ property.This paper adopted improved simulated annealing algorithm to imporve the efficiency of the vehicles distribution,the results show that the proposed model is reasonable and algorithm is valid,and the same the results can also help decision-makers identify the key routes.
annealing algorithm EMDP dynamic travel time
Li Lei
College of Engineering,Zhejiang Normal University Jinhua Zhejiang 321004,China
国际会议
北京
英文
170-172
2010-10-15（万方平台首次上网日期，不代表论文的发表时间）