A hybrid heuristic for the traveling salesman problem

被引：133

作者：

Baraglia, R ^{[1
]}

Hidalgo, JI

Perego, R

机构：

[1] CNR, Ist CNUCE, I-56010 Pisa, Italy

[2] Univ Complutense, Dept Arquitectura Comp & Automat, E-28040 Madrid, Spain

来源：

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION | 2001年 / 5卷 / 06期

关键词：

compact genetic algorithms; hybrid GA; Lin-Kernighan algorithm; TSP;

D O I：

10.1109/4235.974843

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The combination of genetic and local search heuristics has been shown to be an effective approach to solving the traveling salesman problem (TSP). This paper describes a new hybrid algorithm that exploits a compact genetic algorithm in order to generate high-quality tours, which are then refined by means of the Lin-Kernighan (LK) local search. Local optima found by the LK local search are in turn exploited by the evolutionary part of the algorithm in order to improve the quality of its simulated population. The results of several experiments conducted on different TSP instances with up to 13509 cities show the efficacy of the symbiosis between the two heuristics.

引用

页码：613 / 622

页数：10

共 50 条

[21] EFFECTIVE HEURISTIC ALGORITHM FOR TRAVELING-SALESMAN PROBLEM
LIN, S
KERNIGHAN, BW
[J]. OPERATIONS RESEARCH, 1973, 21 (02) : 498 - 516
[22] New heuristic algorithms for the Dubins traveling salesman problem
Babel, Luitpold
[J]. JOURNAL OF HEURISTICS, 2020, 26 (04) : 503 - 530
[23] Study on a new heuristic crossover for the traveling salesman problem
Hu, Qiaohua
Wu, Huaiyu
Chen, Qiaoli
Chen, Yuan
[J]. 2006 CHINESE CONTROL CONFERENCE, VOLS 1-5, 2006, : 495 - +
[24] A Multistart Heuristic for the Equality Generalized Traveling Salesman Problem
Cacchiani, Valentina
Fernandes Muritiba, Albert Einstein
Negreiros, Marcos
Toth, Paolo
[J]. NETWORKS, 2011, 57 (03) : 231 - 239
[25] A HEURISTIC ALGORITHM FOR THE TRAVELING SALESMAN LOCATION PROBLEM ON NETWORKS
SIMCHILEVI, D
BERMAN, O
[J]. OPERATIONS RESEARCH, 1988, 36 (03) : 478 - 484
[26] A heuristic for the traveling salesman problem based on a continuous approximation
del Castillo, JM
[J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1999, 33 (02) : 123 - 152
[27] A new heuristic for the Traveling Salesman Problem with Time Windows
Calvo, RW
[J]. TRANSPORTATION SCIENCE, 2000, 34 (01) : 113 - 124
[28] An efficient heuristic algorithm for the bottleneck traveling salesman problem
Ramakrishnan R.
Sharma P.
Punnen A.P.
[J]. OPSEARCH, 2009, 46 (3) : 275 - 288
[29] A new combined heuristic for the Euclidean traveling salesman problem
Yang, Fei
Lu, Yijiang
[J]. Proceedings of the First International Conference on Information and Management Sciences, 2002, 1 : 102 - 105
[30] ON THE REFINEMENT OF BOUNDS OF HEURISTIC ALGORITHMS FOR THE TRAVELING SALESMAN PROBLEM
JEROMIN, B
KORNER, F
[J]. MATHEMATICAL PROGRAMMING, 1985, 32 (01) : 114 - 117

← 1 2 3 4 5 →