A Greedy Approach for a Rolling Stock Management Problem using Multi-Interval Constraint Propagation - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2016

A Greedy Approach for a Rolling Stock Management Problem using Multi-Interval Constraint Propagation

Résumé

In this article we present our contribution to the Rolling Stock Unit Management problem proposed for the ROADEF/EURO Challenge 2014. We propose a greedy algorithm to assign trains to departures. Our approach relies on a routing procedure using multi-interval constraint propagation to compute the individual schedules of trains within the railway station. This algorithm allows to build an initial solution, satisfying a significant subset of departures.
Fichier principal
Vignette du fichier
Challenge2014.pdf (644.07 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01526738 , version 1 (23-05-2017)

Identifiants

  • HAL Id : hal-01526738 , version 1

Citer

Hugo Joudrier, Florence Thiard. A Greedy Approach for a Rolling Stock Management Problem using Multi-Interval Constraint Propagation: ROADEF/EURO Challenge 2014. 2016. ⟨hal-01526738⟩
99 Consultations
150 Téléchargements

Partager

Gmail Facebook X LinkedIn More