First train timetabling and bus service bridging in intermodal bus-and-train transit networks

•A bus bridging approach to cooperate with the first train operations in a subway network.•An explicitly integrated MILP model for the first train and bus bridging timetabling problems.•A tailored algorithm for optimally solving the first train timetabling and bus service bridging problems.•The mode...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Transportation research. Part B: methodological Ročník 149; s. 443 - 462
Hlavní autoři: Kang, Liujiang, Li, Hao, Sun, Huijun, Wu, Jianjun, Cao, Zhiguang, Buhigiro, Nsabimana
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford Elsevier Ltd 01.07.2021
Elsevier Science Ltd
Témata:
ISSN:0191-2615, 1879-2367
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•A bus bridging approach to cooperate with the first train operations in a subway network.•An explicitly integrated MILP model for the first train and bus bridging timetabling problems.•A tailored algorithm for optimally solving the first train timetabling and bus service bridging problems.•The model and the approach are applied to the Beijing subway network. Subway system is the main mode of transportation for city dwellers and is a quite significant backbone to a city's operations. One of the challenges of subway network operation is the scheduling of the first trains each morning and its impact on transfers. To deal with this challenge, some cities (e.g. Beijing) use bus ‘bridging’ services, temporarily substituting segments of the subway network. The present paper optimally identifies when to start each train and bus bridging service in an intermodal transit network. Starting from a mixed integer nonlinear programming model for the first train timetabling problem, we linearize and reformulate the model using the auxiliary binary variables. Following that, the bus bridging model is developed to cooperate with the first train operation for reducing long transfer waiting times. After realizing the low computational efficiency of solving the integrated model, a tailored algorithm is designed to optimally solve the first train timetabling and bus service bridging problems. The exact models and algorithms are applied to the Beijing subway network to test their effectiveness and computational efficiency. Numerical results show that our approaches decrease the total passenger waiting time by 53.4% by a combined effect of adjusting the first train departure times and operating 27 bridging buses on 7 routes.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0191-2615
1879-2367
DOI:10.1016/j.trb.2021.05.011