A novel two-stage approach for energy-efficient timetabling for an urban rail transit network
•A general model framework of energy-efficient timetabling and passenger path choice in a URT network is proposed.•A novel model reformulation as a tree knapsack problem is developed to determine train running times by a pseudo-polynomial dynamic programming algorithm.•A heuristic sequencing method...
Uloženo v:
| Vydáno v: | Transportation research. Part E, Logistics and transportation review Ročník 176; s. 103212 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Ltd
01.08.2023
|
| Témata: | |
| ISSN: | 1366-5545, 1878-5794 |
| 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!
|
| Shrnutí: | •A general model framework of energy-efficient timetabling and passenger path choice in a URT network is proposed.•A novel model reformulation as a tree knapsack problem is developed to determine train running times by a pseudo-polynomial dynamic programming algorithm.•A heuristic sequencing method is developed to determine nonuniform headways and dwell times.•The relationship between optimal energy consumption reduction and travel time increment is explored.
Urban rail transit (URT) is the backbone transport mode in metropolitan areas to accommodate large travel demands. The high energy consumption of URT becomes a hotspot problem due to the ever-increasing operation mileages and pressing agendas of carbon neutralization. The high model complexity and inconsistency in the objectives of minimizing passenger travel time and operational energy consumption are the main challenges for energy-efficient timetabling for a URT network with multiple interlinked lines. This study proposes a general model framework of timetabling and passenger path choice in a URT network to minimize energy consumption under passenger travel time constraints. To obtain satisfactory energy-efficient nonuniform timetables, we suggest a novel model reformulation as a tree knapsack problem to determine train running times by a pseudo-polynomial dynamic programming algorithm in the first stage. Furthermore, a heuristic sequencing method is developed to determine nonuniform headways and dwell times in the second stage. The suggested model framework and solution algorithm are tested using a real-world URT network, and the results show that energy consumption can be considerably reduced given certain travel time increments. |
|---|---|
| ISSN: | 1366-5545 1878-5794 |
| DOI: | 10.1016/j.tre.2023.103212 |