Traffic & Transportation Engineering

Solving of Optimal Path Problem Based on Improved Ant Colony Algorithm

Expand
  • 1.School of Civil Engineering and Transportation,South China University of Technology,Guangzhou 510640,Guangdong,China;2.Guangzhou Panyu Polytechnic,Information Engineering College,Guangzhou 511483,Guangdong,China
胡耀民(1975-),男,博士生,主要从事智能交通和数据挖掘研究.

Received date: 2009-11-02

  Revised date: 2010-05-04

  Online published: 2010-10-25

Supported by

国家自然科学基金资助项目(50978106)

Abstract

In order to provide "high quality" optimal path for the user of navigation systems,a mathematical model of the optimal path with multiple quality constraints is proposed.Then,to solve this model,local pheromone update rules and global update rules of the ant colony algorithm are re-designed,a pheromone update operator is introduced to increase the pheromone on the optimal path dynamically,and a heuristic factor of visibility is improved.As a result,an improved ant colony algorithm is generated.Simulated results demonstrate that the improved ant colony algorithm is of good optimization ability and rapid convergence,and that it helps to accurately find the optimal path meeting multiple quality constraints in the road network.

Cite this article

Hu Yao-min Liu Wei-ming . Solving of Optimal Path Problem Based on Improved Ant Colony Algorithm[J]. Journal of South China University of Technology(Natural Science), 2010 , 38(10) : 105 -110 . DOI: 10.3969/j.issn.1000-565X.2010.10.020

Outlines

/