南京大学学报(自然科学版) ›› 2019, Vol. 55 ›› Issue (5): 709–717.doi: 10.13232/j.cnki.jnju.2019.05.001

• •    下一篇

基于精英蚁群算法的交通最优路径研究

汪贵庆,袁杰,沈庆宏()   

  1. 南京大学电子科学与工程学院,南京,210023
  • 收稿日期:2019-03-08 出版日期:2019-09-30 发布日期:2019-11-01
  • 通讯作者: 沈庆宏 E-mail:qhshen@nju.edu.cn
  • 基金资助:
    江苏省自然科学基金(BK20181256)

Research on traffic optimal path based on elitist ant system

Guiqing Wang,Jie Yuan,Qinghong Shen()   

  1. School of Electronic Science and Engineering,Nanjing University,Nanjing,210023,China
  • Received:2019-03-08 Online:2019-09-30 Published:2019-11-01
  • Contact: Qinghong Shen E-mail:qhshen@nju.edu.cn

摘要:

随着交通规模的增大,人们对自驾出行的质量需求越来越高,而在当前的交通最优路径选择的研究中,大多只考虑静态的交通路网场景,且忽略了通过交叉口时的代价,造成计算结果和实际行驶的代价之间误差较大.针对这一问题,基于Petri网络,建立了更精确的多因素道路交叉口交通路网模型,提出了基于精英蚁群算法的交通最优路径选择算法,并对经典蚁群算法提出两个方面的改进:第一,在信息素浓度的初始化过程中加入主干道引导和行车方向的引导,以加快蚂蚁群初始的搜索速度;第二,在全局信息素浓度更新时,使用双精英蚂蚁策略,采用相互约束的方式更新两条最优路径上的信息素浓度,解决了算法过早陷入停滞的问题,且计算出多个可供选择的路径.仿真结果表明,该算法在保证收敛性的同时,将搜索到最优路径的概率提升至100%;同时,在得到最优解概率均不低于90%的前提下,该算法的收敛速度是其他算法的数倍.

关键词: 交 通, 最优路径, 路网模型, 蚁群算法, 信息素, 精英策略

Abstract:

The complexity of urban traffic road network and the China's car parc are growing at a high speed. Traffic jam now is a common problem in most citys. And the quality of people's driving trips is being seriously affected. How to plan a real?time and optimal driving route in a complex and variable traffic network has become a real concern for people when they travel. In most of the current research on the optimal route selection of traffic,only the static traffic road network scenario is considered,and the cost of driving through the signal intersections is neglected,which resulting in a large error between the calculation result and the actual driving cost. To solve this problem,a more accurate multi?factor traffic network model with road and signal intersection based on Petri nets is built,and a traffic optimal route selection algorithm based on improved elitist ant system is proposed. Improvements on the classical ant colony optimization are provided in two aspects. Firstly,the main road guiding and driving direction guiding are added in the initialization of the pheromone concentration to speed up the initial search; Secondly,a dual elitist ant strategy is utilized that the pheromone concentration on the two optimal paths is globally updated in mutually constraints way. This strategy can accelerate the convergence of the algorithm while avoiding the local optimal solution and two optimal paths can be searched to for selection. The simulation results show that the probability of finding the optimal path is increased to 100% while the convergence rate is guaranteed with the proposed algorithm. At the same time,the convergence rate of this algorithm is several times of others’ under the premise that the probability of finding the optimal solution is not less than 90%.

Key words: traffic, optimal path, road network model, ant colony optimization, pheromone, elitist strategy

中图分类号: 

  • U495

图1

仙林大学城交通道路Petri网模型"

图2

交叉口及信号灯相位方案抽象图"

图3

交通道路交叉口Petri网模型"

图4

行车方向引导原理图"

表 1

算法参数"

参数类型 数 值
信息启发式因子α 2
期望启发式因子β 2
局部信息素挥发因子ρ 0.15
全局信息素更新因子μ 50
局部信息素更新参数Q 100
转移决策点 q 0 0.02
蚂蚁数量m 24
最大迭代次数I max 200
重复试验次数M 100
初始化信息素浓度 τ T i j ( 0 ) 0.5

表2

30节点交通网络仿真结果对比"

性能指标 最优解 最差解 平均解 得到最优解概率(%) 平均迭代次数
本文算法 968.566 968.566 968.566 100 32.616
ACO 968.566 1219.490 1035.640 19 13.700
EAS 968.566 1060.180 1003.038 56 29.333

图5

收敛性对比图"

表 3

三种算法的收敛速度对比"

