Peng, Mengkang, Gupta, Naren K and Armitage, Alistair (1996) An Investigation into the improvement of Local Minima of the Hopfield Network. Neural Networks, 9 (7). pp. 1241-1253. ISSN 0893 6080
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial.
Download (810kB) | Request a copy
The paper investigates the improvement of local minima of the Hopfield network. A local minima escape algorithm (LME algorithm), is proposed for improving local minima of small-scale networks. Experiments on travelling salesman problems (TSP) show that the LME algorithm is an efficient algorithm in improving the local minima, and the comparison with the simulated annealing algorithm (SA) shows that the LME algorithm can produce better results in less time. The paper then investigates the improvement of local minima of large-scale networks. By combining the LME algorithm with a network partitioning technique, a network partitioning algorithm (NPA) is proposed. Experiments on 51 and 101-city TSP problems show that the local minima of large-scale networks can be greatly improved by the NPA algorithm, however, the global minima are still difficult to achieve.
|Print ISSN:||0893 6080|
|Electronic ISSN:||1879 2782|
|Uncontrolled Keywords:||Hopfield network; local minima; global minimum; network partitioning; travelling salesman problem;|
|University Divisions/Research Centres:||Faculty of Engineering, Computing and Creative Industries > School of Computing|
|Dewey Decimal Subjects:||600 Technology > 620 Engineering > 621 Electronic & mechanical engineering > 621.3 Electrical & electronic engineering > 621.38 Electronics & Communications engineering > 621.382 Communications engineering > 621.3822 Signal processing > 621.3827 Optical communications|
|Library of Congress Subjects:||T Technology > TK Electrical engineering. Electronics Nuclear engineering|
|Depositing User:||Computing Research|
|Date Deposited:||29 Jul 2010 15:40|
|Last Modified:||09 Oct 2013 15:24|
Actions (login required)