Optimising Rolling Stock Planning including Maintenance with Constraint Programming and Quantum Annealing

We developed and compared Constraint Programming (CP) and Quantum Annealing (QA) approaches for rolling stock optimisation considering necessary maintenance tasks. To deal with such problems in CP we investigated specialised pruning rules and implemented them in a global constraint. For the QA approach, we developed quadratic unconstrained binary optimisation (QUBO) models. For testing, we use data sets based on real data from Deutsche Bahn and run the QA approach on real quantum computers from D-Wave. Classical computers are used to run the CP approach as well as tabu search for the QUBO models. We find that both approaches tend at the current development stage of the physical quantum annealers to produce comparable results, with the caveat that QUBO does not always guarantee that the maintenance constraints hold, which we fix by adjusting the QUBO model in preprocessing, based on how close the trains are to a maintenance threshold distance.

[1]  Susumu Morito,et al.  A Mixed Integer Linear Programming Approach to a Rolling Stock Rostering Problem with Splitting and Combining , 2019 .

[2]  Armin Wolf.  firstCS—New Aspects on Combining Constraint Programming with Object-Orientation in Java , 2011, KI - Künstliche Intelligenz.

[3]  M. W. Johnson,et al.  Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor , 2010, 1004.1628.

[4]  Fred W. Glover,et al.  Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models , 2018, 4OR.

[5]  Chao Wen,et al.  A Mixed Integer Linear Programming Model for Rolling Stock Deadhead Routing before the Operation Period in an Urban Rail Transit Line , 2020, Journal of Advanced Transportation.

[6]  Claude-Guy Quimper,et al.  Integration of AI and OR Techniques in Constraint Programming , 2016, Lecture Notes in Computer Science.

[7]  Peter J. Stuckey,et al.  Rail Capacity Modelling with Constraint Programming , 2016, CPAIOR.

[8]  Philipp Hungerländer,et al.  A Mixed Integer Linear Program for Optimizing the Utilization of Locomotives with Maintenance Constraints , 2018, OR.

[9]  Tomohiro Murata,et al.  Development of reactive scheduling for rolling stock operation using a constraint model , 2017 .

[10]  Eliane Moreno Gomez Tagle,et al.  Quantum Shuttle: traffic navigation with Quantum computing , 2020, APEQES@ESEC/SIGSOFT FSE.

[11]  Fred W. Glover,et al.  The unconstrained binary quadratic programming problem: a survey , 2014, Journal of Combinatorial Optimization.

[12]  E. Farhi,et al.  A Quantum Approximate Optimization Algorithm , 2014, 1411.4028.

[13]  Dario Pacciarelli,et al.  Rolling Stock Rostering Optimization Under Maintenance Constraints , 2014, J. Intell. Transp. Syst..

[14]  Ralf Borndörfer,et al.  Integrated Optimization of Rolling Stock Rotations for Intercity Railways , 2016, Transp. Sci..

[15]  Travis S. Humble,et al.  Quantum supremacy using a programmable superconducting processor , 2019, Nature.

[16]  Peter Brucker,et al.  Routing of railway carriages: A case study , 1999 .

[17]  Krzysztof Krawiec,et al.  Quantum computing approach to railway dispatching and conflict management optimization on single-track railway lines , 2020, ArXiv.

[18]  Valentina Cacchiani,et al.  Models and algorithms for combinatorial optimization problems arising in railway applications , 2009, 4OR.

[19]  David Pisinger,et al.  A Branch-and-Price algorithm for railway rolling stock rescheduling , 2017 .

[20]  Tobias Stollenwerk,et al.  Flight Gate Assignment with a Quantum Annealer , 2018, QTOP@NetSys.

[21]  Markus Reuther,et al.  Mathematical optimization of rolling stock rotations , 2017 .

[22]  Yung-Cheng Lai,et al.  Optimizing rolling stock assignment and maintenance plan for passenger railway operations , 2015, Comput. Ind. Eng..

[23]  David Pisinger,et al.  Simultaneously Recovering Rolling Stock Schedules and Depot Plans Under Disruption , 2015 .