性能指标 平均解 得到最优解概率(%) 平均迭代次数
本文算法 968.566 100 32.616
ACO 979.944 90 146.421
EAS 974.255 92 61.105
1 Dantzig G B , Ramser J H . The truck dispatching problem. Management Science,1959,6(1):80-91.
2 Dijkstra E W . A note on two problems in connexion with graphs. Numerische Mathematik,1959,1(1):269-271.
3 Hart P E , Nilsson N J , Raphael B . A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics,1968,4(2):100-107.
4 Dorigo M . Optimization learning and natural algorithms. Ph .D. Dissertation. Milano,Italy:Elettronica,Politecnico di Milano,1992.
5 Salhi S , Sari M . A multi?level composite heuristic for the multi?depot vehicle fleet mix problem. European Journal for Operations Research,1997,103(1):95-112.
6 Pfahringer B . Multi?agent approach to open shop scheduling: adapting the Ant?Q formalism. Technical Report TR?96?09. Wien,Austria:?sterreichisches Forschungsinstitut für Artificial Intelligence,1996.
7 Leguizamón G , Michalewicz Z . A new version of ant system for subset problems∥Proceedings of the 1999 Congress on Evolutionary Computation. Piscataway,NJ,USA:IEEE Press,1999,2:1458-1464.
8 郑卫国,田其冲,张磊 . 基于信息素强度的改进蚁群算法. 计算机仿真,2010,27(7):191-193,229.
Zheng W G , Tian Q C , Zhang L . An improved ant colony algorithm based on pheromone intensity. Computer Simulation,2010,27(7):191-193,229.
9 吴虎发,李学俊,章玉龙 . 改进的蚁群算法求解最短路径问题. 计算机仿真,2012,29(8):215-218,353.
Wu H F , Li X J , Zhang Y L . Improved ant algorithm to solve shortest path problem. computer simulation,2012,29(8):215-218,353.
10 Liu X J . Application of improved ant colony algorithm in QoS routing optimization. Advanced Materials Research,2010,108-111:353-358.
11 Cao H H . A QoS routing algorithm based on ant colony optimization and mobile agent. Procedia Engineering,2012,29:1208-1212.
12 王列伟,吴朔,胡俊华 . 基于Petri网的道路交叉口建模方法及比较研究. 计算机工程与应用,2018,54(14):211-216,248.
Wang L W , Wu S , Hu J H . Modelling and comparisons of traffic intersections based on Petri nets. Computer Engineering and Applications,2018,54(14):211-216,248.
13 Webster F V . Traffic signal settings. Road Research Technique Paper No. 39. London:Road Research Laboratory,1958:39.
14 Bonabeau E , Dorigo M , Theraulaz G . Swarm intelligence: from natural to artificial intelligence. New York: Oxford University Press,1999.
15 Deneubourg J L , Aron S , Goss S ,et al . The self?organizing exploratory pattern of the argentine ant. Journal of Insect Behavior,1990,3(2):159-168.
16 Shah S , Kothari R , Chandra S . Debugging ants: how ants find the shortest route∥2011 8th International Conference on Information,Communications and Signal Processing.Singapore,2011:1-5.
17 Dorigo M , Maniezzo V , Colorni A . Ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems,Man, Cybernetics and , Part B ,1996,26(1):29-41.
[1]  王 璐, 邱桃荣** , 何 妞, 刘 萍 .  基于粗糙集和蚁群优化算法的特征选择方法*

[J]. 南京大学学报(自然科学版), 2010, 46(5): 487-493.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] 孙 玫,张 森,聂培尧,聂秀山. 基于朴素贝叶斯的网络查询日志session划分方法研究[J]. 南京大学学报(自然科学版), 2018, 54(6): 1132 -1140 .
[2] 魏 桐,童向荣. 基于加权启发式搜索的鲁棒性信任路径生成[J]. 南京大学学报(自然科学版), 2018, 54(6): 1161 -1170 .
[3] 周星星,张海平,吉根林. 具有时空特性的区域移动模式挖掘算法[J]. 南京大学学报(自然科学版), 2018, 54(6): 1171 -1182 .
[4] 韩明鸣, 郭虎升, 王文剑. 面向非平衡多分类问题的二次合成QSMOTE方法[J]. 南京大学学报(自然科学版), 2019, 55(1): 1 -13 .
[5] 刘 素, 刘惊雷. 基于特征选择的CP-nets结构学习[J]. 南京大学学报(自然科学版), 2019, 55(1): 14 -28 .
[6] 王伯伟, 聂秀山, 马林元, 尹义龙. 基于语义相似度的无监督图像哈希方法[J]. 南京大学学报(自然科学版), 2019, 55(1): 41 -48 .
[7] 孔 颉, 孙权森, 纪则轩, 刘亚洲. 基于仿射不变离散哈希的遥感图像快速目标检测新方法[J]. 南京大学学报(自然科学版), 2019, 55(1): 49 -60 .
[8] 贾海宁, 王士同. 面向重尾噪声的模糊规则模型[J]. 南京大学学报(自然科学版), 2019, 55(1): 61 -72 .
[9] 严云洋, 瞿学新, 朱全银, 李 翔, 赵 阳. 基于离群点检测的分类结果置信度的度量方法[J]. 南京大学学报(自然科学版), 2019, 55(1): 102 -109 .
[10] 阚 威, 李 云. 基于LSTM的脑电情绪识别模型[J]. 南京大学学报(自然科学版), 2019, 55(1): 110 -116 .