期刊文献+

基于交通流的车辆路径选择优化方法 被引量:4

Optimization method to vehicle routing based on traffic flow
下载PDF
导出
摘要 针对交通流变化对车辆路径选择的影响,寻找在交通流变化情况下对出行路线进行规划的方法。采用粒子群算法与动态规划相结合的方法对路径进行优化,可得各车辆在交通流影响下的优秀路线。基于真实环境中的路网结构和交通数据进行模拟,结果表明,该方法可增加路径优化的真实性和动态性,而且道路交通流及车辆出行时间都对车辆路径选择产生重要影响。 Response to the impact of traffic flow for vehicle routing,this paper found a method to solve the vehicle routing while knowing the change of traffic flow.It made dynamic programming combing with the changes of the traffic flow to optimize the route between customers.It simulated road structure and traffic data based on real world,which showed that the method introducing traffic flow would advance the truth and dynamic of routing optimization,and that the traffic flow and the departure time of the vehicle would affect routing selection.
出处 《计算机应用研究》 CSCD 北大核心 2013年第6期1675-1677,1715,共4页 Application Research of Computers
基金 山东省高等学校科技计划项目(J12LN22) 山东省优秀中青年科学家科研奖励基金资助项目(BS2012DX041) 山东省自然科学基金项目(ZR2011FQ029) 山东省科技攻关计划项目(2011YD01099)
关键词 交通流 粒子群算法 动态规划 路径优化 时间依赖 traffic flow particle swarm algorithm dynamic programming route optimization time dependence
  • 相关文献

参考文献13

  • 1DANTZIG G, RAMSER J. The truck dispatching problem[ J]. Management Science,1959,6( 1 ) : 80-91.
  • 2BOWMAN E H. Production scheduling by the transportation method of linear programming [ J ]. Operations Research, 1956,4 ( 1 ) : 100-103.
  • 3MALANDRAK I C, DASKIN M S. Time dependent vehicle routing problem : formulation, properties and heuristic algorithms [ J ]. Transportation Science, 1992,26 (3) : 185-200.
  • 4ICHOUA S, GENDREAU M, POTVIN J Y. Vehicle dispatching with time dependent travel times[ J]. European Journal of Operations Research, 2003,344 ( 2 ) : 379- 396.
  • 5HAGHANI A A, JUNG S. A dynamic vehicle routing problem with time-dependent travel times [ J ]. Operations Research, 2005,32 (11) : 2959-2986.
  • 6DONATI A V, MONTEMANNI R, CASAGRANDE N, et al. Time dependent vehicle routing problem with a muhi ant colony system[J]. European Journal of Operational Research ,2008,185(3) :1174-1191.
  • 7LI Jing-quan, MIRCHANDANI P B, BORENDTEIN D. Real-time vehicle rerouting problems with time windows[ J]. European Journal of Operational Research,2009,194 ( 3 ) :711 - 727.
  • 8KRITZINGER S,DOERNER K F, HARTL R F, et al. Using traffic information for time-dependent vehicle routing: social and behavioral sciences [ C ]//Proc of the 7th International Conference on City Logistics. 2012 : 217-229.
  • 9KOK A L, HANS E W, SCHUTTEN J M J. Vehicle routing under time-dependent travel times : the impact of congestion avoidance [ J ]. Computers & Operations Research,2012,39(5 ) :910-918.
  • 10邬开俊,鲁怀伟,杜三山.二进制粒子群优化算法在车辆路径问题中的应用[J].西北民族大学学报(自然科学版),2010,31(4):12-15. 被引量:2

二级参考文献10

  • 1Kennedy J.Eberhart R C.Particle Swarm Optimization[A].in:Proceedings of IEEE International Conference on Neural Networks[C].1995.1942-1948.
  • 2Kennedy J.Eberhart R C.A discrete binary version of particle swarm optimization[C].proceedings of the world multiconference on systemic,cybernetics and informaties[C].Piscataway,NJ:IEEE service center,1997:4104-4109.
  • 3Salmen A,Ahmad I,Al-Madani S.Particle swarm optimization for task assignment problem[J].Microprocessors and Microsystems,2002,26:367-371.
  • 4Addison, Low Paul S, David J. Order and chaos in the dynamics of vehicle platoons[J]. Traffic Engineering & Control, 1996, 37(7-8):456-459.
  • 5Daganzo C F, Cassidy M J, Bertini R L. Possible explanations of phase transitions in highway traffic [ J ]. Transportation Research , Part A , 1999, 33(5): 365-379.
  • 6Jiang Y. Traffic capacity speed and queue-discharge rate of Indiana's four-lane freeway work zones[A]. In: Transportation Research Record 1657, TRB, National Research Council[ C]. Washington D C, 1999.39 - 44.
  • 7Schonfeld P, Chien S. Optimal work zone lengths for two-lane highways [J]. Journal of Transportation Engineering,Urban Transportation Division, ASCE , 1999, 125(1): 21-29.
  • 8Nam D D, Drew D R. Analyzing freeway traffic under congestion: traffic dynamics approach[ J]. Journal of Transportation Engineering, Urban Transportation Division, ASCE ,1998, 12,4(3): 208-212.
  • 9陈卫东,王佳.基于混合蚁群算法的物流配送路径优化[J].计算机工程与设计,2009,30(14):3383-3385. 被引量:13
  • 10李军,谢秉磊,郭耀煌.非满载车辆调度问题的遗传算法[J].系统工程理论方法应用,2000,9(3):235-239. 被引量:110

共引文献48

同被引文献46

  • 1李英,周伟,郭世进.上海公共交通网络复杂性分析[J].系统工程,2007,25(1):38-41. 被引量:65
  • 2常鸣,马寿峰.我国大城市公交网络结构的实证研究[J].系统工程学报,2007,22(4):412-418. 被引量:17
  • 3DDJKSTRA E W. A note on two problems in connection with graphs[J]. Numerische Mathematik, 1959,1 (5) :269-271.
  • 4FLOYD R W. Algorithm 97: shortest path [ J]. Communication ofthe ACM,1962,5(6) :345.
  • 5CRAUSER A, MEHLHORN K, MEYER U,et al. A parallelizationof Dijkstra, s shortest path algorithm [ C] //Proc of the 23rd Symposi-um on Mathematical Foundations of Computer Science. 1998 : 722-731.
  • 6AI-HABBAL M B,KOUTSOPOULOS H N, LERMAN S R. A decom-position algorithm for the all-pairs shortest path problem on massivelyparallel computer architectures [ J]. Transportation Science, 1994,28(3) :273-290.
  • 7ZILIASKOPOULOS A K, KOTZINOS D, MAHMASSANI H S. De-sign and implementation of parallel time-dependent least time path al-gorithm for intelligent transportation system applications [ J]. Trans-portation Research Part C,1997,5(2) :95-107.
  • 8CUI Wei-hong, SHI Wen-zhong, LI Xiao-juan,et al. Research on afeature based spatio-temporal data model [ C]//Lecture Notes inGeoinformation and Colonography. 2006 : 151 -167.
  • 9RAJMOHAN M,SHAHABUDEEN P. Genetic algorithm based ap-proach for vehicle routing problem with time windows [ J]. Interna-tional Journal of Logistics Systems and Management, 2008,4(3):175-179.
  • 10ICHOUA S,GENDREAU M, POTVIN J Y. Vehicle dispatching withtime-dependent travel times[J]. European Journal of OperationalResearch,2003,144(2) :379-396.

引证文献4

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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