计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (3): 189-191.DOI: 10.3778/j.issn.1002-8331.2010.03.058

• 工程与应用 • 上一篇    下一篇

基于改进蚁群算法的铁路路网最优路径规划

薛明昊,杨淮清   

  1. 沈阳工业大学,沈阳 110178
  • 收稿日期:2009-06-22 修回日期:2009-08-16 出版日期:2010-01-21 发布日期:2010-01-21
  • 通讯作者: 薛明昊

Railway network optimization path planning based on improved ant colony algorithm

XUE Ming-hao,YANG Huai-qing   

  1. Shenyang University of Technology,Shenyang 110178,China
  • Received:2009-06-22 Revised:2009-08-16 Online:2010-01-21 Published:2010-01-21
  • Contact: XUE Ming-hao

摘要: 多条件最优路径规划问题是铁路出行查询系统的重要功能之一。将路径规划问题转化为以用户多种条件组合为目标函数的最优化问题,并将改进的蚁群算法应用于该问题,使查询系统能够满足各类用户的查询要求,并给出最优解或次优解。仿真实验表明:该算法的实时性很高,是一种行之有效的方法。

关键词: 蚁群算法, Dijkstra算法, 路径规划

Abstract: Multi-conditional optimal path planning problem is the important function of the railway travelling query system.The path planning problem is converted to the optimization problem with the objective function of the user’s multi-condition’s combination,and the improved ant colony algorithm is applied to the question in order to satisfy kinds of user’s demands for query and then the optimal solution or the subprime solution is proposed.Simulation experiments manifest that the algorithm has higher real time ability and is an effective method.

Key words: ant colony algorithm, dijkstra algorithm, path planning

中图分类号: