Algorithm for Solving Traveling Salesman Problem Based on Self-Organizing Mapping Network

Traveling salesman problem (TSP) is a classic non-deterministic polynomial-hard optimization problem. Based on the characteristics of self-organizing mapping (SOM) network, this paper proposes an improved SOM network from the perspectives of network update strategy, initialization method, and parame...

Full description

Saved in:
Bibliographic Details
Published in:Shanghai jiao tong da xue xue bao 2024-06, Vol.29 (3), p.463-470
Main Authors: Zhu, Jianghui, Ye, Hanghang, Yao, Lixiu, Cai, Yunze
Format: Article
Language:English
Subjects:
Algorithms
Architecture
Computer Science
Electrical Engineering
Engineering
Heuristic methods
Life Sciences
Mapping
Materials Science
Polynomials
Problem solving
Traveling salesman problem
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Traveling salesman problem (TSP) is a classic non-deterministic polynomial-hard optimization problem. Based on the characteristics of self-organizing mapping (SOM) network, this paper proposes an improved SOM network from the perspectives of network update strategy, initialization method, and parameter selection. This paper compares the performance of the proposed algorithms with the performance of existing SOM network algorithms on the TSP and compares them with several heuristic algorithms. Simulations show that compared with existing SOM networks, the improved SOM network proposed in this paper improves the convergence rate and algorithm accuracy. Compared with iterated local search and heuristic algorithms, the improved SOM network algorithms proposed in this paper have the advantage of fast calculation speed on medium-scale TSP.
ISSN:1007-1172
1674-8115
1995-8188
DOI:10.1007/s12204-022-2517-3