By Topic

Application of continuous Hopfield network to solve the TSP

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Helei Wu ; Inf. Eng. Sch., Nanchang Univ., China ; Yirong Yang

Traveling salesman problem (TSP) is a classic of difficult optimization problem. It is simple to describe, mathematically well characterized. But the actual best solution to TSP is computationally very hard, called a NP-complete problem. In this paper, continuous Hopfield network (CHN) is applied to solve TSP. The energy function to be minimized is determined both by constraints for a valid solution and by total length of touring path. Setting of parameters in energy function is crucial to the convergence and performance of the network. The role of each parameter is analyzed and criteria for choosing these parameters are described. Iterative computation algorithm of CHN is given. Computer simulation is conducted for 6-, City TSP. Some simulation results, such as convergence curve, iteration count, computation time, are used to evaluate this method.

Published in:

Control, Automation, Robotics and Vision Conference, 2004. ICARCV 2004 8th  (Volume:3 )

Date of Conference:

6-9 Dec. 2004