期刊文献+

智能交通中的高效多准最短路径混合算法 被引量:8

Efficient hybrid algorithm for multi-shorter-path searching in ITS
下载PDF
导出
摘要 针对智能交通系统(ITS)中求解多条准最短路径的问题,提出了一种混合算法。该算法以Floyd算法和A*算法为基础,主要运用遗传算法来求解多条准最短路径。实验的结果表明了该混合算法的可行性和比其他算法的高效性。 This paper proposed an efficient hybrid algorithm designed to find multi-shorter-path searching in ITS(intelligent traffic system).Based on Floyd algorithm and A* algorithm,and mainly using gene algorithm to get the final result.Finally,the experimental result shows the feasibility and the high efficiency of this algorithm compared with the other algorithm.
出处 《计算机应用研究》 CSCD 北大核心 2011年第9期3301-3304,共4页 Application Research of Computers
基金 国家科技支撑计划资助项目(2007BAH08B04)
关键词 智能交通系统 FLOYD算法 A*算法 遗传算法 准最短路径 混合算法 ITS Floyd algorithm A* algorithm genetic algorithm shorter-path hybrid algorithm
  • 相关文献

参考文献7

  • 1张水舰,李永树.利用GA和GIS的动态路径诱导算法[J].武汉大学学报(信息科学版),2009,34(12):1476-1479. 被引量:6
  • 2张玲,高淑萍,王进鑫.动态多路径选择的混合演化算法[J].计算机工程与应用,2009,45(8):200-203. 被引量:4
  • 3李威武,王慧,钱积新.智能交通系统中路径诱导算法研究进展[J].浙江大学学报(工学版),2005,39(6):819-825. 被引量:33
  • 4BILAL J M,JACOB D.Intelligent traffic control system. Proc ofIEEE International Conference on Signal Processing and Communica-tions . 2007
  • 5ZHANG Kai-sheng,GAO Ming-xing,MA Wen-bo.Study on urbantraffic intelligent guidance system. Proc of the 3rd InternationalConference on Information Science and Management Engineering . 2010
  • 6AN Jian-cheng,JIN Hai-juan,LIU Chao-hui.Improved real-codinggenetic algorithm. Proc of the 3rd International Conference onNetworks Security,Wireless Communications and Trusted Computing . 2009
  • 7LIN Chu-shing,YU Jui-ling,LIU Jung-chun,et al.Genetic algorithmfor shortest driving time in intelligent transportation systems. Proc of the 3rd International Conference on Multimedia and Ubiqui-tous Engineering . 2008

二级参考文献57

  • 1张赫,杨兆升,王炜.基于实时交通流信息的中心式动态路径诱导系统行车路线优化技术研究[J].公路交通科技,2004,21(9):91-94. 被引量:18
  • 2宋春跃,李平.递阶变时域滚动优化生产控制策略[J].浙江大学学报(工学版),2004,38(12):1623-1628. 被引量:4
  • 3李威武,王慧,钱积新.智能交通系统中路径诱导算法研究进展[J].浙江大学学报(工学版),2005,39(6):819-825. 被引量:33
  • 4Dijkstra E W. A Note on Two Problems in Connection with Graphs[J]. Numerical Mathematics, 1959 (1): 269-271.
  • 5Noto M, Sato H. A Method for the Shortest Path Search by Extended Dijkstra Algorithm[C]. IEEE International Conference on System, Man, and Cybernetics, Nashville, TN, 2000.
  • 6Kaufman D E, Smith R L. Fastest Path in Time- Dependent Networks for Intelligent Vehicle-high- way Systems Application[J]. IVHS Journal, 1993,11(1): 1-11.
  • 7Sung K, Bell M G H, Seong M, et al. Shortest Paths in a Network with Time Dependent Flow Wpeeds[J]. European Journal of Operation Research, 2000,12(12): 32-39.
  • 8Boyce D E, Tarko A. Estimation of Link Travel Time with a Large Scale Network Flow Model for a Dynamic Route Guidance System[C]. IVHS American 1994 Annual Meeting, Atlanta, Georgia, 1994.
  • 9Takagi H. Interactive Evolutionary Computation: Fusion of the Capabilities of EC Optimization and Human Evaluation[J]. IEEE Special Issue on Industrial Innovation Using Soft Computing, 2001, 89 (9):1 275-1 296.
  • 10Dozier G, Carnahan B. An Interactive Distributed Evolutionary Algorithm for Design[C]. IEEE International Conference on Systems, Man, and Cybernetics, Waikoloa, Hawaii, 2005.

共引文献38

同被引文献60

引证文献8

二级引证文献35

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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