A greedy approach for a rolling stock management problem using multi-interval constraint propagation
- 80 Downloads
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.
KeywordsScheduling Railway stock management Greedy algorithm Multi-interval constraint propagation
- Hudak, P., Hughes, J., Peyton Jones, S. & Wadler, P. (2007). A history of haskell: Being lazy with class. In Proceedings of the Third ACM SIGPLAN Conference on History of Programming Languages (pp. 12-1–12-55). ACM.Google Scholar
- ILOG, S. (1999). Revising hull and box consistency. In Logic Programming: Proceedings of the 1999 International Conference on Logic Programming, (p. 230). MIT Press.Google Scholar
- Moore, R. E. (1966). Interval analysis., Prentice-Hall series in automatic computation Englewood Cliffs: Prentice-Hall.Google Scholar
- Ninin, J. (2015). Global optimization based on contractor programming: An overview of the ibex library. In International Conference on Mathematical Aspects of Computer and Information Sciences (pp. 555–559). Springer.Google Scholar
- Ramond, F., & Marcos, N. (2014). Trains don’t vanish ! ROADEF EURO 2014 challenge problem description. Technical report, SNCF—Innovation & Research Department. https://hal.archives-ouvertes.fr/hal-01057324.