Passenger Assignment Model Based on Common Route in Congested Transit Networks

被引:8
|
作者
Ren, Hualing [1 ]
Long, Jiancheng [2 ]
Gao, Ziyou [3 ]
Orenstein, Penina [4 ]
机构
[1] Beijing Jiaotong Univ, MOE Key Lab Urban Transportat Complex Syst Theory, Beijing 100044, Peoples R China
[2] Hefei Univ Technol, Sch Transportat Engn, Hefei 230009, Peoples R China
[3] Beijing Jiaotong Univ, Sch Traff & Transportat, Beijing 100044, Peoples R China
[4] Seton Hall Univ, Stillman Sch Business, S Orange, NJ 07079 USA
基金
中国国家自然科学基金;
关键词
Transit assignment; Congested transit network; Common line problem; Common route; Attractive route set; TRAFFIC ASSIGNMENT; ALGORITHMS; SYSTEMS;
D O I
10.1061/(ASCE)TE.1943-5436.0000464
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
In this paper, the common line problem and passengers' choice behaviors in transit networks are revisited and discussed. The concept of the common line problem is extended to represent a common route problem in transit networks. The transit routes are classified into various levels of attractive route sets according to route fixed costs and route frequencies. The transit passenger assignment problem on congested transit networks is defined to assign passenger flows on attractive route sets and is formulated as a variational inequality (VI) problem. In the proposed model, the effective frequency approach is applied to reflect the effects of passenger congestion on the waiting time at the stations. Compared with traditional models, the proposed passenger flow assignment model does not require a modification to the transit network nor a constant recomputation of the changing attractive line set. Finally, a simple example is used to illustrate the difference between common line and common route methods, and the passengers' travel behaviors under various transit conditions are demonstrated on the Sioux Falls transit network. DOI: 10.1061/(ASCE)TE.1943-5436.0000464. (C) 2012 American Society of Civil Engineers.
引用
收藏
页码:1484 / 1494
页数:11
相关论文
共 50 条
  • [1] Common-lines and passenger assignment in congested transit networks
    Cominetti, R
    Correa, J
    [J]. TRANSPORTATION SCIENCE, 2001, 35 (03) : 250 - 267
  • [2] Route based equilibrium assignment in congested transit networks
    Larrain, Homero
    Suman, Hemant K.
    Carlos Munoz, Juan
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2021, 127 (127)
  • [3] Passenger assignment in congested transit networks:: A historical perspective
    Bouzaïene-Ayari, B
    Gendreau, M
    Nguyen, S
    [J]. EQUILIBRIUM AND ADVANCED TRANSPORTATION MODELLING, 1998, : 47 - 71
  • [4] Reliability-Based Transit Assignment for Congested Stochastic Transit Networks
    Szeto, W. Y.
    Solayappan, Muthu
    Jiang, Yu
    [J]. COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, 2011, 26 (04) : 311 - 326
  • [5] PASSENGER FLOW CONTROL IN CONGESTED TRANSIT NETWORKS
    Schmocker, Jan-Dirk
    Shimamoto, Hiroshi
    Kurauchi, Fumitaka
    Bell, Michael G. H.
    [J]. TRANSPORTATION SYSTEMS: ENGINEERING & MANAGEMENT, 2007, : 331 - 340
  • [6] A stochastic user equilibrium assignment model for congested transit networks
    Lam, WHK
    Gao, ZY
    Chan, KS
    Yang, H
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1999, 33 (05) : 351 - 368
  • [7] A schedule-based assignment model with explicit capacity constraints for congested transit networks
    Nuzzolo, Agostino
    Crisalli, Umberto
    Rosati, Luca
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2012, 20 (01) : 16 - 33
  • [8] A passenger traffic assignment model with capacity constraints for transit networks
    Leurent, Fabien
    Chandakas, Ektoras
    Poulhes, Alexis
    [J]. PROCEEDINGS OF EWGT 2012 - 15TH MEETING OF THE EURO WORKING GROUP ON TRANSPORTATION, 2012, 54 : 772 - 784
  • [9] LARGE SCALE APPLICATIONS OF TRANSIT ASSIGNMENT ON CONGESTED NETWORKS
    Florian, M.
    He, S.
    [J]. TRANSPORT DYNAMICS, 2011, : 107 - +
  • [10] Dynamic transit assignment algorithms for urban congested networks
    Crisalli, U
    [J]. URBAN TRANSPORT V: URBAN TRANSPORT AND THE ENVIRONMENT FOR THE 21ST CENTURY, 2000, 5 : 373 - 382