期刊文献+

随机路网拥堵程度频繁变化的步进式诱导算法

Step-by-step Guidance Algorithm for the Frequently Changing Congestion Degree of Stochastic Road Networks
下载PDF
导出
摘要 随机路网拥堵程度频繁变化时,车辆所处路段或交叉口拥堵程度的变化可能直接导致车辆遭遇拥堵,使诱导失效.针对这一问题,首先,以拥堵程度时变的随机路网可变元胞传输模型为基础,进行随机路网模型的拥堵程度频繁变化分析,并建立了拥堵程度变化频次指标.之后,以模拟导弹制导的时间最短路径算法为基础,建立了适用于路网拥堵程度频繁变化情况的步进式诱导算法.针对北京地区的部分路网进行仿真,分为随机路网模型的拥堵程度频繁变化验证和步进式诱导算法验证.仿真结果表明,随机路网模型的拥堵程度变化频次和时间具有随机性;步进式诱导算法更适用于路网拥堵程度频繁变化、起讫点距离远、路网路段长的情况. When the congestion degree of stochastic road networks changes frequently, shifts in the congestion degree of roads or intersections may lead directly to vehicle congestion. This occurrence can cause guidance algorithms to fail. To address this problem, the frequent changes in the congestion degree of stochastic road networks are first analyzed with the use of a novel variable cell transmission model for stochastic road networks with a time-varying congestion degree. Moreover, a frequency index is established for changes in congestion degree. Second, a step-by-step guidance algorithm is established for the frequently changing congestion degree of stochastic road networks based on the least-time path algorithm. Part of a road network in Beijing is used in the simulation, which validates the frequent changes in the congestion degree of stochastic road networks and the step-by-step guidance algorithm. The simulation results indicate that the change frequency and time of the congestion degree of stochastic road networks are random. Furthermore, the step-by-step guidance algorithm is suitable for investigating the frequently changing congestion degree of stochastic road networks, the long distances between origins and destinations, and long road sections.
出处 《交通运输系统工程与信息》 EI CSCD 北大核心 2016年第3期67-72,共6页 Journal of Transportation Systems Engineering and Information Technology
基金 国家自然科学基金(61174181)~~
关键词 交通工程 随机路网 拥堵频繁变化 步进式 诱导算法 traffic engineering stochastic road network congestion frequent changes step-by-step guidance algorithm
  • 相关文献

参考文献8

  • 1BAUZA R, GOZALVEZ J. Traffic congestion detection in large-scale scenarios using vehicle-to-vehicle communications[J]. Journal of Network and Computer Applications, 2013, 36(5): 1295-1307.
  • 2ZHU S J, DU L Y, ZHANG L. Rationing and pricing strategies for congestion mitigation: Behavioral theory, econometric model, and application in Beijing[J].Transportation Research Part B: Methodological, 2013(57): 210-224.
  • 3KOUTSOPOULOS H N, FARAH H. Latent class model for car following behavior[J]. Transportation Research Part B: Methodological, 2012, 46(5): 563-578.
  • 4WU X K, LIU H X. A shockwave profile model for traffic flow on congested urban arterials[J]. Transportation Research Part B: Methodological, 2011, 45(10): 1768-1786.
  • 5龚,李苏剑,邢恩辉.拥堵程度时变的随机路网可变元胞传输模型[J].计算机工程与应用,2015,51(3):6-11. 被引量:3
  • 6ZHAN F B, NOON C E. Shortest path algorithms: an evaluation using real road networks[J]. Transportation Science, 1998, 31(1) : 65-73.
  • 7VIDAL T, CRAINIC T G, GENDREAU M, et al. A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows[J]. Computers &Operations Research, 2013, 40(1):475-489.
  • 8龚,李苏剑,邢恩辉.模拟导弹制导的时间最短路径算法[J].交通运输系统工程与信息,2013,13(6):94-100. 被引量:2

二级参考文献32

  • 1Dijkstra E. A note on two problems with graphs[J].{H}NUMERISCHE MATHEMATIK,1959,(01):269-271.
  • 2Zhan F B,Noon C E. Shortest path algorithms:an evaluation using real road networks[J].{H}Transportation Science,1998,(01):65-73.
  • 3Hart P,Nilsson N,Raphael B. A formal basis for the heuristic determination of minimum cost paths[J].IEEE Trans Syst Science and Cybernetics,1968,(02):100-107.
  • 4Brinkho T. A framework for generating network-based moving objects[J].Geolnformatica,2002,(02):153-180.
  • 5Malandraki C,Daskin M S. Time dependent vehicle routing problems:for-mulations,properties and heuristic algorithms[J].{H}Transportation Science,1992,(03):185-200.
  • 6Donati A V,Montemanni R,Casagrande N. Time dependent vehicle routing problem with a multi ant colony system[J].{H}European Journal of Operational Research,2008,(03):1174-1191.doi:10.1016/j.ejor.2006.06.047.
  • 7Donati A V,Montemanni R,Casagrande N. Time dependent vehicle routing problem with a multi ant colony system[J].{H}European Journal of Operational Research,2008,(03):1174-1191.doi:10.1016/j.ejor.2006.06.047.
  • 8Tavakkoli-Moghaddam R,Gazanfari M,Alinaghian M. A new mathematical model for a competitive vehicle routing problem with time windows solved by simulated annealing[J].{H}JOURNAL OF MANUFACTURING SYSTEMS,2011,(02):83-92.
  • 9Ma J,Fukuda D,Schm?cker J D. Faster hyperpath generating algorithms for vehicle navigation[J].Transportmetrica,2012.1-24.
  • 10龚龚.模拟导弹制导的车辆路径规划方法[P]中国,20121019540182012.

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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