Solving the Travelling Salesman Problem Based on Collaborative Neurodynamic Optimization with Discrete Hopfield Networks

摘要

This paper addresses the travelling salesman problem (TSP) based on collaborative neurodynamic optimization (CNO). In the CNO approach to TSP, a population of discrete Hopfield networks are employed for searching local optimal solutions and repeatedly reinitialized by using the particle swarm optimization rule towards a global optimal solution. Experimental results for solving four TSP benchmarks are reported to substantiate the efficacy of the CNO approach.