Title :
Research on Vehicle Routing Problem with Time Windows Based on Improving Ant Colony Algorithm
Author_Institution :
Coll. of Econ. & Trade, Hunan Univ., Changsha, China
Abstract :
In this paper, the vehicle routing problem with time windows (VRPTW) was considered, and a mixed integer programming mathematic model of VRPTW 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 VRPTW effectively.
Keywords :
integer programming; transportation; vehicles; improved ant colony algorithm; mixed integer programming mathematic model; time windows; vehicle routing problem; Algorithm design and analysis; Convergence; Costs; Information management; Innovation management; Linear programming; Mathematical model; Mathematics; Routing; Vehicles; improved ant colony algorithm (IACA); integer programming; logistics; vehicle routing problem;
Conference_Titel :
Information Management, Innovation Management and Industrial Engineering, 2009 International Conference on
Conference_Location :
Xi´an
Print_ISBN :
978-0-7695-3876-1
DOI :
10.1109/ICIII.2009.107
