Investigating the Chinese postman problem on a quantum annealer

Siloi, Ilaria; Carnevali, Virginia; Pokharel, Bibek; Fornari, Marco; Felice, Rosa Di

doi:10.1007/s42484-020-00031-9

Cited by 8 publications

(2 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It was discovered that 75 combinations of metrics and state-of-theart methods were mapped and compared out of which 60 (80%) stated that the QA performed better, 7 (9.33%) stated they have equivalent performance, and 8 (10.67%) showed that QA has lower performance. The most widely used stateof-the-art method for comparison was found to be simulated annealing as indicated by 21 (42%) of the 50 research which include [130], [149], [152], [154], [161], [168], [171], [189], [212], [217], [218], [223], [229], [238], [239], [242], [243], [246], [249], [251], [252]. This is due to the fact that QA is analogous to simulated annealing (classical approach) but in substitution of thermal activation by quantum tunneling.…”

Section: ) Results Reporting On Rq2mentioning

confidence: 99%

Implementation of Quantum Annealing: A Systematic Review

Yulianti

Surendro

2022

IEEE Access

View full text Add to dashboard Cite

Quantum annealing is a quantum computing approach widely used for optimization and probabilistic sampling problems. It is an alternative approach designed due to the limitations of gate-based quantum computing models. The method is observed to have a significant impact on different fields such as machine learning, graphics, routing, scheduling, computational chemistry, computational biology, security, portfolio, and others despite the fact that it is relatively new. This research provides a systematic review of research development trends in the field of quantum annealing and analyzes how it has been implemented in different problem domains. The results are expected to serve as the basis to identify the opportunities and challenges of research related to its implementation. The main contribution of this systematic review is to summarize different implementations of quantum annealing. It is also to analyze the prospect and opportunities in one of the problem domains with the greatest interest which is machine learning.

show abstract

Section: ) Results Reporting On Rq2mentioning

confidence: 99%

Implementation of Quantum Annealing: A Systematic Review

Yulianti

Surendro

2022

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Existing mathematical techniques were applied to solve freight routing, called vehicle routing problems (VRPs). The variants of VPRs include the node routing problem (NRP) [6,7], travelling salesman problem (TSP) [8][9][10], arc routing problem (ARP) [11][12][13], rural postman problem (RPP) [14,15], and Chinese postman problem (CPP) [16][17][18]. Locations and routes are simplified as vertices, arcs (directed routes), and edges (undirected routes).…”

Section: Vehicle Routing Problemmentioning

confidence: 99%

Optimising Urban Freight Logistics Using Discrete-Event Simulation and Cluster Analysis: A Stochastic Two-Tier Hub-and-Spoke Architecture Approach

Lyu,

Pons,

Palliparampil

et al. 2023

Smart Cities

View full text Add to dashboard Cite

The transport of freight involves numerous intermediate steps, such as freight consolidation, truck allocation, and routing, all of which exhibit high day-to-day variability. On the delivery side, drivers usually cover specific geographic regions, also known as clusters, to optimise operational efficiency. A crucial aspect of this process is the effective allocation of resources to match business requirements. The discrete-event simulation (DES) technique excels in replicating intricate real-world operations and can integrate a multitude of stochastic variables, thereby enhancing its utility for decision making. The objective of this study is to formulate a routing architecture that integrates with a DES model to capture the variability in freight operations. This integration is intended to provide robust support for informed decision-making processes. A two-tier hub-and-spoke (H&S) architecture was proposed to simulate stochastic routing for the truck fleet, which provided insights into travel distance and time for cluster-based delivery. Real industry data were employed in geographic information systems (GISs) to apply the density-based spatial clustering of applications with noise (DBSCAN) clustering method to identify customer clusters and establish a truck plan based on freight demand and truck capacity. This clustering analysis and simulation approach can serve as a planning tool for freight logistics companies and distributors to optimise their resource utilisation and operational efficiency, and the findings may be applied to develop plans for new regions with customer locations and freight demands. The original contribution of this study is the integration of variable last-mile routing and an operations model for freight decision making.

show abstract

Quantum computing for a profusion of postman problem variants

Negre

Mniszewski

2023

Quantum Mach. Intell.

View full text Add to dashboard Cite

In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing problem variants considered include graph type, directionally varying weights, number of parties involved in routing, among others. We put emphasis on the explanation of how to convert such problems into quadratic unconstrained binary optimization (QUBO) problems. QUBO is one of two equivalent natural paradigms for quantum annealing devices, the other being the Ising Model. We also expand upon a previously discovered algorithm for solving the Chinese Postman Problem on a closed undirected graph to decrease the number of constraints and variables used in the problem. Optimal annealing parameter settings and constraint weight values are discussed based on results from implementation on the D-Wave 2000Q and Advantage. Results from classical, purely quantum, and hybrid algorithms are compared.

show abstract

Investigating the Chinese postman problem on a quantum annealer

Cited by 8 publications

References 35 publications

Implementation of Quantum Annealing: A Systematic Review

Implementation of Quantum Annealing: A Systematic Review

Optimising Urban Freight Logistics Using Discrete-Event Simulation and Cluster Analysis: A Stochastic Two-Tier Hub-and-Spoke Architecture Approach

Quantum computing for a profusion of postman problem variants

Contact Info

Product

Resources

About