An Improved Ant Colony Algorithm for VRP Problem

Author

Wang Geng-Sheng ; Yu Yun-Xin

Author_Institution

Sch. of Inf. Eng., East China Jiaotong Univ., Nanchang, China

fYear

2010

fDate

2-4 April 2010

Firstpage

129

Lastpage

133

Abstract

Vehicle routing problem(VRP) is an NP-hard problem, Ant colony algorithm is an effective tool for solving combinatorial optimization problems like VRP. On the base of understanding VRP problem and Ant Colony Algorithm (ACA), analysis ACA´s application in VRP, for its shortcomings, reference MMAS thought, introduce dynamic negative feedback mechanism and appropriate increase the visibility mechanism, to improve the ant colony algorithm, then combine with the saving function for VRP problem. Simulate result shows that: The proposed algorithm is better than ACS in optimum value and the rate of convergency, has a strong practical, can be effective to solve the VRP problem.

Keywords

combinatorial mathematics; computational complexity; convergence; optimisation; transportation; ACA application; MMAS thought; NP-hard problem; VRP problem saving function; ant colony algorithm; combinatorial optimization problems; convergence rate; dynamic negative feedback mechanism; vehicle routing problem; visibility mechanism; Costs; Informatics; Information security; Information technology; Mathematical model; NP-hard problem; Negative feedback; Routing; Transportation; Vehicle dynamics; ACS; Dynamic negative feedback mechanism; MMAS; Saving function; VRP;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Information Technology and Security Informatics (IITSI), 2010 Third International Symposium on

Conference_Location

Jinggangshan

Print_ISBN

978-1-4244-6730-3

Electronic_ISBN

978-1-4244-6743-3

Type

conf

DOI

10.1109/IITSI.2010.86

Filename

5453634