A collaborative neurodynamic optimization algorithm to traveling salesman problem
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 × n neurons for the n cities. Second, to ensure the convergence of continuous HNN (CHNN), we reformulate TSP to satisfy the...
Saved in:
Published in | Complex & intelligent systems Vol. 9; no. 2; pp. 1809 - 1821 |
---|---|
Main Authors | , , , , , |
Format | Journal Article |
Language | English |
Published |
Cham
Springer International Publishing
01.04.2023
Springer Nature B.V Springer |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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
×
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. |
---|---|
ISSN: | 2199-4536 2198-6053 |
DOI: | 10.1007/s40747-022-00884-6 |