An Improved Ant Colony Algorithm for Vehicle Shortest Path Problem

摘要：

An algorithm of the transition probability was studied. The model used contains several traffic parameters. Pheromone update strategy including traffic density factor was adopted, the algorithm could resolve the shortest path problem with the real-time trafic information. To avoid local minimal problem, the ant colony algorithm ? was combined with genetic algorithm. Compared with traditional algorithm, the results of the experimentation showed that the algorithm could find the shortest running path accurately and quickly.

关键词： ant colony algorithm shortest path problem real-time traffic information traffic density

作者: WANG Yue XUE Guoxin LONG Shiyu

作者单位: School of Information Science and Engineering Changzhou University Changzhou China

会议类型: 国际会议

会议名称: The 13th IEEE Joint International Computer Science and Information Technology Conference(2011年第13届IEEE联合国际计算机科学与信息技术会议 JICSIT 2011)

会议地点: 重庆

会议语种:英文

页码: 1171-1173

在线出版日期: 2011-08-20（万方平台首次上网日期，不代表论文的发表时间）