We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing.
- Authors
Domino, Krzysztof; Kundu, Akash; Salehi, Özlem; Krawiec, Krzysztof
- Abstract
As consequences of disruptions in railway traffic affect passenger experience and 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 quadratic unconstrained binary optimization (QUBO) or higher-order binary optimization (HOBO) 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.
- Subjects
QUANTUM computing; QUANTUM annealing; RAILROADS; ROLLING stock; TRAFFIC regulations; SATISFACTION; TRAIN schedules
- Publication
Quantum Information Processing, 2022, Vol 21, Issue 9, p1
- ISSN
1570-0755
- Publication type
Article
- DOI
10.1007/s11128-022-03670-y