Scheduling theory and constraint programming applied to rail traffic management - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2012

Scheduling theory and constraint programming applied to rail traffic management

Résumé

Scheduling theory (ST) is a formal framework which have been used many times over the last decade as starting point to model railway traffic management. Graph theory (GT), mathematical programming (MP) or constraint programming (CP) have also be used as additional steps to scheduling theory. This is illustrated in figure 1. The last step is a solution algorithm that is many times based a complete or partial enumeration procedure (EP) of feasible solutions where large subsets are discarded. This article will focus on the path ST → CP → EP to solve railway management problems. I will first briefly introduce each field, and after applications to the railway traffic management.
Fichier principal
Vignette du fichier
rodriguez.pdf (228.02 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00959593 , version 1 (20-03-2014)

Identifiants

  • HAL Id : hal-00959593 , version 1

Citer

Joaquin Rodriguez. Scheduling theory and constraint programming applied to rail traffic management. Scheduling theory and constraint programming applied to rail traffic management, in Farewell address, Prof. Ingo Hansen, TECHNICAL UNIVERSITY DELFT, p133-145, 2012. ⟨hal-00959593⟩
69 Consultations
998 Téléchargements

Partager

Gmail Facebook X LinkedIn More