Solving rescheduling problems in heterogeneous urban railway networks using hybrid quantum-classical approach
arXiv:2309.06763 · doi:10.1016/j.jrtpm.2025.100521
Abstract
We address the applicability of a hybrid quantum-classical heuristics for practical railway rescheduling management problems. We build an integer linear programming model and solve it with D-Wave's quantum-classical hybrid solver (CQM) as well as with CPLEX, for comparison. The proposed approach is demonstrated on a real-life heterogeneous urban network in Poland, including both single- and multi-track segments. All the requirements posed by the operator of the network are included in the model. The computational results demonstrate the readiness for application and the benefits of quantum-classical hybrid solvers in a realistic railway scenario: they yield acceptable solutions on time, which is a critical requirement in a rescheduling situation. In particular, CQM as a probabilistic heuristic solver provides a number of feasible, close-to-optimal solutions the dispatcher can choose from.
References in corpus (12)
- The Physical Implementation of Quantum Computation
- Quantum Annealing and Analog Quantum Computation
- Adiabatic Theorem without a Gap Condition
- Quantum Annealing Implementation of Job-Shop Scheduling
- Quantum Computation Based on Quantum Adiabatic Bifurcations of Kerr-Nonlinear Parametric Oscillators
- Temperature scaling law for quantum annealing optimizers
- Pegasus: The second connectivity graph for large-scale quantum annealing hardware
- Practical Integer-to-Binary Mapping for Quantum Annealers
- Quadratic and Higher-Order Unconstrained Binary Optimization of Railway Rescheduling for Quantum Computing
- BiqBin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints
- The three phases of quantum annealing: fast, slow, and very slow
- Hybrid quantum-classical computation for automatic guided vehicles scheduling