International Journal on Applied Physics and Engineering
E-ISSN: 2945-0489
Volume 3, 2024
Framework for Small Traveling Salesman Problems
Author:
Abstract: We study small traveling salesman problems (TSPs) because current quantum computers can find optional solutions for TSPs with up to 14 cities. Also, we study small TSPs because TSPs have been recommended to be benchmarks to measure quantum optimization on all types of quantum hardware. This means comparisons of quantum data about small TSPs. We extent previous numerical results that were reported in “Small Traveling Salesman Problems” for 6, 8 and 10 cities. The new results in this paper are for 10 – 14 cities in symmetric TSPs. The data for this new range of cities is consistent with the previous data and can be the basis for estimates of results from quantum computers that are upgraded to handle more than 14 cities. The work and analysis suggest two conjectures that we discuss. The paper also contains an annotated survey of recent publications about TSPs.
Search Articles
Keywords: Traveling salesman problem, optimal tour, combinatorial analysis, discrete optimization, quantum annealing, quantum computer
Pages: 43-51
DOI: 10.37394/232030.2024.3.7