Dynamic Vehicle Routing Problem and its Algorithm Analysis

Article Preview

Abstract:

Based on systematically illustrating the current research of dynamic vehicle routing problem and one-off optimization strategies, the paper takes dynamic vehicle routing problem with time window as the study object, proposed a new INTER-SQM dynamic programming strategy to optimize the traffic path of moving vehicle, which highlights the robustness of INTER-SQM strategy, the corresponding ant colony optimization is presented also. Random test compares the operating performance of various optimization strategies in different strong dynamic degrees scenario, discusses the characteristics of the INTER-SQM strategy and points out the research direction of dynamic vehicle routing problem.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 129-131)

Pages:

1381-1384

Citation:

Online since:

August 2010

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2010 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Powell W B: Stochastic and dynamic networks and routing. In: Ball M O, Magnanti T L, Nemhauser G L, eds. Network Routing, Amsterdam: North-Holland, pp.141-295. (1995).

Google Scholar

[2] Bertsimas D J, Simchi-Levi: A new generation of vehicle routing: robust algorithms, addressing uncertainty, Operations Research, Vol. 44, pp.286-304. (1996).

DOI: 10.1287/opre.44.2.286

Google Scholar

[3] Allan Larsen: The Dynamic Vehicle Routing Problem, Printed by IMM, DTU Bookbinder Hans Meyer(2000).

Google Scholar

[4] Colorni A , Dorigo M , Maniezzo V , et al: Distributed optimization by ant colonies, Proc. of the First European Conf . on Artificial Life. Paris : Elsevier Publishing , pp.134-142. (1991).

Google Scholar

[5] Dimitris Bertsimas and Garrett Van Ryzin: A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane. Operations Research, Vol. 39, pp.601-615, (1991).

DOI: 10.1287/opre.39.4.601

Google Scholar