DocumentCode
400308
Title
Dynamic vehicle routing problem using hybrid ant system
Author
Tian, Yan ; Song, Jingyan ; Yao, Danya ; Hu, Jianming
Author_Institution
Dept. of Autom., Tsinghua Univ., Beijing, China
Volume
2
fYear
2003
fDate
12-15 Oct. 2003
Firstpage
970
Abstract
The dynamic vehicle routing problem, DVRP, consists in optimally routing a fleet occur at random. The optimization consists in finding the solution that minimizes the total length of tours and satisfying the customer delivery time window. In this paper, we present a hybrid ant system to handle the dynamism by means of modifying the pheromone matrix and candidate sets strategy. In addition, we make further improvements on vehicle routes with the local search heuristics. The results show that the hybrid ant system works effectively to find competitive solutions.
Keywords
distribution strategy; heuristic programming; optimisation; transportation; candidate set strategy; customer delivery time window; dynamic vehicle routing problem; hybrid ant system; optimization; pheromone matrix; search heuristics; Electronic commerce; Helium; Routing; Supply chains; Systems engineering and theory; Telecommunication computing; Traveling salesman problems; Uncertainty; Vehicle dynamics; Vehicles;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Transportation Systems, 2003. Proceedings. 2003 IEEE
Print_ISBN
0-7803-8125-4
Type
conf
DOI
10.1109/ITSC.2003.1252630
Filename
1252630
Link To Document