A heuristic method for the travelling salesman problem

被引：0

作者：

Mazur, Zygmunt ^{[1
]}

Pec, Janusz ^{[2
]}

机构：

[1] Wroclaw Univ Sci & Technol, Fac Comp Sci & Management, Wroclaw, Poland

[2] Cent Stat Off Poland, Warsaw, Poland

来源：

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS | 2019年 / 37卷 / 06期

关键词：

Symmetric travelling salesman problem (STSP); assignment problem; hamiltonian circuit; simple graph; simple circuit; complete graph K-n; list L-i; heuristics;

D O I：

10.3233/JIFS-179347

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper we describe a heuristic procedure for solving the travelling salesman problem in the symmetric case without using the triangle inequality c(ij) <= c(ik) + c(kj). A complete proof of the correctness of the algorithm and example of the presentation how the method works are given. There is estimated computational complexity, which is at most O(m(2)), where m is a number of the edges of the complete graph with n vertices - K-n. There is shown also, it is possible obtain the following bound that HEURISTIC SOLUTION/OPTIMAL SOLUTION < 3, if some specific inequality considering weights (costs) of edges is satisfied.

引用

页码：7383 / 7388

页数：6

共 50 条

[1] A linearithmic heuristic for the travelling salesman problem
Taillard, eric D.
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 297 (02) : 442 - 450
[2] A tour construction heuristic for the travelling salesman problem
Hwang, CP
Alidaee, B
Johnson, JD
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1999, 50 (08) : 797 - 809
[3] Fast Heuristic Algorithm for Travelling Salesman Problem
Syambas, Nana Rahmana
Salsabila, Shasa
Suranegara, Galura Muhammad
[J]. 2017 11TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATION SYSTEMS SERVICES AND APPLICATIONS (TSSA), 2017,
[4] A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
Dell'Amico, M
Maffioli, F
Sciomachen, A
[J]. ANNALS OF OPERATIONS RESEARCH, 1998, 81 : 289 - 305
[5] A GPU Accelerated Parallel Heuristic for Travelling Salesman Problem
Rashid, Mohammad Harun
[J]. 2018 19TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNPD), 2018, : 82 - 86
[6] A Labelling Method for the Travelling Salesman Problem
Tawanda, Trust
Nyamugure, Philimon
Kumar, Santosh
Munapo, Elias
[J]. APPLIED SCIENCES-BASEL, 2023, 13 (11):
[7] Combinatorial Optimization: Comparison of Heuristic Algorithms in Travelling Salesman Problem
Halim, A. Hanif
Ismail, I.
[J]. ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING, 2019, 26 (02) : 367 - 380
[8] Novel Heuristic for New Pentagonal Neutrosophic Travelling Salesman Problem
Dhouib, Souhail
[J]. Neutrosophic Sets and Systems, 2022, 51 : 344 - 359
[9] Three new heuristic strategies for solving travelling salesman problem
School of Computer Science, China University of Geosciences, Wuhan
430074, China
[J]. Lect. Notes Comput. Sci., (181-188):
[10] Combinatorial Optimization: Comparison of Heuristic Algorithms in Travelling Salesman Problem
A. Hanif Halim
I. Ismail
[J]. Archives of Computational Methods in Engineering, 2019, 26 : 367 - 380

← 1 2 3 4 5 →