Dynamic user equilibrium in public transport networks with passenger congestion and hyperpaths

被引:30
作者
Trozzi, Valentina [1 ]
Gentile, Guido [2 ]
Bell, Michael G. H. [3 ]
Kaparias, Ioannis [4 ]
机构
[1] Univ London Imperial Coll Sci Technol & Med, Ctr Transport Studies, London SW7 2BU, England
[2] Univ Roma La Sapienza, Dipartimento Ingn Civile Edile & Ambientale, I-00184 Rome, Italy
[3] Univ Sydney, Inst Transport & Logist Studies, Sydney, NSW 2006, Australia
[4] City Univ London, City Collaborat Transport Hub, London EC1V 0HB, England
关键词
Dynamic transit assignment; Dynamic shortest hyperpaths; FIFO queues for attractive sets; Erlang pdf; TRANSIT ASSIGNMENT; TRAFFIC ASSIGNMENT; ROUTE CHOICE; MODEL; STRATEGIES;
D O I
10.1016/j.trb.2013.06.011
中图分类号
F [经济];
学科分类号
02 ;
摘要
This paper presents a dynamic user equilibrium for bus networks where recurrent overcrowding results in queues at stops. The route-choice model embedded in the dynamic assignment explicitly considers common lines and strategies with alternative routes. As such, the shortest hyperpath problem is extended to a dynamic scenario with capacity constraints where the diversion probabilities depend on the time at which the stop is reached and on the expected congestion level at that time. In order to reproduce congestion for all the lines sharing a stop, the Bottleneck Queue Model with time-varying exit capacity, introduced in Meschini et al. (2007), is extended. The above is applied to separate queues for each line in order to satisfy the First-In-First-Out principle within every attractive set, while allowing overtaking among passengers with different attractive sets but queuing single file. The application of the proposed model to a small example network clearly reproduces the formation and dispersion of passenger queues due to capacity constraints and thus motivates the implementation of the methodology on a real-size network case as the next step for future research. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:266 / 285
页数:20
相关论文
共 36 条
[1]   A within-day dynamic traffic assignment model for urban road networks [J].
Bellei, G ;
Gentile, G ;
Papola, N .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2005, 39 (01) :1-29
[2]  
Billi C., 2004, TRISTAN 5 5 TRIENN S
[3]   Modeling bus stops in transit networks:: A survey and new formulations [J].
Bouzaïene-Ayari, B ;
Gendreau, M ;
Nguyen, S .
TRANSPORTATION SCIENCE, 2001, 35 (03) :304-321
[4]  
Bouzaiene-Ayari B., 1988, THESIS DEP GENIE IND
[5]  
Cantarella G. E., 2010, 5 IMA C MATH TRANSP
[6]  
Cascetta E, 2009, SPRINGER SER OPTIM A, V29, P1, DOI 10.1007/978-0-387-75857-2
[7]  
Cascetta E., 2001, Transportation Systems Engineering: Theory and Methods, V49
[8]   A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria [J].
Cepeda, M ;
Cominetti, R ;
Florian, M .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2006, 40 (06) :437-459
[9]  
Chabini I, 1998, TRANSPORT RES REC, P170
[10]  
Chriqui C., 1975, Transportation Science, V9, P115, DOI 10.1287/trsc.9.2.115