A greedy approach for a rolling stock management problem using multi-interval constraint propagation - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Annals of Operations Research Année : 2017

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.

Dates et versions

hal-01576123 , version 1 (22-08-2017)

Identifiants

Citer

Hugo Joudrier, Florence Thiard. A greedy approach for a rolling stock management problem using multi-interval constraint propagation. Annals of Operations Research, 2017, pp.1 - 19. ⟨10.1007/s10479-017-2543-y⟩. ⟨hal-01576123⟩
70 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More