Real-time train routing and scheduling through mixed integer linear programming: Heuristic approach - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Real-time train routing and scheduling through mixed integer linear programming: Heuristic approach

Résumé

In railway traffic management, when an unexpected event perturbs the system, finding an effective train routing and scheduling in real-time is a key issues. Making the right routing and scheduling decisions may have a great impact on the efficiency of the system in terms of delay propagation. However, the time available for making these decisions is quite short: in few minutes a viable set of routes and schedules must be delivered to the dispatching system. In this paper, we assess the performance of a mixed integer linear programming (MILP) formulation exploited as a heuristic approach: we seek for the best feasible solution given a limited and predefined computation time. We run an experimental analysis on instances representing traffic in the Lille Flandres station, France. The results show that the approach tested is very promising, often finding the optimal solution to the instances tackled. Moreover, we show how the performance can be improved by tuning the parameters of the MILP solver.
Fichier principal
Vignette du fichier
doc00015830.pdf (138.86 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00909493 , version 1 (26-11-2013)

Identifiants

  • HAL Id : hal-00909493 , version 1

Citer

Paola Pellegrini, Guillaume Douchet, Grégory Marliere, Joaquin Rodriguez. Real-time train routing and scheduling through mixed integer linear programming: Heuristic approach. IESM 2013, 5th international conference on industrial engineering and system management, Oct 2013, Morocco. 6p. ⟨hal-00909493⟩
116 Consultations
876 Téléchargements

Partager

Gmail Facebook X LinkedIn More