Analysis of adding-runs strategy for peak-hour regular bus services

Qinhe An; Xiao Fu; Di Huang; Qixiu Cheng; Zhiyuan Liu

doi:10.1016/j.tre.2020.102100

Analysis of adding-runs strategy for peak-hour regular bus services

Qinhe An
, Xiao Fu
, Di Huang
, Qixiu Cheng
, Zhiyuan Liu^*

^*Corresponding author for this work

Research output: Contribution to journal › Article (Academic Journal) › peer-review

22 Citations (Scopus)

Abstract

This paper proposes an adding-runs strategy to alleviate in-vehicle crowding for peak-hour bus services. Passengers’ departure time choices under user equilibrium and system optimum conditions are investigated with and without adding-runs strategy. A bi-level programming model is developed to determine the optimal adding-runs strategy. An artificial bee colony algorithm is adopted to solve the proposed bi-level problem. Numerical examples show that the adding-runs strategy is effective in alleviating crowding effects and reducing schedule delay in peak-hour bus services. The total system cost can be reduced by more than 8% with the optimal adding-runs strategy.

Original language	English
Article number	102100
Journal	Transportation Research Part E: Logistics and Transportation Review
Volume	143
DOIs	https://doi.org/10.1016/j.tre.2020.102100
Publication status	Published - Nov 2020

Bibliographical note

Funding Information:
This study is supported by the Distinguished Young Scholar Project (No. 71922007 ) and General Project (No. 71771050, 71601045) of the National Natural Science Foundation of China and the MOE (Ministry of Education in China) Project of Humanities and Social Sciences (No. 20YJAZH083 ).

Publisher Copyright:
© 2020 Elsevier Ltd

Keywords

Adding bus runs
Bi-level programming problem
Peak-hour crowding
System optimum
User equilibrium

Access to Document

10.1016/j.tre.2020.102100

Handle.net

Persistent link

Cite this

@article{2d7b05a1a734427b844e30576d2a5439,

title = "Analysis of adding-runs strategy for peak-hour regular bus services",

abstract = "This paper proposes an adding-runs strategy to alleviate in-vehicle crowding for peak-hour bus services. Passengers{\textquoteright} departure time choices under user equilibrium and system optimum conditions are investigated with and without adding-runs strategy. A bi-level programming model is developed to determine the optimal adding-runs strategy. An artificial bee colony algorithm is adopted to solve the proposed bi-level problem. Numerical examples show that the adding-runs strategy is effective in alleviating crowding effects and reducing schedule delay in peak-hour bus services. The total system cost can be reduced by more than 8\% with the optimal adding-runs strategy.",

keywords = "Adding bus runs, Bi-level programming problem, Peak-hour crowding, System optimum, User equilibrium",

author = "Qinhe An and Xiao Fu and Di Huang and Qixiu Cheng and Zhiyuan Liu",

note = "Funding Information: This study is supported by the Distinguished Young Scholar Project (No. 71922007 ) and General Project (No. 71771050, 71601045) of the National Natural Science Foundation of China and the MOE (Ministry of Education in China) Project of Humanities and Social Sciences (No. 20YJAZH083 ). Publisher Copyright: {\textcopyright} 2020 Elsevier Ltd",

year = "2020",

month = nov,

doi = "10.1016/j.tre.2020.102100",

language = "English",

volume = "143",

journal = "Transportation Research Part E: Logistics and Transportation Review",

issn = "1366-5545",

publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Analysis of adding-runs strategy for peak-hour regular bus services

AU - An, Qinhe

AU - Fu, Xiao

AU - Huang, Di

AU - Cheng, Qixiu

AU - Liu, Zhiyuan

N1 - Funding Information: This study is supported by the Distinguished Young Scholar Project (No. 71922007 ) and General Project (No. 71771050, 71601045) of the National Natural Science Foundation of China and the MOE (Ministry of Education in China) Project of Humanities and Social Sciences (No. 20YJAZH083 ). Publisher Copyright: © 2020 Elsevier Ltd

PY - 2020/11

Y1 - 2020/11

N2 - This paper proposes an adding-runs strategy to alleviate in-vehicle crowding for peak-hour bus services. Passengers’ departure time choices under user equilibrium and system optimum conditions are investigated with and without adding-runs strategy. A bi-level programming model is developed to determine the optimal adding-runs strategy. An artificial bee colony algorithm is adopted to solve the proposed bi-level problem. Numerical examples show that the adding-runs strategy is effective in alleviating crowding effects and reducing schedule delay in peak-hour bus services. The total system cost can be reduced by more than 8% with the optimal adding-runs strategy.

AB - This paper proposes an adding-runs strategy to alleviate in-vehicle crowding for peak-hour bus services. Passengers’ departure time choices under user equilibrium and system optimum conditions are investigated with and without adding-runs strategy. A bi-level programming model is developed to determine the optimal adding-runs strategy. An artificial bee colony algorithm is adopted to solve the proposed bi-level problem. Numerical examples show that the adding-runs strategy is effective in alleviating crowding effects and reducing schedule delay in peak-hour bus services. The total system cost can be reduced by more than 8% with the optimal adding-runs strategy.

KW - Adding bus runs

KW - Bi-level programming problem

KW - Peak-hour crowding

KW - System optimum

KW - User equilibrium

UR - https://www.scopus.com/pages/publications/85093643521

U2 - 10.1016/j.tre.2020.102100

DO - 10.1016/j.tre.2020.102100

M3 - Article (Academic Journal)

AN - SCOPUS:85093643521

SN - 1366-5545

VL - 143

JO - Transportation Research Part E: Logistics and Transportation Review

JF - Transportation Research Part E: Logistics and Transportation Review

M1 - 102100

ER -

Analysis of adding-runs strategy for peak-hour regular bus services

Abstract

Bibliographical note

Keywords

Access to Document

Handle.net

Other files and links

Fingerprint

Cite this