4.6 Article

A collaborative neurodynamic optimization algorithm to traveling salesman problem

Journal

COMPLEX & INTELLIGENT SYSTEMS
Volume 9, Issue 2, Pages 1809-1821

Publisher

SPRINGER HEIDELBERG
DOI: 10.1007/s40747-022-00884-6

Keywords

Combinatorial optimization problems; Collaborative neurodynamic optimization; Hopfield neural network; Traveling salesman problem

Ask authors/readers for more resources

This paper proposes a collaborative neurodynamic optimization method to solve the traveling salesman problem. The method utilizes a neural network and particle swarm optimization to effectively solve the TSP.
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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available