An Improved Ant Colony Algorithm for VRP Problem

摘要

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.