Quantum Computing for Supply Chain and Logistics Optimization The Evolution of Computing Technology

Authors

  • Chandra Jaiswal   Independent Researcher, USA

DOI:

https://doi.org/10.32628/CSEIT239076

Keywords:

Quantum Computing, Supply Chain Optimization, Logistics, Quantum Annealing, Hybrid Quantum-Classical Approaches

Abstract

Quantum computing presents a transformative opportunity for optimizing supply chain and logistics operations by addressing complex combinatorial challenges beyond the capabilities of classical computing. Traditional supply chain optimization relies on heuristic and mathematical models, which struggle with large-scale problems such as vehicle routing, warehouse management, demand forecasting, and last-mile delivery. Quantum computing, leveraging qubits and principles like superposition and entanglement, enables exponential computational power and efficiency. This paper explores quantum computing's applications in logistics, including quantum annealing for route optimization, fleet management, and supply chain network design. Companies like IBM, Google, and D-Wave are advancing quantum algorithms, with hybrid quantum-classical approaches emerging as practical solutions. While large-scale commercial adoption is still in its infancy, research demonstrates promising results in reducing operational costs, improving sustainability, and enhancing decision-making. The study synthesizes over 80 published works on quantum computing's role in logistics, providing insights into emerging technologies, challenges, and future potential. As the field progresses, early adoption and pilot programs will be crucial for businesses to gain a competitive edge in an increasingly complex global supply chain landscape. Quantum computing has the potential to redefine efficiency, cost reduction, and real-time adaptability in logistics and supply chain management.

References

  1. Ajagekar, A., Humble, T., & You, F. (2020). Quantum computing-based hybrid solution strategies for large-scale discrete-continuous optimization problems. Computers & Chemical Engineering, 132, 106630.
  2. Andoin, M. G. d., Osaba, E., Oregi, I., Villar-Rodriguez, E., & Sanz, M. (2022). Hybrid quantum-classical heuristic for the bin packing problem. In Proceedings of the Genetic and Evolutionary Computation Conference Companion (pp. 2214–2222).
  3. Atchade-Adelomou, P., Alonso-Linaje, G., Albo-Canals, J., & Casado-Fauli, D. (2021). qrobot: A quantum computing approach in mobile robot order picking and batching problem solver optimization. Algorithms, 14(7), 194.
  4. Azzaoui, A., Kim, T. W., Pan, Y., & Park, J. H. (2021). A quantum approximate optimization algorithm based on blockchain heuristic approach for scalable and secure smart logistics systems. Human-centric Computing and Information Sciences, 11(46), 1–12.
  5. Bayerstadler, A., Becquin, G., Binder, J., Botter, T., Ehm, H., Ehmer, T., Erdmann, M., et al. (2021). Industry quantum computing applications. EPJ Quantum Technology, 8(1), 25.
  6. Ding, Y., Chen, X., Lamata, L., Solano, E., & Sanz, M. (2019). Logistic network design with a D-Wave quantum annealer. arXiv preprint arXiv:1906.10074.
  7. Fitzek, D., Ghandriz, T., Laine, L., Granath, M., & Kockum, A. F. (2021). Applying quantum approximate optimization to the heterogeneous vehicle routing problem. arXiv preprint arXiv:2110.06799.
  8. Gabbassov, E. (2022). Transit facility allocation: Hybrid quantum-classical optimization. PLOS ONE, 17(9), e0274632.
  9. Jahin, M. A., Shovon, M. S. H., Islam, M. S., Shin, J., Mridha, M., & Okuyama, Y. (2023). Qamplifynet: Pushing the boundaries of supply chain backorder prediction using interpretable hybrid quantum-classical neural networks. Scientific Reports, 13(1), 18246.
  10. Le, T. V., Nguyen, M. V., Khandavilli, S., Dinh, T. N., & Nguyen, T. N. (2023). Quantum annealing approach for the selective traveling salesman problem. In ICC 2023 - IEEE International Conference on Communications (pp. 2686–2691).
  11. Makhanov, H., Setia, K., Liu, J., Gomez-Gonzalez, V., & Jenaro-Rabadan, G. (2023). Quantum computing applications for flight trajectory optimization. arXiv preprint arXiv:2304.14445.
  12. Malviya, G., AkashNarayanan, B., & Seshadri, J. (2023). Logistics network optimization using quantum annealing. In International Conference on Emerging Trends and Technologies on Intelligent Systems (pp. 401–413).
  13. Martins, L. N. (2020). Applying quantum annealing to the tail assignment problem. Ph.D. thesis, University of Porto.
  14. Mohammadbagherpoor, H., Dreher, P., Ibrahim, M., Oh, Y. H., Hall, J., Stone, R. E., & Stojkovic, M. (2021). Exploring airline gate-scheduling optimization using quantum computers. arXiv preprint arXiv:2111.09472.
  15. Neukart, F., Compostella, G., Seidel, C., Von Dollen, D., Yarkoni, S., & Parney, B. (2017). Traffic flow optimization using a quantum annealer. Frontiers in ICT, 4, 29.
  16. Phillipson, F., & Chiscop, I. (2021). Multimodal container planning: A QUBO formulation and implementation on a quantum annealer. In International Conference on Computational Science (pp. 30–44).
  17. Papalitsas, C., Andronikos, T., Giannakis, K., Theocharopoulou, G., & Fanarioti, S. (2019). A QUBO model for the traveling salesman problem with time windows. Algorithms, 12(11), 224.
  18. Jangid, J., & Dixit, S. (2023). The AI Renaissance: Innovations, Ethics, and the Future of Intelligent Systems (Vol. 1). Technoscience Academy (The International Open Access Publisher).
  19. Salehi, O., Glos, A., & Miszczak, J. A. (2022). Unconstrained binary models of the traveling salesman problem variants for quantum optimization. Quantum Information Processing, 21(2), 67.
  20. Satori, K., & Yoshikawa, N. (2023). Quantum optimization for the location assignment problem in ASSR. In PHM Society Asia-Pacific Conference, 4.
  21. Yarkoni, S., Huck, A., Schülldorf, H., Speitkamp, B., Tabrizi, M. S., Leib, M., Bäck, T., & Neukart, F. (2021). Solving the shipment rerouting problem with quantum optimization techniques. In Computational Logistics: 12th International Conference, ICCL 2021 (pp. 502–517).
  22. Shubham Malhotra, Muhammad Saqib, Dipkumar Mehta, and Hassan Tariq. (2023). Efficient Algorithms for Parallel Dynamic Graph Processing: A Study of Techniques and Applications. International Journal of Communication Networks and Information Security (IJCNIS), 15(2), 519–534. Retrieved from https://ijcnis.org/index.php/ijcnis/article/view/7990

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2023-10-30

Issue

Volume 9, Issue 5, September-October-2023

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Chandra Jaiswal , " Quantum Computing for Supply Chain and Logistics Optimization The Evolution of Computing Technology" International Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 9, Issue 5, pp.442-452, September-October-2023. Available at doi : https://doi.org/10.32628/CSEIT239076