Papers › Solving rescheduling problems in heterogeneous urban railway networks using hybrid...
Solving rescheduling problems in heterogeneous urban railway networks using hybrid quantum-classical approach
Mátyás Koniorczyk, Krzysztof Krawiec, Ludmila Botelho, Nikola Bešinović, Krzysztof Domino
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections