A greedy approach for a rolling stock management problem using multi-interval constraint propagation

Hugo Joudrier () and Florence Thiard ()
Additional contact information
Hugo Joudrier: Univ. Grenoble Alpes, CNRS, Grenoble INP
Florence Thiard: Univ. Grenoble Alpes, CNRS, Grenoble INP

Annals of Operations Research, 2018, vol. 271, issue 2, No 37, 1165-1183

Abstract: Abstract 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.

Keywords: Scheduling; Railway stock management; Greedy algorithm; Multi-interval constraint propagation (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-017-2543-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:271:y:2018:i:2:d:10.1007_s10479-017-2543-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-017-2543-y

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().