Suboptimum solutions obtained by the Hopfield-Tank neural network algorithm |
| |
Authors: | D. Kunz |
| |
Affiliation: | (1) Philips GmbH Forschungslaboratorium Aachen, Postfach 1980, W-5100 Aachen, Germany |
| |
Abstract: | The neural network method of Hopfield and Tank claims to be able to find nearly-optimum solutions for discrete optimization problems, e.g. the travelling salesman problem. In the present paper, an example is given which shows that the Hopfield-Tank algorithm systematically prefers certain solutions even if the energy values of these solutions are clearly higher than the energy of the global minimum. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|