We propose a Lagrangian-based heuristic approach to obtain robust solutions to the Train Timetabling Problem (TTP) on a corridor (i.e. a single one-way line connecting two major stations). Roughly speaking, we define a solution to be robust if it allows to avoid delay propagation as much as possible. In particular, in the planning phase that we are considering the aim is to build timetables characterized by buffer times that can be used to absorb possible delays occurring at an operational level. In the TTP, we are given a set of stations S along the corridor, a set of trains T, and for each train an ideal timetable (i.e. the timetable suggested by the Train Operator). In the nominal TTP the aim is to change the ideal timetables for the trains as little as possible, while satisfying the track capacity constraints consisting of: - departure constraints (imposing a minimum headway between two consecutive departures from a station); - arrival constraints (imposing a minimum headway between two consecutive arrivals at a station); - overtaking constraints (avoiding overtaking between consecutive stations, since we are considering a single one-way line).

Robustness in train timetabling

Fischetti M.
2009

Abstract

We propose a Lagrangian-based heuristic approach to obtain robust solutions to the Train Timetabling Problem (TTP) on a corridor (i.e. a single one-way line connecting two major stations). Roughly speaking, we define a solution to be robust if it allows to avoid delay propagation as much as possible. In particular, in the planning phase that we are considering the aim is to build timetables characterized by buffer times that can be used to absorb possible delays occurring at an operational level. In the TTP, we are given a set of stations S along the corridor, a set of trains T, and for each train an ideal timetable (i.e. the timetable suggested by the Train Operator). In the nominal TTP the aim is to change the ideal timetables for the trains as little as possible, while satisfying the track capacity constraints consisting of: - departure constraints (imposing a minimum headway between two consecutive departures from a station); - arrival constraints (imposing a minimum headway between two consecutive arrivals at a station); - overtaking constraints (avoiding overtaking between consecutive stations, since we are considering a single one-way line).
2009
8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009 - Proceedings of the Conference
8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/3389517
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? ND
  • OpenAlex ND
social impact