收稿日期: 2009-11-02
修回日期: 2010-05-04
网络出版日期: 2010-10-25
基金资助
国家自然科学基金资助项目(50978106)
Solving of Optimal Path Problem Based on Improved Ant Colony Algorithm
Received date: 2009-11-02
Revised date: 2010-05-04
Online published: 2010-10-25
Supported by
国家自然科学基金资助项目(50978106)
胡耀民 刘伟铭 . 基于改进型蚁群算法的最优路径问题求解[J]. 华南理工大学学报(自然科学版), 2010 , 38(10) : 105 -110 . DOI: 10.3969/j.issn.1000-565X.2010.10.020
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.
Key words: route planning; optimal path; improved ant colony algorithm; path quality
/
| 〈 |
|
〉 |