Urban Rail Timetable Optimization to Improve Operational Efficiency with Flexible Routing Plans: A Nonlinear Integer Programming Model

At present, most urban rail transit systems adopt an operation mode with a single long routing. The departure frequency is determined by the maximum section passenger flow. However, when the passenger flow varies greatly within different sections, this mode will lead to a low load factor in some sec...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Sustainability Ročník 11; číslo 13; s. 3701
Hlavní autoři: Xue, Qiuchi, Yang, Xin, Wu, Jianjun, Sun, Huijun, Yin, Haodong, Qu, Yunchao
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.07.2019
Témata:
ISSN:2071-1050, 2071-1050
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í:At present, most urban rail transit systems adopt an operation mode with a single long routing. The departure frequency is determined by the maximum section passenger flow. However, when the passenger flow varies greatly within different sections, this mode will lead to a low load factor in some sections, resulting in a waste of capacity. In view of this situation, this paper develops a nonlinear integer programming model to determine an optimal timetable with a balanced scheduling mode, where the wasted capacity at a constant departure frequency can be reduced with a slight increase in passenger waiting time. Then, we simplify the original model into a single-objective integer optimization model through normalization. A genetic algorithm is designed to find the optimal solution. Finally, a numerical example is presented based on real-world passenger and operation data from Beijing Metro Line 4. The results show that the double-routing optimization model can reduce wasted capacity by 9.5%, with a 4.5% increase in passenger waiting time, which illustrates the effectiveness of this optimization model.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2071-1050
2071-1050
DOI:10.3390/su11133701