Development of a Modification of the Particle Collision Algorithm (PCA), Providing an Approximate Solution to the Traveling Salesman Problem

被引：0

作者：

Syedin, D. Yu. ^{[1
,2
]}

机构：

[1] MIREA Russian Technol Univ, Dept Corp Informat Syst, Moscow, Russia

[2] Starovoytov Ctr Informat Technol & Syst Execut Pow, Moscow, Russia

来源：

AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS | 2024年 / 58卷 / 01期

关键词：

traveling salesman problem; stochastic algorithm; combinatorial optimization; LOCAL SEARCH; FORMALISM;

D O I：

10.3103/S0005105524010047

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This work is devoted to the development of a modification of the particle collision algorithm (PCA), which provides an approximate solution to the traveling salesman problem. The resulting modification was tested on a number of well-known tasks and demonstrated greater accuracy and efficiency than its analogues.

引用

页码：1 / 9

页数：9

共 50 条

[1] Development of a Modification of the Particle Collision Algorithm (PCA), Providing an Approximate Solution to the Traveling Salesman Problem
D. Yu. Syedin
Automatic Documentation and Mathematical Linguistics, 2024, 58 : 1 - 9
[2] RAPID HEURISTIC ALGORITHM FOR APPROXIMATE SOLUTION OF TRAVELING SALESMAN PROBLEM
WIORKOWSKI, JJ
MCELVAIN, K
TRANSPORTATION RESEARCH, 1975, 9 (2-3): : 181 - 185
[3] APPROXIMATE SOLUTION OF THE TRAVELING SALESMAN PROBLEM
Dulkeyt, V., I
Faizulin, R. T.
PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2009, 3 (01): : 72 - +
[4] AN ALGORITHM FOR THE APPROXIMATE SOLUTION OF A LARGE-SCALE TRAVELING SALESMAN PROBLEM IN A PLANE
SIGAL, IK
USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1988, 28 (04): : 205 - 208
[5] Method of scaling in approximate solution of the traveling salesman problem
E. E. Ivanko
Automation and Remote Control, 2011, 72 : 2527 - 2540
[6] Method of scaling in approximate solution of the traveling salesman problem
Ivanko, E. E.
AUTOMATION AND REMOTE CONTROL, 2011, 72 (12) : 2527 - 2540
[7] The Quantum Approximate Algorithm for Solving Traveling Salesman Problem
Ruan, Yue
Marsh, Samuel
Xue, Xilin
Liu, Zhihao
Wang, Jingbo
CMC-COMPUTERS MATERIALS & CONTINUA, 2020, 63 (03): : 1237 - 1247
[8] The quantum approximate algorithm for solving traveling Salesman problem
Ruan Y.
Marsh S.
Xue X.
Liu Z.
Wang J.
Ruan, Yue (yue_ruan@ahut.edu.cn); Wang, Jingbo (jingbo.wang@uwa.edu.au), 2020, Tech Science Press (63): : 1237 - 1247
[9] A SEQUENCE FOR USING ALGORITHMS FOR THE APPROXIMATE SOLUTION IN THE HYBRID ALGORITHM FOR SOLVING THE TRAVELING SALESMAN PROBLEM
SIGAL, IK
USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1989, 29 (06): : 80 - 84
[10] Field partitioning: An approximate method for the solution of the traveling salesman problem
Bapat, PM
Takalikar, SN
FIRST INTERNATIONAL CONFERENCE ON OPERATIONS AND QUANTITATIVE MANAGEMENT, VOL 1 AND 2, 1997, : 71 - 75

← 1 2 3 4 5 →