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 条
  • [31] Passenger itinerary inference model for congested urban rail networks
    Zhu, Yiwen
    Koutsopoulos, Haris N.
    Wilson, Nigel H. M.
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2021, 123
  • [32] Passenger Flow Assignment Method for Urban Rail Transit Networks Based on Inference of Spatiotemporal Path
    Jian M.
    Wang Z.
    Chen Z.
    Zhao L.
    Chen Q.
    Chen S.
    [J]. Xinan Jiaotong Daxue Xuebao/Journal of Southwest Jiaotong University, 2023, 58 (05): : 1117 - 1125
  • [33] Model of Passenger Route Choice in the Urban Rail Transit Network
    Qiao Ke
    Zhao Peng
    Qin Zhi-peng
    [J]. PROCEEDINGS OF 2ND CONFERENCE ON LOGISTICS, INFORMATICS AND SERVICE SCIENCE (LISS 2012), VOLS 1 AND 2, 2013,
  • [34] A SVR-based Passenger Route Choice Model in Urban Rail Transit Network
    Wang, Luyao
    Jiang, Xi
    Li, Chunxiao
    [J]. 2018 IEEE SMARTWORLD, UBIQUITOUS INTELLIGENCE & COMPUTING, ADVANCED & TRUSTED COMPUTING, SCALABLE COMPUTING & COMMUNICATIONS, CLOUD & BIG DATA COMPUTING, INTERNET OF PEOPLE AND SMART CITY INNOVATION (SMARTWORLD/SCALCOM/UIC/ATC/CBDCOM/IOP/SCI), 2018, : 2130 - 2135
  • [35] TRANSIT ASSIGNMENT FOR CONGESTED PUBLIC TRANSPORT-SYSTEMS - AN EQUILIBRIUM-MODEL
    DECEA, J
    FERNANDEZ, E
    [J]. TRANSPORTATION SCIENCE, 1993, 27 (02) : 133 - 147
  • [36] Passenger route guidance system for multi-modal transit networks
    Lo, HK
    Yip, CW
    Mak, B
    [J]. JOURNAL OF ADVANCED TRANSPORTATION, 2005, 39 (03) : 271 - 288
  • [37] Traffic assignment problem model with turning delays for congested networks
    Institute of Transportation Engineering, Department of Civil Engineering, Tsinghua University, Beijing 100084, China
    [J]. Shi, Q. (dcisqx@mail.tsinghua.edu.cn), 1600, Press of Tsinghua University (52):
  • [38] A dynamic traffic assignment model for highly congested urban networks
    Ben-Akiva, Moshe E.
    Gao, Song
    Wei, Zheng
    Wen, Yang
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2012, 24 : 62 - 82
  • [39] The Hyper Run Assignment Model: simulation on a diachronic graph of congested transit networks with fail-to-board probabilities at stops
    Gentile, Guido
    Miristice, Lory Michelle Bresciani
    Tiddi, Daniele
    Meschini, Lorenzo
    [J]. 2021 7TH INTERNATIONAL CONFERENCE ON MODELS AND TECHNOLOGIES FOR INTELLIGENT TRANSPORTATION SYSTEMS (MT-ITS), 2021,
  • [40] A doubly dynamic schedule-based assignment model for transit networks
    Nuzzolo, A
    Russo, F
    Crisalli, U
    [J]. TRANSPORTATION SCIENCE, 2001, 35 (03) : 268 - 285