Unconstrained binary models of the travelling salesman problem variants for quantum optimization

Author:

Salehi ÖzlemORCID,Glos AdamORCID,Miszczak Jarosław AdamORCID

Abstract

AbstractQuantum computing is offering a novel perspective for solving combinatorial optimization problems. To fully explore the possibilities offered by quantum computers, the problems need to be formulated as unconstrained binary models, taking into account limitation and advantages of quantum devices. In this work, we provide a detailed analysis of the travelling salesman problem with time windows (TSPTW) in the context of solving it on a quantum computer. We introduce quadratic unconstrained binary optimization and higher-order binary optimization formulations of this problem. We demonstrate the advantages of edge-based and node-based formulations of the TSPTW problem. Additionally, we investigate the experimental realization of the presented methods on a quantum annealing device. The provided results pave the path for utilizing quantum computer for a variety of real-world tasks which can be cast in the form of travelling salesman problem with time windows.

Funder

polska akademia nauk

Publisher

Springer Science and Business Media LLC

Subject

Electrical and Electronic Engineering,Modeling and Simulation,Signal Processing,Theoretical Computer Science,Statistical and Nonlinear Physics,Electronic, Optical and Magnetic Materials

Reference46 articles.

1. Gutin, G., Punnen, A. (eds.): The Traveling Salesman Problem and its Variations. Combinatorial Optimization. Kluwer Academic Press (2002)

2. Chvatal, V., Applegate, D.L., Bixby, R.E., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton Series in Applied Mathematics, Princeton University Press (2011)

3. Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Time constrained routing and scheduling. Handbooks Oper. Res. Manage. Sci. 8, 35–139 (1995)

4. El-Sherbeny, N.A.: Vehicle routing with time windows: an overview of exact, heuristic and metaheuristic methods. J. King Saud Univ. Sci. 22(3), 123–131 (2010)

5. Savelsbergh, M.W.: Local search in routing problems with time windows. Ann. Oper. Res. 4(1), 285–305 (1985)

Cited by 30 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Hybrid Quantum-Classical Computing via Dantzig-Wolfe Decomposition for Integer Linear Programming;2024 33rd International Conference on Computer Communications and Networks (ICCCN);2024-07-29

2. Solving the Turbine Balancing Problem using Quantum Annealing;Proceedings of the Genetic and Evolutionary Computation Conference Companion;2024-07-14

3. Quantum Approaches to Sustainable Resource Management in Supply Chains;Advances in Logistics, Operations, and Management Science;2024-06-30

4. VLSI Implementation of an Annealing Accelerator for Solving Combinatorial Optimization Problems;IEEE Nanotechnology Magazine;2024-06

5. Near-term distributed quantum computation using mean-field corrections and auxiliary qubits;Quantum Science and Technology;2024-05-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3