Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013, Article ID 785383, 9 pages
Research Article

An Improved Ant Colony Algorithm and Its Application in Vehicle Routing Problem

School of Software Engineering, South China University of Technology, Guangzhou, Guangdong 510006, China

Received 6 August 2013; Revised 16 October 2013; Accepted 18 October 2013

Academic Editor: Ali Davoudi

Copyright © 2013 Min Huang and Ping Ding. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Optimal path planning is an important issue in vehicle routing problem. This paper proposes a new vehicle routing path planning method which adds path weight matrix and save matrix. The method uses a new transition probability function adding the angle factor function and visibility function, while setting penalty function in a new pheromone updating model to improve the accuracy of the route searching. Finally, after each cycle, we use 3-opt method to update the optimal solution to optimize the path length. The results of comparison also confirm that this method is better than the traditional ant colony algorithm for vehicle routing path planning method. The result of computer simulation confirms that the method can plan a more rational rescue path focused on the real traffic situation.