DocumentCode
1956973
Title
An improved ant colony optimization algorithm for the vehicle routing problems with time windows
Author
Wang, Bi ; Yu, Hewei
Author_Institution
Sch. of Software Eng., South China Univ. of Technol., Guangzhou, China
fYear
2010
fDate
6-9 Oct. 2010
Firstpage
1
Lastpage
4
Abstract
This paper presents an improved scheme for the vehicle routing problems with time windows based on ant colony optimization algorithm. The new scheme makes the change of heuristic message fast and speeds the convergence process by improving updating method of global pheromone and visibility strategy. Simulation results from eight groups of vehicle transportation case show that the new scheme performs better in vehicle routing problems. It can reduce the iteration times and make optimization solution in a short time.
Keywords
optimisation; transportation; vehicles; ant colony optimization; convergence process; vehicle routing; vehicle transportation; Algorithm design and analysis; Ant colony optimization; Complexity theory; Computational modeling; Optimization; Routing; Vehicles; ant colony optimization; pheromone; time windows; vehicle routing problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Supply Chain Management and Information Systems (SCMIS), 2010 8th International Conference on
Conference_Location
Hong Kong
Print_ISBN
978-962-367-696-0
Type
conf
Filename
5681707
Link To Document