期刊文献+

基于蚁群优化算法与出租车GPS数据的公众出行路径优化 被引量:35

Public Travel Route Optimization Based on Ant Colony Optimization Algorithm and Taxi GPS Data
原文传递
导出
摘要 以出租车GPS采集的浮动车数据为依据,研究出租车驾驶员路径选择的认知及类蚂蚁的行为特征。根据城市道路功能等级与出租车的通行频率等信息素,建立出租车驾驶员路径选择信息素等级路网,并以此作为路网初始信息素,综合考虑路径通行时间、通行距离、路径信息素等级等多个因素,提出了基于蚁群优化算法的公众出行路径规划优化算法。以武汉市路网和浮动车为试验数据,将模型规划的道路与浮动车数据库中的轨迹进行了比较。结果表明:基于蚁群优化算法与出租车GPS数据的公众出行路径同出租车驾驶员选择的出行路径相似度很高,能为公众出行提供出租车驾驶员选择的行车路径。 Taking floating car data(FCD) collected by taxi GPS as reference,taxi driver's route selection recognition and behavior characteristics of ant colony were studied.According to road function level in urban and taxi passing rate,the pheromone hierarchical road network for taxi driver's route selection was set up.Taking it as initial pheromone of road network,comprehensively considering route passing time,passing distance and route pheromone hierarchical,route planning algorithm for public traveling based on ant colony optimization algorithm was proposed.Road of model planning in the paper and track of floating car database were compared by test data of FCD and road network of Wuhan.Results show that route for public traveling based on ant colony optimization algorithm and taxi GPS data is very similar to taxi driver's traveling route.It can provide taxi driver's traveling route for public traveling.
出处 《中国公路学报》 EI CAS CSCD 北大核心 2011年第2期89-95,126,共8页 China Journal of Highway and Transport
基金 国家高技术研究发展计划(“八六三”计划)项目(2009AA11Z213) 国家自然科学基金项目(40801155) “十一五”国家科技支撑计划项目(2008BAK49B02)
关键词 交通工程 公众出行路径 蚁群优化算法 浮动车数据 信息素 traffic engineering public travel route ant colony optimization algorithm floating car data pheromone
  • 相关文献

参考文献10

  • 1MCQUEEN B,SCHUMAN R,CHEN K. Advanced Traveler Information Systems [ M]. Boston: Artech House,Inc. ,2002. 被引量:1
  • 2陆锋,卢冬梅,崔伟宏.交通网络限制搜索区域时间最短路径算法[J].中国图象图形学报(A辑),1999,4(10):849-853. 被引量:74
  • 3LIN S Y,CAI W X. Logistics Vehicle Routing Prob lem Between Two Objects Based on Real-time Traffic Data[C]//IEEE. IEEE International Conference onService Operations and Logistics, and Informatics. New York : IEEE, 2008 : 2989 -2994. 被引量:1
  • 4任刚,王炜,邓卫.带转向延误和限制的最短路径问题及其求解方法[J].东南大学学报(自然科学版),2004,34(1):104-108. 被引量:21
  • 5郑年波,李清泉,徐敬海,宋莺.基于转向限制和延误的双向启发式最短路径算法[J].武汉大学学报(信息科学版),2006,31(3):256-259. 被引量:32
  • 6孙晋麟..基于浮动车GPS/GIS的车辆行驶路径优化研究[D].北京交通大学,2006:
  • 7GONZALEZ H, HAN J W, LI X L,et al. Adaptive Fastest Path Computation on a Road Network: aTraffic Mining Approach [C]//VLDB. Proceedings of the 33rd International Conference on Very LargeData Bases Table of Contents. Vienna: VLDB, 2007: 794 -805. 被引量:1
  • 8DORIGO M, GAMBARDELLA I. M. Ant Colony System:a Cooperative Learning Approach to the Trav-eling Salesman Problem [J]. IEEE Transactions on Evolutionary Computation, 19 9 7,1 ( 1 ) : 5 3-6 6. 被引量:1
  • 9DORIGO M, MAN1EZZO V,COLORNI A, The Ant System: Optimization by a Colony of CooperatingAgent[J]. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 1996,26 ( 1 ): 29-41. 被引量:1
  • 10MESSELODI S, MODENA C M, ZANIN M, et al. Intelligent Extended Floating Car Data Collection [J]. Expert Systems with Applications,2009,36(3): 4213-4227. 被引量:1

二级参考文献20

  • 1陈行星,崔伟宏.城市快速反应系统实验研究[J].环境遥感,1996,11(3):227-233. 被引量:10
  • 2[1]Kirby R F, Potts R B. The minimum route problem for networks with turn penalties and prohibitions [J]. Transportation Research, 1969, 3: 397-408. 被引量:1
  • 3[2]Easa S M. Traffic assignment in practice: overview and guidelines for users [J]. Journal of Transportation Engineering, 1991, 117(6): 602-623. 被引量:1
  • 4[3]De La Barra T. Integrated land use and transport modeling [M]. Cambridge: Cambridge Univ Press, 1989. 65-87. 被引量:1
  • 5[4]Aez J, De La Barra T, Pérez B. Dual graph representation of transport networks [J]. Transportation Research B, 1996, 30(3): 209-216. 被引量:1
  • 6[5]Caldwell T. On finding minimal routes in a network with turning penalties [J]. Communications of the ACM, 1961, 4(2): 107-108. 被引量:1
  • 7[6]Ziliaskopoulos A K, Mahmassani H S. A note on least time path computation considering delays and prohibitions for intersection movements [J]. Transportation Research B, 1996, 30(5): 359-367. 被引量:1
  • 8[7]Pallottino S, Scutella M G. Shortest path algorithms in transportation models: Basemic Timesal and innovative aspects.[EB/OL]. http://ftp.di.unipi.it/pub/techreports/TR-97-06.ps.Z. 1997-06-25/2003-02-15. 被引量:1
  • 9[8]Cherkassky B V, Goldberg A V, Radzik T. Shortest paths algorithms: theory and experimental evaluation [R]. Stanford: Computer Science Department, Stanford University, 1993. 被引量:1
  • 10Zhan F B.Three Fastest Shortest Path Algorithms on Real Road Networks:Data Structures and Procedures[J].Journal of Geographic Information and Decision Analysis,1997,1(1):69-82 被引量:1

共引文献108

同被引文献307

引证文献35

二级引证文献278

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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