期刊文献+

一种改进的公交配流模型与算法 被引量:1

An Improved Model and Algorithm for Transit Assignment Problem
下载PDF
导出
摘要 对两种经典的公交配流模型进行了对比分析,指出了在考虑拥挤影响时两种模型进行公交配流各自存在的缺点.随后对两种模型存在的不足进行了原因分析,并在此基础上对Spiess和Florian提出的线性规划模型及算法进行了改进.改进的模型运用了"最优策略"和"有效频率"的思想,考虑了拥挤对站点乘客等车时间的影响.模型用MSA(相继平均法)算法进行求解,最后在一个简单网络上进行对比分析,表明改进后的模型能够较合理地求解考虑站点拥挤的公交配流问题. The two classical models for transit assignment,pointing out their flaws for passenger flows assignment over congested networks were compared and analyzed.The causes leading to the results of these two models were analysed,based on which,the programming model and its algorithm of Spiess and Florian were improved.The improved model combined the ideas of "effective frequency" and "optimal strategies".The congestion was assumed to influence the waiting time at the stop only in our model,then the MSA was adopted to solve this problem.Finally these three methods were compared to solve the transit assignment problem in a simple example and the advantages of the improved model was summarized.
出处 《应用数学和力学》 CSCD 北大核心 2013年第2期199-208,共10页 Applied Mathematics and Mechanics
基金 国家重点基础研究发展计划973项目资助课题(2012CB725401) 国家自然科学基金资助项目(71131001 71071014) 中央高校基本科研业务费资助项目(2012JBZ005 2013JBM045)
关键词 公交配流 拥挤 策略 有效频率 transit assignment congestion strategies effective frequency
  • 相关文献

参考文献17

  • 1Dial R B. Transit pathfinder algorithms[J].Highway Research Record,1967,(205):67-85.
  • 2Fearnside K,Draper D P. Public transport assignment--a new approach[J].Traffic Engineering and Control,1971.298-299.
  • 3Le Clercq F. A public transport assignment model[J].Traffic Engineering and Control,1972.91-96.
  • 4Chriqui C,Robillard P. Common bus lines[J].Transportation Science,1975,(02):115-121.
  • 5Spiess H,Florian M. Optimal strategies:a new assignment model for transit networks[J].Transportation Research Part B:Methodological,1989,(02):83-102.
  • 6de Cea J,Fernández E. Transit assignment for a congested public transport systems:an equilibrium model[J].Transportation Science,1993,(02):133-147.
  • 7Tong C O,Wong S C. A stochastic transit assignment model using a dynamic schedule-based network[J].Transportation Research Part B:Methodological,1998,(02):107-121.
  • 8Kurauchi F,Bell M G H,Schm(o)cker J D. Capacity constrained transit assignment with common lines[J].Journal of Mathemattical Modeling and Algorithms,2003,(04):309-327.
  • 9Nuzzolo A,Russo F,Crisalli U. A doubly dynamic schedule-based assignment model for transit networks[J].Transportation Science,2001,(03):268-285.doi:10.1287/trsc.35.3.268.10149.
  • 10Poon M H,Wong S C,Tong C O. A dynamic schedule-based model for congested transit networks[J].Transportation Research Part B:Methodological,2004,(04):343-368.doi:10.1016/S0191-2615(03)00026-2.

同被引文献13

引证文献1

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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