A review of principles and methods to decompose large-scale railway scheduling problems
OPEN ACCESS
Loading...
Author / Producer
Date
2023
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
OPEN ACCESS
Data
Abstract
Providing punctual, reliable and performant services to customers is one main goal of railway network operators. The railway scheduling problem is to determine, ahead of time (timetabling), a plan describing the timing of the operations in a railway network, or updating such plan during operations (rescheduling). By optimization and automation, it is possible to operate more trains on the network, closer to the infrastructure capacity. Especially when the scale and complexity of the scheduling problem is increasing, for large-scale networks and multiple interconnected problems, this is of great value for network operators. When planning or adjusting railway operations becomes increasingly complex, modern scheduling algorithms can bring significant performance and economic benefits. In this survey we review approaches in the state of the art for the problems of railway scheduling. We show how the many different approaches of decomposition proposed in the literature of railway scheduling can be categorized into two general principles. We study different solution methods and identify a list of open topics for dealing with large-scale problems for future research.
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
12
Pages / Article No.
100107
Publisher
Elsevier
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Scheduling; Timetabling; Benders; Dantzig–Wolfe; Multi-agent; Hierarchical methods
Organisational unit
09611 - Corman, Francesco / Corman, Francesco
02655 - Netzwerk Stadt u. Landschaft ARCH u BAUG / Network City and Landscape ARCH and BAUG
Notes
This project was supported by the ETH Zürich Foundation.