DocumentCode
3314129
Title
Hybrid Behavior Ant Colony Algorithm for Vehicle Routing Problem
Author
Wang, Miao
Author_Institution
Mil. Transp. Dept., Mil. Transp. Univ., Tianjin, China
fYear
2012
fDate
17-19 Aug. 2012
Firstpage
168
Lastpage
171
Abstract
Vehicle Routing Problem (VRP) is one of critical problems in modern logistics service. In order to overcome the shortcomings of the basic Ant Colony Optimization (ACO) algorithm, which has long searching time and easily jumps into local optimal solution, a hybrid behavior ACO algorithm is presented for solving the VRP problem. A series of rules of the ants´ behaviors are defined. The simulation results show that the above approach is reasonable and efficient.
Keywords
ant colony optimisation; vehicles; ACO algorithm; VRP; hybrid behavior ant colony algorithm; local optimal solution; modern logistics service; searching time; vehicle routing problem; Algorithm design and analysis; Ant colony optimization; Clustering algorithms; Radiation detectors; Routing; Vehicles; Ant Colony Optimization algorithm; VRP problem; mixed behavior;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational and Information Sciences (ICCIS), 2012 Fourth International Conference on
Conference_Location
Chongqing
Print_ISBN
978-1-4673-2406-9
Type
conf
DOI
10.1109/ICCIS.2012.168
Filename
6300307
Link To Document