DocumentCode
2928552
Title
An Improved Ant Colony Algorithm for Open Vehicle Routing Problem with Time Windows
Author
Guiyun, Li
Author_Institution
Coll. of Econ. & Trade, Hunan Univ., Changsha, China
Volume
2
fYear
2009
fDate
26-27 Dec. 2009
Firstpage
616
Lastpage
619
Abstract
According to the open vehicle routing problem (OVRP), a vehicle is not required to return to the distribution depot after servicing the last customer on its route. In this paper, the open vehicle routing problem with time windows (OVRPTW) is considered, and a mixed integer programming mathematic model of OVRPTW was proposed in detail. Meantime, an improved ant colony algorithm (IACA) was proposed to overcome the shortcomings of premature convergence and slow convergence of conventional ant colony algorithm (ACA). The experiment results showed that the IACA can solve OVRPTW effectively.
Keywords
integer programming; transportation; conventional ant colony algorithm; improved ant colony algorithm; mixed integer programming mathematic model; open vehicle routing problem; time windows; Convergence; Costs; Educational institutions; Industrial engineering; Information management; Innovation management; Linear programming; Mathematics; Routing; Vehicles;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Management, Innovation Management and Industrial Engineering, 2009 International Conference on
Conference_Location
Xi´an
Print_ISBN
978-0-7695-3876-1
Type
conf
DOI
10.1109/ICIII.2009.307
Filename
5370068
Link To Document