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

作　　者：朱江辉 叶航航 姚莉秀 蔡云泽 ZHU Jianghui;YE Hanghang;YAO Liciu;CAI Yunze(Department of Automation,Shanghai Jiao Tong University,Shanghai 200240,China;Key Laboratory of System Control and Information Processing,Ministry of Education,Shanghai 200240,China;Shanghai Engineering Research Center of Intelligent Control and Management,Shanghai 200240,China;Key Laboratory of Marine Intelligent Equipment and System,Ministry of Education,Shanghai 200240,China;Huawei Technologies Co.,Ltd.,Shanghai 201206,China)

机构地区：[1]Department of Automation,Shanghai Jiao Tong University,Shanghai 200240,China [2]Key Laboratory of System Control and Information Processing,Ministry of Education,Shanghai 200240,China [3]Shanghai Engineering Research Center of Intelligent Control and Management,Shanghai 200240,China [4]Key Laboratory of Marine Intelligent Equipment and System,Ministry of Education,Shanghai 200240,China [5]Huawei Technologies Co.,Ltd.,Shanghai 201206,China

出　　处：《Journal of Shanghai Jiaotong university(Science)》2024年第3期463-470,共8页上海交通大学学报（英文版）

基　　金：the National Natural Science Foundation of China (No.61627810);the National Science and Technology Major Program of China (No.2018YFB1305003);the National Defense Science and Technology Outstanding Youth Science Foundation (No.2017-JCJQ-ZQ-031)。

摘　　要：Traveling salesman problem(TSP)is a classic non-deterministic polynomial-hard optimization prob-lem.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 net-work algorithms proposed in this paper have the advantage of fast calculation speed on medium-scale TSP.

关 键 词：traveling salesman problem(TSP) self-organizing mapping(SOM) combinatorial optimization neu-ral network 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]