检索
E-mail
RSS
作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (5): 1-4.doi: 10.3969/j.issn.1000-3428.2008.05.001

• 博士论文 •    下一篇

避免车辆路径拥塞的动态蚁群算法

潘 登，郑应平，陆小芳   

  1. (同济大学电子与信息工程学院，上海 201804)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-03-05 发布日期:2008-03-05

Dynamic Ant Colony Algorithm for Avoiding Congestion on Vehicle Routes

PAN Deng, ZHENG Ying-ping, LU Xiao-fang   

  1. (School of Electronic & Information Engineering, Tongji University, Shanghai 201804)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-03-05 Published:2008-03-05

PDF

1274

被引次数

9

摘要： 运用蚁群算法，对非闭合线路避免拥塞现象的车辆路径问题进行研究，提出了深度为1的树结构指针推进策略和相应的路径优化算法，为交通管理和车辆导航提供决策依据。仿真结果表明该算法具有较强的道路拥塞识别能力，能够有效缓解道路拥塞现象。

关键词: 车辆路径问题, 拥塞, 指针推进策略, 动态蚁群算法

Abstract: In order to avoid the congestion on the non-closed routes, the Vehicle Routing Problem(VRP) is studied with the ant colony algorithm. This paper presents the pointer marching strategy with the one-depth tree structure and the optimal algorithm for the related vehicle routing problem, which provides references for decision-making in traffic management and vehicle guiding. The simulation shows that the improved algorithm can relieve the congestion effectively with its ability to distinguish it.

Key words: Vehicle Routing Problem(VRP), congestion, pointer marching strategy, dynamic ant colony algorithm

中图分类号: