Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Transportation Research Interdisciplinary Perspectives

Quantum computing for railway rescheduling: Literature review and future directions

Alexander Schuler, Steven Travis Waller, Riccardo Bassoli, Nikola Bešinović

Published Jan 20, 2026• 1 citation
Publisher

Abstract

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.

DOI
10.1016/j.trip.2026.101868

Related papers

Formulation and quantum resolution of a railway timetabling problem

Grange, Camille, Valentina Pozzoli, François Ramond +1 more

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.

•Jun 6, 2022•0 citations

Quantum computing approach to railway dispatching and conflict management optimization on single-track railway lines

Krzysztof Domino, Mátyás Koniorczyk, Krzysztof Krawiec +2 more

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.

arXiv:2010.08227•Oct 16, 2020•18 citations

Quantum Computing in Transportation Engineering: A Survey

Shriyank Somvanshi, Md Monzurul Islam, Sazzad Bin Bashar Polock +4 more

Quantum computing introduces powerful computational paradigms capable of addressing optimization and machine learning challenges that are increasingly critical in transportation engineering. This paper presents a comprehensive survey of how quantum algorithms and models are being applied across transportation domains, including intelligent transportation systems, traffic management, vehicle routing, logistics, and autonomous systems. Unlike prior reviews that primarily introduce quantum theory, we systematically connect fundamental quantum principles-qubits, superposition, entanglement, and quantum gates-with specific transportation use cases. We synthesize recent findings showing that the Quantum Approximate Optimization Algorithm, Grover’s search, and hybrid quantum–classical solvers can improve performance in combinatorial problems such as vehicle routing and dynamic traffic signal control, while quantum machine learning models (e.g., Quantum Convolutional Neural Networks, Quantum Generative Adversarial Networks, and clustering algorithms) demonstrate promise in traffic prediction, anomaly detection, and autonomous vehicle perception. Our review highlights that although quantum hardware limitations (noise, scalability, connectivity) remain significant, empirical studies already suggest measurable improvements in solution quality and computational efficiency when compared to classical heuristics. The key contribution of this survey is to map the landscape of quantum computing in transportation engineering, identify application-specific advantages and current bottlenecks, and outline future research directions toward scalable, domain-specific quantum algorithms. By doing so, we provide transportation researchers and practitioners with a structured foundation to integrate quantum approaches into emerging mobility systems, with implications for efficiency, safety, sustainability, and equity.

IEEE Transactions on Intelligent Transportation Systems•Feb 12, 2026•10 citations

Leveraging Quantum Technologies in Transport - A Strategic Literature Review

Cristina M. Dragomir

The rapid evolution of quantum technologies presents transformative opportunities for various industries, including the transport sector. As global supply chains grow increasingly complex and data-driven logistics become central to operational efficiency, quantum computing and quantum communication are emerging as potential enablers of next-generation transport systems. This research explores the intersection of quantum innovation and transportation, with a focus on enhancing efficiency, security, and decision-making processes in logistics and mobility. The study adopts a qualitative methodology grounded in an extensive literature review of scholarly publications, industry reports, and policy papers from the past decade. Sources were selected based on their relevance to quantum applications in transportation, including routing optimization, traffic flow prediction, secure communications, and fleet management. The review framework categorizes insights according to technological readiness, practical implementation, and strategic value in the transport sector. Findings from the literature suggest that quantum computing holds significant promise for solving large-scale optimization problems, such as dynamic route planning and freight allocation, which are currently limited by classical computational methods. Additionally, quantum key distribution (QKD) is highlighted as a secure communication solution for protecting sensitive data in autonomous and connected transport systems. Although real-world applications remain limited, pilot studies and simulations indicate measurable improvements in processing speed and security protocols. This research underscores the potential of quantum technologies to redefine competitive advantage in the transport sector. By integrating quantum solutions into existing digital infrastructure, companies may achieve faster, more secure, and more sustainable transport operations. The findings also call for interdisciplinary collaboration and proactive policy support to bridge the gap between theoretical potential and practical deployment.

International Journal of Instruction, Technology & Social Sciences.•Feb 19, 2026•0 citations

Review of the application of quantum annealing-related technologies in transportation optimization

Marwan Qaid Mohammed, Henri Meeß, Maximilian Otte

