期刊文献+

改进的蚁群算法在动态路径诱导中的应用研究 被引量:10

Study on application of improved ant colony algorithm in dynamic route guidance
下载PDF
导出
摘要 针对基本蚁群算法收敛速度慢和易陷入局部最优的缺点,在对信息素和启发信息进行标准化以消除量纲和取值范围影响的基础上,提出带方向的信息素更新和混沌选择策略来改进蚁群算法。将路网节点间的相对位置信息引入信息素更新,以加快搜索速度;使用混沌扰动改进选择策略,以避免出现早熟停滞现象。并将其用于城市交通动态路径诱导的研究中,以重庆市渝中半岛的路网为实例计算以最短行程时间为目标的最优路径,结果表明该算法是有效、可行的,比基本蚁群算法具有更好的全局搜索能力。 Due to the disadvantage of relatively slow convergence and local optimum of basic ant colony algorithm,based on eliminating the influence of the size and dimension of pheromone and heuristic information through standardized transformation, directed pheromone updating on and chaotic selection strategy are proposed to improve ant colony algorithm.Relative location information among nodes in road network is introduced in pheromone updating for higher searching speed,and chaos perturbation is used to improve selection strategy to avoid precocity and stagnation.Then the improved ant colony algorithm is applied in urban traffic dynamic route guidance.The road network of Chongqing Yuzhong Peninsula is taken as an example to calculate the optimal route based on the least travel time,and the experimental results show that this algorithm has much higher capacity of global optimization than basic ant colony algorithm and it is feasible and effective for optimal route choice.
出处 《计算机工程与应用》 CSCD 北大核心 2008年第27期236-239,共4页 Computer Engineering and Applications
基金 重庆市科委自然科学基金(No.2006BA6016)~~
关键词 智能交通系统 动态路径诱导 蚁群算法 最优路径 混沌扰动 intelligent transportation system dynamic route guidance ant colony algorithm optimal route chaos perturbation
  • 相关文献

参考文献15

  • 1Jiang W,Wang J,Chen B.The shortest path algorithm based on hierarchical road network[C]//2006 6th International Conference on ITS Telecommunications Proceedings,2006: 156-158.
  • 2Takahashi M T,Yamakami A.On fuzzy shortest path problems with fuzzy parameters:an algorithmic approaeh[C]//Fuzzy Information Processing Society Annual Meeting of the North American,NAFIPS 2005,2005 : 654-657.
  • 3Wahle J,Annen O,Schuster C,et al.A dynamic route guidance system based on real traffic data[J].European Journal of Operational Research, 2001,13( 1 ) : 302-308.
  • 4Araujo F,Ribeiro B,Rodrigues L.A neural network for shortest path computation[J].IEEE Trans on Neural Networks,2001,12(5): 1067-1073.
  • 5Ahn C W,Ramakrishna R S.A genetic algorithm for shortest path routing problem and the sizing of populations[J].IEEE Trans on Evolutionary Computation, 2002,6(6) : 566-579.
  • 6邹亮,徐建闽.基于遗传算法的动态网络中最短路径问题算法[J].计算机应用,2005,25(4):742-744. 被引量:26
  • 7张波,叶家玮,胡郁葱.模拟退火算法在路径优化问题中的应用[J].中国公路学报,2004,17(1):79-81. 被引量:48
  • 8Fu L,Sun D,Rilett L R.Heuristic shortest path algorithms for transportation applications:state of the art[J].Computers and Operations Research, 2006,33 ( 11 ) : 3324-3343.
  • 9Colorni A,Dorigo M,Maniezzo V.Distributed optimization by ant colonies[C]//Proceedings of 1st European Conference Artificial Life, 1991 : 134-142.
  • 10Dorigo M,Maniezzo V,Colorni A.Ant system:optimization by a colony of cooperating agents[J].IEEE Trans on System,Man and Cybernetics : Part B, 1996,26( 1 ) : 29-41.

二级参考文献15

  • 1(美)EN洛伦兹 刘式达等(译).混沌的本质[M].北京:气象出版社,1997.5.
  • 2KRIKPATRICK S,GELETT C, VEECHI M. Optimization by simulated annealing[J]. Science, 1983, 220(8) :671--680.
  • 3Chen L,IEEE Trans Circuit Syst,1999年,46卷,8期,974页
  • 4Wang L,IEEE Trans Neural Networks,1998年,9卷,4期,716页
  • 5刘式达(译),混沌的本质,1997年
  • 6Chen L,Neural Networks,1995年,8卷,6期,915页
  • 7刘秉正,非线性动力学与混沌基础,1994年
  • 8SUNG K,MICHAEL GH,SEONG BM.Shortest paths in a network with time-dependent flow speeds[J].European Journal of Operational Research,2000,121(12):32-39.
  • 9FU LP,RILETT LR.Expected Shortest Paths In Dynamic and Stochastic Traffic Networks[J].Transportation Research-Part B,1998,32(7):499-514.
  • 10KAUFMAN DE,SMITH RL.Fastest path in time-dependent networks for intelligent vehicle-highway systems application[J].IVHS Journal,1993,11(1):1-11.

共引文献85

同被引文献79

引证文献10

二级引证文献24

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部