A Tutorial on Train Timetabling and Train Platforming Problems
Valentina Cacchiani, Laura Galli, Paolo Toth
Abstract
Open-access reader
Valentina Cacchiani, Laura Galli, Paolo Toth
Abstract
Open-access reader
In this tutorial, we give an overview of two fundamental problems arising in the optimization of a railway system: the Train Timetabling \nProblem (TTP) and the Train Platforming Problem (TPP). These problems correspond to two main phases that are usually optimized in close \nsequence. First, in the TTP phase, a schedule of the trains in a railway network is determined. A schedule consists of the arrival and departure times of each train at each (visited) station. Second, in the TPP phase, one needs to determine a topping platform and a routing for each train inside each (visited) station, according to the schedule found in the TTP phase. \nDue to the complexity of the two problems, an integrated approach is generally hopeless for real-world instances. Hence, the two \nphases are considered separately and optimized in sequence. Although there exist several versions for both problems, depending on the infrastructure manager and train operators requirements, we do not aim at presenting all of them, but rather at introducing the reader to the topic using small examples. We present models and solution approaches for the two problems in a didactic way and always refer the reader to the corresponding articles for technical details.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this tutorial, we give an overview of two fundamental problems arising in the optimization of a railway system: the Train Timetabling \nProblem (TTP) and the Train Platforming Problem (TPP). These problems correspond to two main phases that are usually optimized in close \nsequence. First, in the TTP phase, a schedule of the trains in a railway network is determined. A schedule consists of the arrival and departure times of each train at each (visited) station. Second, in the TPP phase, one needs to determine a topping platform and a routing for each train inside each (visited) station, according to the schedule found in the TTP phase. \nDue to the complexity of the two problems, an integrated approach is generally hopeless for real-world instances. Hence, the two \nphases are considered separately and optimized in sequence. Although there exist several versions for both problems, depending on the infrastructure manager and train operators requirements, we do not aim at presenting all of them, but rather at introducing the reader to the topic using small examples. We present models and solution approaches for the two problems in a didactic way and always refer the reader to the corresponding articles for technical details.
Key concepts: Train, Schedule, Sequence (biology), Computer science, Operations research, Phase (matter), Routing (electronic design automation), Mathematical optimization