Bus schedule for optimal bus bunching and waiting times

被引:0
|
作者
Koppisetti, M. Venkateswararao [1 ]
Kavitha, Veeraruna [1 ]
Ayesta, Urtzi [2 ]
机构
[1] Indian Inst Technol, IEOR, Bombay, Maharashtra, India
[2] CNRS, Toulouse, France
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In a bus transportation system the time gap between two successive buses is called headway. When the headways are small (high-frequency bus routes), any perturbation (e.g., in the number of passengers using the facility, traffic conditions, etc.) makes the system unstable, and the headway variance tends to increase along the route. Eventually, buses end up bunching, i.e, they start travelling together. Bus bunching results in an inefficient and unreliable bus service and is one of the critical problems faced by bus agencies. Another important aspect is the expected time that a typical passenger has to wait before the arrival of its bus. The bunching phenomenon might reduce if one increases the headway, however this can result in unacceptable waiting times for the passengers. We precisely study this inherent trade-off and derive a bus schedule optimal for a joint cost which is a convex combination of the two performance measures. We assume that the passengers arrive according to a fluid process, board at a fluid rate and using gate service, to derive the performance. We derive the stationary as well as the transient performance. Further using Monte-Carlo simulations, we demonstrate that the performance of the system with Poisson arrivals can be well approximated by that of the fluid model. We make the following interesting observations regarding the optimal operating frequency of the buses. If the randomness in the traffic (variance in travel times) increases, it is optimal to reduce the bus frequency. More interestingly even with the increase in load (passenger arrival rates), it is optimal to reduce the bus frequency. This is true in the low load regimes, while for high loads it is optimal to increase the frequency with increase in load.
引用
收藏
页码:607 / 612
页数:6
相关论文
共 50 条
  • [1] Reducing bunching with bus-to-bus cooperation
    Daganzo, Carlos F.
    Pilachowski, Josh
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2011, 45 (01) : 267 - 277
  • [2] Estimating bus passenger waiting times from incomplete bus arrivals data
    McLeod, F.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2007, 58 (11) : 1518 - 1525
  • [3] Bus Arrivals and Bunching
    Molnar, R. Adam
    [J]. JOURNAL OF STATISTICS EDUCATION, 2008, 16 (02):
  • [4] A NOTE ON OPTIMAL WAITING STRATEGIES AT BUS STOPS
    SANIEE, I
    [J]. SIAM REVIEW, 1987, 29 (04) : 625 - 629
  • [5] Mitigating Bunching with Bus-following Models and Bus-to-bus Cooperation
    Ampountolas, Konstantinos
    Kring, Malcolm
    [J]. 2015 IEEE 18TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS, 2015, : 60 - 65
  • [6] WAITING FOR THE BUS
    FENNIGKOH, L
    [J]. IEEE SPECTRUM, 1987, 24 (02) : 6 - 6
  • [7] Mitigating Bunching With Bus-Following Models and Bus-to-Bus Cooperation
    Ampountolas, Konstantinos
    Kring, Malcolm
    [J]. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2021, 22 (05) : 2637 - 2646
  • [8] Waiting for the bus
    Nester, DK
    [J]. AMERICAN MATHEMATICAL MONTHLY, 2002, 109 (07): : 669 - 669
  • [9] A dynamic optimization model for bus schedule design to mitigate the passenger waiting time by dispatching the bus platoon
    Zhang, Yi
    Su, Rong
    Zhang, Yicheng
    [J]. 2020 AMERICAN CONTROL CONFERENCE (ACC), 2020, : 4096 - 4101
  • [10] Synchronising Bus Bunching to the Spikes in Service Demand Reduces Commuters' Waiting Time
    Vismara, Luca
    Saw, Vee-Liem
    Chew, Lock Yue
    [J]. COMPLEXITY, 2022, 2022