In a railway network, traffic is often perturbed and trains must be rerouted and rescheduled. Doing so in large networks is a challenging task, which has been tackled through various decomposition approaches in the literature. In this paper, we propose an algorithm for managing traffic considering dynamic problem decompositions. It is an asynchronous algorithm based on the decomposition of the problem considering at each time step the smallest possible portion of the network and subset of trains. We prove that this algorithm guarantees to find an overall feasible solution if it exists, for single track networks with passing loops.
Dynamic Decomposition of the Real-Time Railway Traffic Management Problem
Pesenti Raffaele
2022-01-01
Abstract
In a railway network, traffic is often perturbed and trains must be rerouted and rescheduled. Doing so in large networks is a challenging task, which has been tackled through various decomposition approaches in the literature. In this paper, we propose an algorithm for managing traffic considering dynamic problem decompositions. It is an asynchronous algorithm based on the decomposition of the problem considering at each time step the smallest possible portion of the network and subset of trains. We prove that this algorithm guarantees to find an overall feasible solution if it exists, for single track networks with passing loops.File | Dimensione | Formato | |
---|---|---|---|
1-s2.0-S2352146522002277-main.pdf
non disponibili
Descrizione: Articolo principale
Tipologia:
Documento in Post-print
Licenza:
Accesso chiuso-personale
Dimensione
679.45 kB
Formato
Adobe PDF
|
679.45 kB | Adobe PDF | Visualizza/Apri |
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.