Multi-attribute assignment of trains to departures in rolling stock management
- 194 Downloads
The article describes our findings on the EURO/ROADEF 2014 Challenge problem. Several heuristic solution techniques have been implemented in a prototypical system for rolling stock management. First, the assignment of trains to departures is supported by a multi-attribute priority rule, for which extensive experiments have been conducted. The subsequent scheduling problem is then solved by a heuristic routing and scheduling concept. The feasibility of solutions is ensured by adopting a transaction model known from database programming to the scheduling problem domain. Besides our contributions to the solution of the optimization problem, a decision support system has been build that visualizes the movements of convoys in the network. Moreover, we make the source code of our optimization approach available with this article: doi: 10.17632/nc642wfw2k.1.
KeywordsRolling stock management Multi-attribute decision rules Train routing and scheduling Heuristics
- Buljubašić, M., Vasquez, M., Gavranović, H., & Hanafi, S. (2014). Two phase heuristic for SNCF rolling stock problem. Technical Report S18, Ecole des Mines d’Alès, LGI2P Laboratory, Nîmes, France.Google Scholar
- Carey, M., & Carville, S. (2003). Scheduling and platforming trains at busy complex stations. Transportation Research Part A: Policy and Practice, 37(3), 195–224.Google Scholar
- Catusse, N., & Cambazard, H. (2014). ROADEF challenge 2014: A modeling approach, rolling stock unit management on railway sites. Technical Report HAL Id: hal-01056605, Laboratoire G-SCOP, Grenoble INP, France. https://hal.archives-ouvertes.fr/hal-01056605.
- Fuchsberger, M. (2007). Solving the train scheduling problem in a main station area via a resource constrained space-time integer multi-commodity flow. Master thesis, Institute for Operations Research, ETH Zurich, Switzerland.Google Scholar
- Geraets, F., Kroon, L., Schoebel, A., Wagner, D., & Zaroliagiis, C. (Eds.). (2007). Algorithmic methods for railway optimization, lecture notes in computer science (Vol. 4359). Berlin: Springer.Google Scholar
- Gray, J. (1981). The transaction concept: Virtue and limitations. In Proceedings of the seventh international conference on very large databases (Vol. 7, pp. 144–154). Tandem Computers Incorporated.Google Scholar
- Lentink, R. M., Fioole, P. J., Kroon, L. G., & van’t Woudt, C. (2006). Applying operations research techniques to planning of train shunting. In vanWezel et al. (2006), chap 15.Google Scholar
- Mehdizadeh, E., & Nezhad Dadgar, S. (2014). Using vibration damping optimization algorithm for resource constraint project scheduling problem with weighted earliness-tardiness penalties and interval due dates. Economic Computation and Economic Cybernetics Studies and Research, 48(1), 331–343.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.
- Ramond, F., Marcos, N., & Sourd, F. (2013). ROADEF/EURO 2014 Challenge—trains don’t vanish!. Technical Report, SNCF—Innovation & Research Department.Google Scholar
- van Wezel, W., Jorna, R., & Meystel, A. (Eds.). (2006). Planning in intelligent systems: Aspects, motivations, and methods. Hoboken, NJ: Wiley.Google Scholar