An Improved Ant Colony Algorithm for the Shortest Path in Citys Road Network

摘要：

　　The shortest path between the start node and end node plays an important role in citys road traffic network analysis system.The basic ant colony system algorithm which is a novel simulated evolutionary algorithm is studied to solve the shortest path problem.But the basic ant colony system algorithm is easy to run into the local optimum solution for shortest path.In order to solve the problem,the improved ant colony system algorithm is proposed.The improvement methods for selection strategy,local search,and information quantity modification of basic ant colony system are discussed in detail.The experiments are done in Beijing road network in China.The results of experiments show that comparing with the basic ant colony algorithm,the improved algorithm can easily converge at the global optimum for the shortest path.

关键词： ant colony system shortest path road network

作者: Jun BI Jie ZHANG Wenle XU

作者单位: School of Traffic and Transportation, Beijing Jiaotong UniversityBeijing 100044, China

会议类型: 国际会议

会议名称: the Second International Conference on Frontiers of Manufacturing and Design Science(第二届制造与设计科学国际会议(ICFMD 2011))

会议地点: 台湾

会议语种:英文

页码: 1296-1300

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