.png){kind=icon}
Return
A collaborative neurodynamic optimization algorithm to traveling salesman problem
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-022-00884-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposed a collaborative neurodynamic optimization (CNO) method to solve traveling salesman problem (TSP). First, we construct a Hopfield neural network (HNN) with n x n neurons for the n cities. Second, to ensure the convergence of continuous HNN (CHNN), we reformulate TSP to satisfy the convergence condition of CHNN and solve TSP by CHNN. Finally, a population of CHNNs is used to search for local optimal solutions of TSP and the globally optimal solution is obtained using particle swarm optimization. Experimental results show the effectiveness of the CNO approach for solving TSP.
Keywords:
Combinatorial optimization problems
Collaborative neurodynamic optimization
Hopfield neural network
Traveling salesman problem
Journal
IF:
4.6
Papers:
2.1K
Citations:
6.6K
Organization
Cited Papers
ShareSaveHybrid and enhanced PSO: Novel first order reliability method-based hybrid intelligent approaches
PREAI
ShareSaveA collective neurodynamic optimization approach to bound-constrained nonconvex optimization.png)
NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
ShareSave
View more