Quantum computing has been a ground-breaking domain for several years. Its new computational paradigm promises to impact the railway transports domain through quantum algorithms that solve hard combinatorial problems where a good or optimal solution is needed. It could open interesting applications for hard real-time problems, integrated problems, etc. Thus, it is crucial to study the type of railway decision or optimization problems quantum computation could tackle and to what extent their solving could be improved. In this paper, we characterize the quantum approaches over classical methods on a problem of optimal timetabling design. This problem consists of finding the transportation plan maximizing the operating profit according to the customers' demand and the availability and cost of the network and the rolling stock. The combinatorial complexity of this problem prevents its efficient solving by current classical computers on large perimeters. Quantum computers could overcome this issue and provide better solutions within less time. We present two families of quantum algorithms for solving combinatorial problems: meta-heuristics (Quantum Approximate Optimization Algorithm, Quantum Annealing) and exact search algorithms (Grover's algorithm). First, we simplify the initial timetabling problem so that the current quantum technology can handle it. Then, we reformulate it for each kind of algorithm. Finally, a small case study and a real-life instance illustrate the implementation of quantum algorithms on available quantum devices.
Quantum computing has been a ground-breaking domain for several years. Its new computational paradigm promises to impact the railway transports domain through quantum algorithms that solve hard combinatorial problems where a good or optimal solution is needed. It could open interesting applications for hard real-time problems, integrated problems, etc. Thus, it is crucial to study the type of railway decision or optimization problems quantum computation could tackle and to what extent their solving could be improved. In this paper, we characterize the quantum approaches over classical methods on a problem of optimal timetabling design. This problem consists of finding the transportation plan maximizing the operating profit according to the customers' demand and the availability and cost of the network and the rolling stock. The combinatorial complexity of this problem prevents its efficient solving by current classical computers on large perimeters. Quantum computers could overcome this issue and provide better solutions within less time. We present two families of quantum algorithms for solving combinatorial problems: meta-heuristics (Quantum Approximate Optimization Algorithm, Quantum Annealing) and exact search algorithms (Grover's algorithm). First, we simplify the initial timetabling problem so that the current quantum technology can handle it. Then, we reformulate it for each kind of algorithm. Finally, a small case study and a real-life instance illustrate the implementation of quantum algorithms on available quantum devices.
The demand for rail transport is expected to increase due to growing mobility needs and shifts in transport policies. This growth will lead to a higher capacity utilization of existing networks, making disturbances more frequent. To minimize their impact, dispatchers engage in real-time traffic management by adjusting the timetable to resolve the arising conflicts. Given the limited time to identify high-quality solutions, developing computer-based optimization methods to support dispatchers can significantly enhance rail transport efficiency. However, this is a challenging task with high computational complexity particularly in large and dense railway networks. Quantum computing offers a possible research direction, as it may offer advantages over classical computing due to its unique properties. This paper introduces the fundamentals of quantum computing and explores its challenges and opportunities for real-time railway traffic management. For this purpose, the paper reviews existing approaches that use quantum computing in railway operations and related fields, and highlights open challenges. Finally, several further research directions are identified, ranging from detailed benchmarking to new algorithm development.
Rolling stock planning is a complex optimization problem in railway management that involves assigning physical trains to scheduled trips while minimizing operational costs. In this work, we address a specific instance of this problem featuring 190 trips over two days, subject to constraints such as mandatory maintenance stops. We reformulate the problem as a Maximum-Weight Independent Set (MWIS) problem on a graph where nodes represent feasible train cycles. To handle the computational complexity of the large search space, we propose a hybrid divide-and-conquer algorithm. This approach iteratively selects subgraphs and solves the MWIS problem using various solvers, including exact classical methods and the Quantum Approximate Optimization Algorithm (QAOA). We evaluate the algorithm's performance by comparing these methods and analyzing the scaling with respect to subgraph size, with QAOA assessed through both classical simulation and execution on a quantum device (IQM Emerald). Our results indicate that increasing the subgraph size generally improves solution quality, demonstrating that the hybrid framework can effectively bridge the gap between polynomial-time approximate solvers and exponential-time exact methods.
Combinatorial optimization problems play a vital role in computer science and engineering, with applications in logistics, network design, finance, and resource allocation. However, many of these problems are NP-hard, making them computationally expensive to solve using classical optimization techniques, especially for large-scale instances. In recent years, quantum computing has emerged as a promising paradigm capable of addressing these limitations by leveraging quantum mechanical principles such as superposition and entanglement. This study investigates the application of quantum computing for solving combinatorial optimization problems, with a focus on algorithm design, complexity analysis, and real-world applicability. The research primarily employs the Quantum Approximate Optimization Algorithm (QAOA) and Grover's search algorithm to solve representative problems such as Max-Cut and the Knapsack problem. The performance of these algorithms is evaluated using key metrics including accuracy, execution time, and approximation ratio, and is compared with classical optimization techniques. The results demonstrate that QAOA is capable of generating near-optimal solutions, achieving accuracy levels of up to 93% for small problem instances. However, the study also highlights the challenges associated with current quantum systems, including noise, limited qubit availability, and increased execution time. Comparative analysis reveals that while classical methods remain more efficient for small-scale problems, quantum algorithms show significant potential for scalability and handling complex optimization tasks. The findings suggest that hybrid quantum-classical approaches offer a practical solution in the current Noisy Intermediate-Scale Quantum (NISQ) era. The study concludes that although quantum computing is still evolving, it holds strong potential for transforming combinatorial optimization in the future.
In this work, we consider a practical railway dispatching problem: delay and conflict management on a single-track railway line. We examine the issue of train dispatching consequences caused by the arrival of an already delayed train to the segment being considered. This problem is computationally hard and often needs to be solved timely. Here, we introduce a quadratic unconstrained binary optimization (QUBO) model of the problem in question, compatible with the emerging quantum annealing technology. The model's instances can be executed on present-day quantum annealers. As a proof-of-concept, we solve selected real-life problems from the Polish railway network using D-Wave quantum annealers. As a reference, we also provide solutions calculated with classical methods, including those relevant to the community (linear integer programming) and a sophisticated algorithm based on tensor networks for solving QUBO problems.
Quantum Approximate Optimization Algorithm (QAOA) is one of the most short-term promising quantum-classical algorithm to solve unconstrained combinatorial optimization problems. It alternates between the execution of a parametrized quantum circuit and a classical optimization. There are numerous levers for enhancing QAOA performances, such as the choice of quantum circuit meta-parameters or the choice of the classical optimizer. In this paper, we stress on the importance of the input problem formulation by illustrating it with the resolution of an industrial railway timetabling problem. Specifically, we present a generic method to reformulate any polynomial problem into a Polynomial Unconstrained Binary Optimization (PUBO) problem, with a specific formulation imposing penalty terms to take binary values when the constraints are linear. We also provide a generic reformulation into a Quadratic Unconstrained Binary Optimization (QUBO) problem. We then conduct a numerical comparison between the PUBO with binary penalty terms and the QUBO formulations proposed on a railway timetabling problem solved with QAOA. Our results illustrate that the PUBO reformulation outperforms the QUBO one for the problem at hand.
We are in the noisy intermediate-scale quantum (NISQ) devices' era, in which quantum hardware has become available for application in real-world problems. However, demonstrations of the usefulness of such NISQ devices are still rare. In this work, we consider a practical railway dispatching problem: delay and conflict management on single-track railway lines. We examine the train dispatching consequences of the arrival of an already delayed train to a given network segment. This problem is computationally hard and needs to be solved almost in real time. We introduce a quadratic unconstrained binary optimization (QUBO) model of this problem, which is compatible with the emerging quantum annealing technology. The model's instances can be executed on present-day quantum annealers. As a proof-of-concept, we solve selected real-life problems from the Polish railway network using D-Wave quantum annealers. As a reference, we also provide solutions calculated with classical methods, including the conventional solution of a linear integer version of the model as well as the solution of the QUBO model using a tensor network-based algorithm. Our preliminary results illustrate the degree of difficulty of real-life railway instances for the current quantum annealing technology. Moreover, our analysis shows that the new generation of quantum annealers (the advantage system) does not perform well on those instances, either.