In this paper, the multicommodity network flow (MCNF) problem is formulated as a mixed integer programing model which is known as NP-hard, aiming to optimize the vehicle routing and minimize the total travel cost. We explore the potential of quantum computing, specifically quantum annealing, by comparing its performance in terms of solution quality and efficiency against the traditional method. Our findings indicate that quantum annealing holds significant promise for enhancing computation in large-scale transportation logistics problems.
In this paper, the multicommodity network flow (MCNF) problem is formulated as a mixed integer programing model which is known as NP-hard, aiming to optimize the vehicle routing and minimize the total travel cost. We explore the potential of quantum computing, specifically quantum annealing, by comparing its performance in terms of solution quality and efficiency against the traditional method. Our findings indicate that quantum annealing holds significant promise for enhancing computation in large-scale transportation logistics problems.
In this paper, the multicommodity network flow (MCNF) problem is formulated as a mixed integer programming model which is known as NP-hard, aiming to optimize the vehicle routing and minimize the total travel cost. We explore the potential of quantum computing, specifically quantum annealing, by comparing its performance in terms of solution quality and efficiency against the traditional method. Our findings indicate that quantum annealing holds significant promise for enhancing computation in large-scale transportation logistics problems.
Large-scale logistic networks present a formidable challenge to traditional optimization techniques. The sheer number of variables and constraints involved—including vehicle routing, shipment scheduling, warehouse operations, and inventory management—often leads to computational bottlenecks, hindering efficient network design and operation. This paper investigates the application of quantum-inspired optimization algorithms to address these challenges. Specifically, we explore the potential of algorithms mimicking quantum phenomena, such as quantum annealing and quantum walks, to efficiently solve complex routing and scheduling problems within large logistic networks. Our approach leverages the inherent parallelism and ability of these algorithms to navigate complex solution spaces, offering a promising alternative to classical methods. We demonstrate the feasibility and potential benefits of this strategy through a theoretical framework and illustrative examples, highlighting the advantages of quantum-inspired optimization for improving the performance of large-scale logistic networks.
Quantum computing provides a novel approach to addressing conventionally intractable issues in large-scale optimization. Space logistics missions require the efficient routing of payloads, spacecraft, and resources across complex networks, often resulting in an exponential growth of the solution space that classical methods cannot efficiently solve. This paper leverages quantum computing to model and solve the space logistics problem as a time-dependent multicommodity network flow, enabling the exploration of large solution spaces. The findings highlight quantum computing's potential to address complex aerospace logistics, demonstrating its suitability for complex interplanetary mission planning.
In the current competitive industrial environment, the study of NP-hard issues is becoming more and more significant. In logistics, the Vehicle Routing Problem (VRP) is one of the popular challenges, especially in cold chain logistics, which requires the management of perishable goods. This problem involves identifying the optimal paths for vehicles responsible for transporting goods to different locations. Due to its combinatorial nature and the complexity of finding optimal solutions, it is identified as an NP-hard problem that requires an unreasonable time frame to solve. Recently, quantum computing has proven to be a promising approach for addressing some of the complex challenges. Among quantum methodologies, quantum annealing (QA) has demonstrated the potential to accelerate computation times in solving optimization problems. By leveraging the principles of quantum tunneling and superposition, QA can explore solution spaces more efficiently. Therefore, this study explores the application of QA to address VRP in cold chain logistics, aiming to develop solutions that minimize travel distances during deliveries. The case study demonstrates that QA can achieve, on average, at least 85% of optimal performance while providing approximately 95% faster run times compared to classical genetic algorithms (GA). This contributes to greater efficiency in cold chain logistics operations.
Current world trade is based and supported in a strong and healthy supply chain, where logistics play a key role in producing and providing key assets and goods to keep societies and economies going. Current geopolitical and sanitary challenges faced in the entire world have made even more critical the role of logistics and increased demands for tuning transport function to keep the supply chain up and running. The challenge is only increasing and growing for the future, thus tackling transport optimization provides both business and social value. Optimization problems are ubiquitous and they present a challenge due to its complexity, where they're typically NP-hard problems. Quantum Computing is a developing field, and the Quantum Annealing approach has proven to be quite effective in its applicability and usefulness to tackle optimization problems. In this work we treat the Vehicle Routing Problem, which is also a variation of a famous optimization problem known as the Traveling Salesman Problem. We aim to tackle the vehicle optimization problem from the last mile logistic scenario application, with a perspective from the classical and quantum approaches, and providing a solution which combines both, also known as hybrid solution. Finally, we provide the results of the analysis and proposal for the consideration of applications in a near term business case scenario.
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.