A Quantum Heuristic Algorithm for the Traveling Salesman Problem

被引：7

作者：

Bang, Jeongho ^{[1
,2
,3
]}

Ryu, Junghee ^{[3
,4
]}

Lee, Changhyoup ^{[3
,5
]}

Yoo, Seokwon ^{[3
]}

Lim, James ^{[3
]}

Lee, Jinhyoung ^{[1
,2
,3
,6
]}

机构：

[1] Seoul Natl Univ, Ctr Macroscop Quantum Control, Seoul 151747, South Korea

[2] Seoul Natl Univ, Dept Phys & Astron, Seoul 151747, South Korea

[3] Hanyang Univ, Dept Phys, Seoul 133791, South Korea

[4] Univ Gdansk, Inst Theoret Phys & Astrophys, PL-80952 Gdansk, Poland

[5] Natl Univ Singapore, Ctr Quantum Technol, Singapore 117543, Singapore

[6] Korea Inst Adv Study, Sch Computat Sci, Seoul 130722, South Korea

来源：

JOURNAL OF THE KOREAN PHYSICAL SOCIETY | 2012年 / 61卷 / 12期

基金：

新加坡国家研究基金会;

关键词：

Quantum computation; Quantum algorithm; Traveling salesman problem; NP-COMPLETE PROBLEM; ADIABATIC ALGORITHM; OPTIMIZATION; COMPUTERS; SEARCHES;

D O I：

10.3938/jkps.61.1944

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

We propose a quantum heuristic algorithm to solve the traveling salesman problem by generalizing the Grover search. Sufficient conditions are derived to greatly enhance the probability of finding the tours with the cheapest costs reaching almost to unity. These conditions are characterized by the statistical properties of tour costs and are shown to be automatically satisfied in the large-number limit of cities. In particular for a continuous distribution of the tours along the cost, we show that the quantum heuristic algorithm exhibits a quadratic speedup compared to its classical heuristic algorithm.

引用

页码：1944 / 1949

页数：6

共 50 条

[1] A quantum heuristic algorithm for the traveling salesman problem
Jeongho Bang
Junghee Ryu
Changhyoup Lee
Seokwon Yoo
James Lim
Jinhyoung Lee
Journal of the Korean Physical Society, 2012, 61 : 1944 - 1949
[2] HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM
RAYMOND, TC
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1969, 13 (04) : 400 - &
[3] An Efficient Heuristic Algorithm for the Traveling Salesman Problem
Azimi, Parham
Daneshvar, Peyman
ADVANCED MANUFACTURING AND SUSTAINABLE LOGISTICS, PROCEEDINGS, 2010, 46 : 384 - +
[4] New heuristic algorithm for traveling salesman problem
Shahab, M. L.
INTERNATIONAL CONFERENCE ON MATHEMATICS: PURE, APPLIED AND COMPUTATION, 2019, 1218
[5] Exact Heuristic Algorithm for Traveling Salesman Problem
Lin, Dongmei
Wu, Xiangbin
Wang, Dong
PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE FOR YOUNG COMPUTER SCIENTISTS, VOLS 1-5, 2008, : 9 - +
[6] EFFECTIVE HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM
LIN, S
KERNIGHAN, BW
OPERATIONS RESEARCH, 1973, 21 (02) : 498 - 516
[7] A HEURISTIC ALGORITHM FOR THE TRAVELING SALESMAN LOCATION PROBLEM ON NETWORKS
SIMCHILEVI, D
BERMAN, O
OPERATIONS RESEARCH, 1988, 36 (03) : 478 - 484
[8] A Hybrid Heuristic Algorithm for the Euclidean Traveling Salesman Problem
Singh, Dharm Raj
Singh, Manoj Kumar
Singh, Tarkeshwar
2015 INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATION & AUTOMATION (ICCCA), 2015, : 773 - 778
[9] An efficient heuristic algorithm for the bottleneck traveling salesman problem
Ramakrishnan R.
Sharma P.
Punnen A.P.
OPSEARCH, 2009, 46 (3) : 275 - 288
[10] The period traveling salesman problem: a new heuristic algorithm
Paletta, G
COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (10) : 1343 - 1352

← 1 2 3 4 5 →