This paper is about the forbidding time window based on the vehicle routing problem in emergency transportation. Firstly, the research problem is defined where the road and nodes of traffic network both have a forbidding time window. The objective is to minimize the dispatch time through the path chosen, consider the combination property of model, and use dynamic programming and develop Label Algorithm to design the problem solving method. Lastly, an example is taken to show and illustrate the effectiveness of the algorithm.
Optimization Research about the Time Window Based Transportation Routing Problem of Emergency Transportation
International Conference of Logistics Engineering and Management (ICLEM) 2010 ; 2010 ; Chengdu, China
ICLEM 2010 ; 3438-3443
2010-09-09
Conference paper
Electronic Resource
English
British Library Online Contents | 2005
|