mlsanityData to 14 Oct 2026

Coordinated optimization of departure sequencing and section-track allocation in railway short-term concentrated departure scenarios based on qubo and hybrid quantum algorithms

arXiv 2606.06543 ↗First posted 4 Jun 2026quant-ph cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

This study examines the coordinated optimization of departure sequencing and section-track allocation in railway short-term concentrated departure scenarios. A quadratic unconstrained binary optimization (QUBO) model is formulated to represent departure-position assignment and section-track selection within a unified binary framework. Because the quality of a dispatching scheme depends on time-dependent operational interactions that cannot be fully captured by a static combinatorial model, a simulation-based evaluation layer is introduced to assess section occupation, intermediate-station waiting, platform-capacity pressure, running-time fluctuations, and delay propagation. Within this layered framework, conventional heuristics, quantum-inspired algorithms, and hybrid algorithms are compared on the same decision structure. The results show that the QUBO model can generate feasible candidate schemes after decoding, while the simulation layer clearly differentiates the operational performance of the competing algorithms under both normal and disturbed conditions. In the tested scenarios, QPSO-QAOA performs best under normal conditions, and the quantum-enhanced methods reduce comprehensive cost by 4.28%--26.26% and total delay by 4.37%--24.25% on average under dynamic conditions relative to their conventional counterparts. These findings suggest that the integration of QUBO-based modeling and simulation-based evaluation provides a useful methodological framework for railway short-term concentrated departure scheduling, although validation with real operational data remains necessary.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 30 references that are in the map. First posted on arXiv 4 Jun 2026.

Builds on

4 of 30 references.

References · 4

  1. 2013Ising formulations of many NP problemscited by 207
  2. 2024Solving a Real-World Package Delivery Routing Problem Using Quantum Annealerscited by 6
  3. 2022Modeling routing problems in QUBO with application to ride-hailingcited by 3
  4. 2021Quadratic and Higher-Order Unconstrained Binary Optimization of Railway Rescheduling for Quantum Computingcited by 2

Built on by

Not cited yet.