Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Solving a Real-World Package Delivery Routing Problem Using Quantum Annealers (2403.15114v3)

Published 22 Mar 2024 in cs.ET and cs.AI

Abstract: Research focused on the conjunction between quantum computing and routing problems has been very prolific in recent years. Most of the works revolve around classical problems such as the Traveling Salesman Problem or the Vehicle Routing Problem. The real-world applicability of these problems is dependent on the objectives and constraints considered. Anyway, it is undeniable that it is often difficult to translate complex requirements into these classical formulations.The main objective of this research is to present a solving scheme for dealing with realistic instances while maintaining all the characteristics and restrictions of the original real-world problem. Thus, a quantum-classical strategy has been developed, coined Q4RPD, that considers a set of real constraints such as a heterogeneous fleet of vehicles, priority deliveries, and capacities characterized by two values: weight and dimensions of the packages. Q4RPD resorts to the Leap Constrained Quadratic Model Hybrid Solver of D-Wave. To demonstrate the application of Q4RPD, an experimentation composed of six different instances has been conducted, aiming to serve as illustrative examples.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (34)
  1. The electric vehicle routing problem and its variations: A literature review. \JournalTitleComputers & Industrial Engineering 161, 107650 (2021).
  2. Green vehicle routing problem: A state-of-the-art review. \JournalTitleInternational Journal of Production Economics 231, 107899 (2021).
  3. Vehicle routing problem and related algorithms for logistics distribution: A literature review and classification. \JournalTitleOperational research 1–30 (2020).
  4. An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. \JournalTitleEngineering Applications of Artificial Intelligence 48, 59–71 (2016).
  5. Complexity of vehicle routing and scheduling problems. \JournalTitleNetworks 11, 221–227 (1981).
  6. Rich vehicle routing problem: Survey. \JournalTitleACM Computing Surveys (CSUR) 47, 1–28 (2014).
  7. Steane, A. Quantum computing. \JournalTitleReports on Progress in Physics 61, 117 (1998).
  8. Gill, S. S. et al. Quantum computing: A taxonomy, systematic review and future directions. \JournalTitleSoftware: Practice and Experience 52, 66–114 (2022).
  9. A survey of important issues in quantum computing and communications. \JournalTitleIEEE Communications Surveys & Tutorials (2023).
  10. Ur Rasool, R. et al. Quantum computing for healthcare: A review. \JournalTitleFuture Internet 15, 94 (2023).
  11. Egger, D. J. et al. Quantum computing for finance: State-of-the-art and future prospects. \JournalTitleIEEE Transactions on Quantum Engineering 1, 1–24 (2020).
  12. Hybrid approach for solving real-world bin packing problem instances using quantum annealers. \JournalTitleScientific Reports 13, 11777 (2023).
  13. Quantum computing for energy systems optimization: Challenges and opportunities. \JournalTitleEnergy 179, 76–89 (2019).
  14. A systematic literature review of quantum computing for routing problems. \JournalTitleIEEE Access 10, 55805–55817 (2022).
  15. The traveling salesman problem and its variations, vol. 12 (Springer Science & Business Media, 2006).
  16. Vehicle routing: problems, methods, and applications (SIAM, 2014).
  17. Quantum hobbit routing: Annealer implementation of generalized travelling salesperson problem. \JournalTitlearXiv preprint arXiv:2309.16522 (2023).
  18. Qian, W. et al. Comparative study of variations in quantum approximate optimization algorithms for the traveling salesman problem. \JournalTitleEntropy 25, 1238 (2023).
  19. A quantum algorithm for solving the travelling salesman problem by quantum phase estimation and quantum search. \JournalTitleJournal of Experimental and Theoretical Physics 137, 210–215 (2023).
  20. Quantum annealing approach for selective traveling salesman problem. In ICC 2023-IEEE International Conference on Communications, 2686–2691 (IEEE, 2023).
  21. Analysis of the vehicle routing problem solved via hybrid quantum algorithms in the presence of noisy channels. \JournalTitleIEEE Transactions on Quantum Engineering (2023).
  22. Recommending solution paths for solving optimization problems with quantum computing. In 2023 IEEE International Conference on Quantum Software (QSW), 60–67 (IEEE, 2023).
  23. Qubit efficient quantum algorithms for the vehicle routing problem on quantum computers of the nisq era. \JournalTitlearXiv preprint arXiv:2306.08507 (2023).
  24. Quantum computing for transport optimization. \JournalTitlearXiv preprint arXiv:2206.07313 (2022).
  25. Quantum annealing for vehicle routing problem with weighted segment. In AIP Conference Proceedings, vol. 2906 (AIP Publishing, 2023).
  26. Hybrid quantum solvers in production: how to succeed in the nisq era? \JournalTitlearXiv preprint arXiv:2401.10302 (2024).
  27. Supply chain logistics with quantum and classical annealing algorithms. \JournalTitleScientific Reports 13, 4770 (2023).
  28. D-Wave Developers. Measuring Performance of the Leap Constrained Quadratic Model Solver. Tech. Rep. 14-1065A-A, D-Wave Systems Inc. (2022).
  29. Feld, S. et al. A hybrid solution method for the capacitated vehicle routing problem using a quantum annealer. \JournalTitleFrontiers in ICT 6, 13 (2019).
  30. Unconstrained binary models of the travelling salesman problem variants for quantum optimization. \JournalTitleQuantum Information Processing 21, 67 (2022).
  31. D-Wave Developers. Hybrid Solver for Constrained Quadratic Models. Tech. Rep. 14-1055A-A, D-Wave Systems Inc. (2021).
  32. Quantum annealing for the adjuster routing problem. \JournalTitleFrontiers in Physics 11, 1129594 (2023).
  33. Datasets and results for the 2-dimensional and heterogeneous package delivery with priorities problem. http://dx.doi.org/10.17632/yv48pwk96y.1 (2024). Online at Mendeley Data.
  34. Solving logistic-oriented bin packing problems through a hybrid quantum-classical approach. In 2023 IEEE 26th International Conference on Intelligent Transportation Systems (ITSC), 2239–2245 (IEEE, 2023).
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now