A Benders' decomposition for the real-time Railway Traffic Management Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

A Benders' decomposition for the real-time Railway Traffic Management Problem

Résumé

In this paper, we propose a Benders' decomposition algorithm to tackle the real-time railway traffic management problem. Specifically, we decompose the mixed-integer linear programming formulation at the basis of RECIFE-MILP (Pellegrini et al., 2015), a state-of-the-art algorithm for this problem. In our Benders' decomposition, we minimize total delays by making train routing and scheduling decisions in the master problem. Given these decisions, we compute the trains arrival and passing times in the slave problem to deduce the total delay. By applying our Benders' decomposition algorithm to RECIFE-MILP, we tackle large instances representing traffic in the Rouen-Rive-Droite control area, in France.
Fichier principal
Vignette du fichier
doc00026607.pdf (755.86 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01550451 , version 1 (29-06-2017)

Identifiants

  • HAL Id : hal-01550451 , version 1

Citer

Kaba Keita, Paola Pellegrini, Joaquin Rodriguez. A Benders' decomposition for the real-time Railway Traffic Management Problem. 7th International Conference on Railway Operations Modelling and Analysis (RailLille 2017), Apr 2017, Lille, France. 19p. ⟨hal-01550451⟩
209 Consultations
92 Téléchargements

Partager

Gmail Facebook X LinkedIn More