Hopfield network, energy function, optimization, rescaling
In this paper we propose an approach that rescales the distance matrix of the energy function in the Hopfield network for solving optimization problems. We rescale the distance matrix by normalizing each row in the matrix and then adjusting the parameter for the distance term. This scheme has the capability of reducing the effects of clustering in data distributions, which is one of main reasons for the formation of invalid solutions. We evaluate this approach through a large number (20,000) simulations based on 200 randomly generated city distributions of the 10-city traveling salesman problem. The result shows that, compared to those using the original Hopfield network, rescaling is capable of increasing the percentage of valid tours by 17.6%, reducing the error rate of tour length by 11.9%, and increasing the chance of finding optimal tours by 14.3%.
Original Publication Citation
Zeng, X. and Martinez, T. R., "Rescaling the Energy Function in Hopfield Networks", Proceedings of the IEEE International Joint Conference on Neural Networks IJCNN', Vol. 6, pp. 498-54, 2.
BYU ScholarsArchive Citation
Martinez, Tony R. and Zeng, Xinchuan, "Rescaling the Energy Function in Hopfield Networks" (2000). All Faculty Publications. 1108.
Physical and Mathematical Sciences
© 2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Copyright Use Information