Dynamic Vehicle Routing Problem and its Algorithm Analysis

Abstract:

Article Preview

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.

Info:

Periodical:

Advanced Materials Research (Volumes 129-131)

Edited by:

Xie Yi and Li Mi

Pages:

1381-1384

DOI:

10.4028/www.scientific.net/AMR.129-131.1381

Citation:

L. Lin "Dynamic Vehicle Routing Problem and its Algorithm Analysis", Advanced Materials Research, Vols. 129-131, pp. 1381-1384, 2010

Online since:

August 2010

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.