Quadratic and Higher-Order Unconstrained Binary Optimization of Railway Rescheduling for Quantum Computing
Preprint
Abstract
As consequences of disruptions in railway traffic affect passenger experience/satisfaction, appropriate rerouting and/or rescheduling is necessary. These problems are known to be NP-hard, given the numerous restrictions of traffic nature. With the recent advances in quantum technologies, quantum annealing has become an alternative method to solve such optimization problems. To use quantum annealing, the problem needs to be encoded in QUBO (quadratic unconstrained binary optimization) or HOBO (higher-order binary optimization) formulation that can be recast as a QUBO. This paper introduces QUBO and HOBO representations for rescheduling problems of railway traffic management; the latter is a new approach up to our knowledge. This new approach takes into account not only the single-track lines but also the double- and multi-track lines, as well as stations composed of tracks and switches. We consider the conditions of minimal headway between trains, minimal stay on stations, track occupation, and rolling stock circulation. Furthermore, a hybrid quantum-classical procedure is presented that includes rerouting. We demonstrate the proof of concept implementation on the D-Wave Quantum Processing Unit and D-Wave hybrid solver.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Approaches to modeling train scheduling problems as job-shop problems with blocking constraintsJournal of Scheduling, 2017
- Vulnerability and resilience of transport systems – A discussion of recent researchTransportation Research Part A: Policy and Practice, 2015
- Challenges and opportunities in developing urban modal shiftTravel Behaviour and Society, 2015
- Susceptibility of optimal train schedules to stochastic disturbances of process timesFlexible Services and Manufacturing Journal, 2013
- Quantum annealing with manufactured spinsNature, 2011
- Scheduling trains as a blocking parallel-machine job shop scheduling problemComputers & Operations Research, 2009
- Capacity factors of a mixed speed railway networkTransportation Research Part E: Logistics and Transportation Review, 2009
- A branch and bound algorithm for scheduling trains in a railway networkEuropean Journal of Operational Research, 2007
- N-tracked railway traffic re-scheduling during disturbancesTransportation Research Part B: Methodological, 2007
- NP-hardness of shop-scheduling problems with three jobsDiscrete Applied Mathematics, 1995