Abstract Traffic optimization remains a significant challenge in urban planning and transportation management. While efficient traffic optimization is crucial for enhancing urban mobility, reducing congestion, and promoting environmental sustainability, traditional computational methods often struggle with the complex, dynamic nature of traffic systems. Recent advances in quantum computing, particularly quantum annealing, offer promising new techniques that could revolutionize traffic flow optimization. This work systematically reviews the literature, starting with search term formulation and ending with the final set of articles. These articles are categorized into three groups: (1) traffic signal control, (2) traffic flow optimization, and (3) routing problems optimization (including vehicle routing problem and traveling salesman problem). The review critically examines current studies on quantum annealing-based traffic optimization, focusing on contributions, methods, solvers, problem suitability, key findings, benchmark fairness, and limitations. It identifies key challenges and provides recommendations for future research. Insights from this work offer researchers and practitioners a concise overview of current challenges and future directions in traffic optimization.

Quantum Information Processing•Sep 2, 2025•17 citations

Quantum Annealing in the NISQ Era: Railway Conflict Management

Krzysztof Domino, Mátyás Koniorczyk, Krzysztof Krawiec +3 more

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.

arXiv:2112.03674•Entropy•Jan 18, 2023•35 citations
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.
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.
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 computing introduces powerful computational paradigms capable of addressing optimization and machine learning challenges that are increasingly critical in transportation engineering. This paper presents a comprehensive survey of how quantum algorithms and models are being applied across transportation domains, including intelligent transportation systems, traffic management, vehicle routing, logistics, and autonomous systems. Unlike prior reviews that primarily introduce quantum theory, we systematically connect fundamental quantum principles-qubits, superposition, entanglement, and quantum gates-with specific transportation use cases. We synthesize recent findings showing that the Quantum Approximate Optimization Algorithm, Grover’s search, and hybrid quantum–classical solvers can improve performance in combinatorial problems such as vehicle routing and dynamic traffic signal control, while quantum machine learning models (e.g., Quantum Convolutional Neural Networks, Quantum Generative Adversarial Networks, and clustering algorithms) demonstrate promise in traffic prediction, anomaly detection, and autonomous vehicle perception. Our review highlights that although quantum hardware limitations (noise, scalability, connectivity) remain significant, empirical studies already suggest measurable improvements in solution quality and computational efficiency when compared to classical heuristics. The key contribution of this survey is to map the landscape of quantum computing in transportation engineering, identify application-specific advantages and current bottlenecks, and outline future research directions toward scalable, domain-specific quantum algorithms. By doing so, we provide transportation researchers and practitioners with a structured foundation to integrate quantum approaches into emerging mobility systems, with implications for efficiency, safety, sustainability, and equity.
The rapid evolution of quantum technologies presents transformative opportunities for various industries, including the transport sector. As global supply chains grow increasingly complex and data-driven logistics become central to operational efficiency, quantum computing and quantum communication are emerging as potential enablers of next-generation transport systems. This research explores the intersection of quantum innovation and transportation, with a focus on enhancing efficiency, security, and decision-making processes in logistics and mobility. The study adopts a qualitative methodology grounded in an extensive literature review of scholarly publications, industry reports, and policy papers from the past decade. Sources were selected based on their relevance to quantum applications in transportation, including routing optimization, traffic flow prediction, secure communications, and fleet management. The review framework categorizes insights according to technological readiness, practical implementation, and strategic value in the transport sector. Findings from the literature suggest that quantum computing holds significant promise for solving large-scale optimization problems, such as dynamic route planning and freight allocation, which are currently limited by classical computational methods. Additionally, quantum key distribution (QKD) is highlighted as a secure communication solution for protecting sensitive data in autonomous and connected transport systems. Although real-world applications remain limited, pilot studies and simulations indicate measurable improvements in processing speed and security protocols. This research underscores the potential of quantum technologies to redefine competitive advantage in the transport sector. By integrating quantum solutions into existing digital infrastructure, companies may achieve faster, more secure, and more sustainable transport operations. The findings also call for interdisciplinary collaboration and proactive policy support to bridge the gap between theoretical potential and practical deployment.
Abstract Traffic optimization remains a significant challenge in urban planning and transportation management. While efficient traffic optimization is crucial for enhancing urban mobility, reducing congestion, and promoting environmental sustainability, traditional computational methods often struggle with the complex, dynamic nature of traffic systems. Recent advances in quantum computing, particularly quantum annealing, offer promising new techniques that could revolutionize traffic flow optimization. This work systematically reviews the literature, starting with search term formulation and ending with the final set of articles. These articles are categorized into three groups: (1) traffic signal control, (2) traffic flow optimization, and (3) routing problems optimization (including vehicle routing problem and traveling salesman problem). The review critically examines current studies on quantum annealing-based traffic optimization, focusing on contributions, methods, solvers, problem suitability, key findings, benchmark fairness, and limitations. It identifies key challenges and provides recommendations for future research. Insights from this work offer researchers and practitioners a concise overview of current challenges and future directions in traffic optimization.
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.