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 条
12345