一种改进的公交配流模型与算法

任华玲; 杨东赤; 四兵锋

doi:10.3879/j.issn.1000-0887.2013.02.010

一种改进的公交配流模型与算法

doi: 10.3879/j.issn.1000-0887.2013.02.010

北京交通大学交通运输学院,北京100044

基金项目: 国家重点基础研究发展计划973项目资助课题(2012CB725401)；国家自然科学基金资助项目(71131001；71071014)；中央高校基本科研业务费资助项目(2012JBZ005,2013JBM045)

详细信息

作者简介:
任华玲(1975—),女,安徽人,副教授,博士(通讯作者. E-mail: hlren@bjtu.edu.cn);杨东赤(1988—),男,河北人,研究生;四兵锋(1972—),男,河北人,副教授,博士,研究生导师.

中图分类号: U491.1⁺⁴
计量
- 文章访问数: 1690
- HTML全文浏览量: 53
- PDF下载量: 1308
- 被引次数: 0
出版历程
- 收稿日期: 2012-09-10
- 修回日期: 2012-11-14
- 刊出日期: 2013-02-15

An Improved Model and Algorithm for Transit Assignment Problem

School of Traffic and Transportation, Beijing Jiaotong University,Beijing 100044, P.R.China

摘要

摘要: 对两种经典的公交配流模型进行了对比分析，指出了在考虑拥挤影响时两种模型进行公交配流各自存在的缺点．随后对两种模型存在的不足进行了原因分析，并在此基础上对Spiess和Florian提出的线性规划模型及算法进行了改进．改进的模型运用了“最优策略”和“有效频率”的思想，考虑了拥挤对站点乘客等车时间的影响．模型用MSA（相继平均法）算法进行求解，最后在一个简单网络上进行对比分析，表明改进后的模型能够较合理地求解考虑站点拥挤的公交配流问题．
- 公交配流 /
- 拥挤 /
- 策略 /
- 有效频率
Abstract: 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.
- transit assignment /
- congestion /
- strategies /
- effective frequency

HTML全文

参考文献(17)

[1]	Dial R B.Transit pathfinder algorithms[J]. Highway Research Record,1967(205): 67-85.
[2]	Fearnside K, Draper D P.Public transport assignment—a new approach[J]. Traffic Engineering and Control,1971, 12: 298-299.
[3]	Le Clercq F.A public transport assignment model[J]. Traffic Engineering and Control,1972, 14: 91-96.
[4]	Chriqui C, Robillard P.Common bus lines[J]. Transportation Science, 1975, 9(2): 115-121.
[5]	Spiess H, Florian M.Optimal strategies: a new assignment model for transit networks[J]. Transportation Research Part B,1989, 23(2): 83-102.
[6]	de Cea J, Fernández E.Transit assignment for a congested public transport systems: an equilibrium model[J]. Transportation Science,1993, 27(2): 133-147.
[7]	Tong C O, Wong S C.A stochastic transit assignment model using a dynamic schedulebased network[J]. Transportation Research Part B,1998, 33(2): 107-121.
[8]	Kurauchi F, Bell M G H, Schmcker J D.Capacity constrained transit assignment with common lines[J]. Journal of Mathematical Modeling and Algorithms,2003, 2(4): 309-327.
[9]	Nuzzolo A, Russo F, Crisalli U.A doubly dynamic schedulebased assignment model for transit networks[J]. Transportation Science,2001, 35(3): 268-285.
[10]	Poon M H, Wong S C, Tong C O.A dynamic schedulebased model for congested transit networks[J]. Transportation Research Part B, 2004, 38(4): 343-368.
[11]	Hamdouch Y, Lawphongpanich S.Schedulebased transit assignment model with travel strategies and capacity constraints[J]. Transportation Research Part B,2008, 42(7/8): 663-684.
[12]	Wu J H, Florian M, Marcotte P.Transit equilibrium assignment: a model and solution algorthms[J]. Transportation Science,1994, 28(3): 193-203.
[13]	Cepeda M, Cominetti R, Florian M.A frequencybased assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria[J]. Transportation Research Part B,2006, 40(6): 437-459.
[14]	Schmocker JD, Fonzone A, Shimamoto H, Kurauchi F, Bell M G H.Frequencybased transit assignment considering seat capacities[J]. Transportation Research Part B,2011, 45(2): 392-408.
[15]	Cominetti R, Correa J.Commonlines and passenger assignment in congested transit networks[J]. Transportation Science,2001, 35(2): 250-267.
[16]	LI Zhi-chun, Lam W H K, Wong S C.The optimal transit fare structure under different market regimes with uncertainty in the network[J]. Netwoks & Spatial Economics,2009, 9(2): 191-216.
[17]	Tian Z L, Yang H, Lam W H K.Transit assignment under crowded conditions[J]. Journal of Advanced Transportation,1997, 31(1): 19-38.