By Topic

Dynamic neural network with heuristics

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
$31 $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

6 Author(s)
Jeon Gue Park ; Syst. Eng. Res. Inst., Korea Inst. of Sci. & Technol., Taejon, South Korea ; Jong Man Park ; Dou Seok Kim ; Chong Hyun Lee
more authors

With the deterministic nature and the difficulty of scaling, Hopfield-style neural network is readily to converge to one of local minima in the course of energy function minimization, not to escape from those undesirable solutions. Many researchers, who want to find the global minimum of the traveling salesman problem (TSP), have introduced various approaches to solve such conditions including heuristics, genetic algorithms, hybrid algorithms of some methods, etc. We introduce a simple heuristic algorithm which embeds the classical local search heuristics into the optimization neural network. The proposed algorithm is characterized with the best neighbors selection, which is used in the dynamic scheduling and in ordering the update sequence of neurons, and with the decidability check which is used to guarantee the near-optimal solution. The proposed algorithm enhances both the convergence speed and the quality of solutions

Published in:

Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on  (Volume:7 )

Date of Conference:

27 Jun-2 Jul 1994