2000 character limit reached
Optimising Rolling Stock Planning including Maintenance with Constraint Programming and Quantum Annealing (2109.07212v3)
Published 15 Sep 2021 in cs.AI and q-fin.ST
Abstract: We propose and compare Constraint Programming (CP) and Quantum Annealing (QA) approaches for rolling stock assignment optimisation considering necessary maintenance tasks. In the CP approach, we model the problem with an Alldifferent constraint, extensions of the Element constraint, and logical implications, among others. For the QA approach, we develop a quadratic unconstrained binary optimisation (QUBO) model. For evaluation, 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 evaluate the CP approach as well as tabu search for the QUBO model. At the current development stage of the physical quantum annealers, we find that both approaches tend to produce comparable results.
- “Quantum Supremacy using a Programmable Superconducting Processor” In Nature 574, 2019, pp. 505–510 URL: https://www.nature.com/articles/s41586-019-1666-5
- “Handbook of Constraint Programming”, Foundations of Artificial Intelligence Elsevier, 2006
- Yung-Cheng Lai, Dow-Chung Fan and Kwei-Long Huang “Optimizing Rolling Stock Assignment and Maintenance Plan for Passenger Railway Operations” In Computers & Industrial Engineering 85, 2015, pp. 284–295 DOI: 10.1016/j.cie.2015.03.016
- Giovanni Luca Giacco, Andrea D’Ariano and Dario Pacciarelli “Rolling Stock Rostering Optimization Under Maintenance Constraints” In Journal of Intelligent Transportation Systems 18.1 Taylor & Francis, 2014, pp. 95–105 DOI: 10.1080/15472450.2013.801712
- “Simultaneously Recovering Rolling Stock Schedules and Depot Plans Under Disruption” In Proceedings of the 13th Conference on Advanced Systems in Public Transport (CASPT) 2015, 2015, pp. 22
- “A Branch-and-Price Algorithm for Railway Rolling Stock Rescheduling” In Transportation Research Part B: Methodological 99, 2017, pp. 228–250 DOI: 10.1016/j.trb.2017.03.003
- “Integrated Optimization of Rolling Stock Rotations for Intercity Railways” In Transportation Science 50.3, 2016, pp. 863–877 DOI: 10.1287/trsc.2015.0633
- Valentina Cacchiani “Models and Algorithms for Combinatorial Optimization Problems Arising in Railway Applications” In 4OR 7.1, 2009, pp. 109–112 DOI: 10.1007/s10288-008-0075-7
- “A Mixed Integer Linear Program for Optimizing the Utilization of Locomotives with Maintenance Constraints” In Operations Research Proceedings 2018 Cham: Springer International Publishing, 2019, pp. 103–109 DOI: 10.1007/978-3-030-18500-8˙14
- “A Mixed Integer Linear Programming Approach to a Rolling Stock Rostering Problem with Splitting and Combining” In 8th International Conference on Railway Operations Modelling and Analysis (ICROMA) 69:36 Norrköping, Sweden: Linköping Electronic Conference Proceedings, June 17th – 20th, 2019, pp. 548–564
- Markus Reuther “Mathematical Optimization of Rolling Stock Rotations”, 2017
- “A Mixed Integer Linear Programming Model for Rolling Stock Deadhead Routing before the Operation Period in an Urban Rail Transit Line” In Journal of Advanced Transportation 2020, 2020, pp. 1–18 DOI: 10.1155/2020/3809734
- “Development of Reactive Scheduling for Rolling Stock Operation Using a Constraint Model” In Electrical Engineering in Japan 203.4, 2018, pp. 31–44 DOI: 10.1002/eej.23062
- Daniel Harabor and Peter J. Stuckey “Rail Capacity Modelling with Constraint Programming” In Integration of AI and OR Techniques in Constraint Programming 9676 Cham: Springer International Publishing, 2016, pp. 170–186 DOI: 10.1007/978-3-319-33954-2˙13
- Peter Brucker, Johann L Hurink and Thomas Rolfes “Routing of railway carriages: A case study”, 1999
- “Quadratic and Higher-Order Unconstrained Binary Optimization of Railway Rescheduling for Quantum Computing” In Quantum Information Processing 21.9, 2022, pp. 337 DOI: 10.1007/s11128-022-03670-y
- Tobias Stollenwerk, Elisabeth Lobe and Martin Jung “Flight Gate Assignment with a Quantum Annealer” In Quantum Technology and Optimization Problems Cham: Springer International Publishing, 2019, pp. 99–110
- “Applying the Quantum Approximate Optimization Algorithm to the Tail-Assignment Problem” In Physical Review Applied 14.3 American Physical Society, 2020, pp. 034009 DOI: 10.1103/PhysRevApplied.14.034009
- “Quantum Shuttle: Traffic Navigation with Quantum Computing” In Proceedings of the 1st ACM SIGSOFT International Workshop on Architectures and Paradigms for Engineering Quantum Software, APEQS 2020 New York, NY, USA: Association for Computing Machinery, 2020, pp. 22–30 DOI: 10.1145/3412451.3428500
- Fred Glover, Gary Kochenberger and Yu Du “A tutorial on formulating and using qubo models” In arXiv preprint arXiv:1811.11538, 2018
- “The unconstrained binary quadratic programming problem: a survey” In Journal of Combinatorial Optimization 28.1 Springer, 2014, pp. 58–81
- Edward Farhi, Jeffrey Goldstone and Sam Gutmann “A quantum approximate optimization algorithm” In arXiv preprint arXiv:1411.4028, 2014
- “Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor” In Phys. Rev. B 82 American Physical Society, 2010, pp. 024511 DOI: 10.1103/PhysRevB.82.024511
- Armin Wolf “firstCS—New Aspects on Combining Constraint Programming with Object-Orientation in Java” In KI - Künstliche Intelligenz 26.1, 2012, pp. 55–60 DOI: 10.1007/s13218-011-0161-4
- Christian Schulte and Peter J. Stuckey “Efficient Constraint Propagation Engines” In ACM Transactions on Programming Languages and Systems 31.1, 2008, pp. 1–43 DOI: 10.1145/1452044.1452046