By Topic

Solving TSP via fuzzy dynamic PSO and HNN algorithm

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

3 Author(s)
Liu Tundong ; School of Information Science and Technology, Xiamen University, Xiamen, Fujian ; Zhang Huafei ; Gao Yang

Since the Hopfield network often suffers from slow rate of convergence and low accuracy and being trapped in local extremes when used to solve the traveling salesman problem, this paper combines the fuzzy dynamic particle swarm optimization (PSO) and Hopfield neural networks (HNN) to form a novel algorithm, FDPSO-HNN. Experiments show that the proposed methods outperform the algorithm of EPSO and N-EPSO in terms of both global convergence rate and computation time.

Published in:

Computer Science & Education (ICCSE), 2012 7th International Conference on

Date of Conference:

14-17 July 2012