Theoretical comparison of mappings of combinatorial optimization problems to Hopfield networks

Author

Matsuda, Satoshi

Author_Institution

Comput. & Commun. Res. Center, Tokyo Electr. Power Co. Inc., Japan

Volume

4

fYear

1995

fDate

Nov/Dec 1995

Firstpage

1674

Abstract

In solving combinatorial optimization problems by Hopfield networks, mappings of the problems to the networks are not made so carefully. Though many mappings of, for example, the traveling salesman problems (TSP) have been proposed, their theoretical comparisons are not made yet. In this paper, taking two typical mappings of TSP as examples, their theoretical comparisons are made to prove one´s superiority to the other by the asymptotical stability and unstability conditions of the solutions previously shown by the author (1994). This theoretical comparison could be applicable to mappings of many other combinatorial optimization problems

Keywords

Hopfield neural nets; combinatorial mathematics; convergence; optimisation; Hopfield networks; TSP; asymptotical instability conditions; asymptotical stability conditions; combinatorial optimization; traveling salesman problems; Asymptotic stability; Cities and towns; Constraint optimization; Coordinate measuring machines; Erbium; Hypercubes; Neurons; Traveling salesman problems;

fLanguage

English

Publisher

ieee

Conference_Titel

Neural Networks, 1995. Proceedings., IEEE International Conference on

Conference_Location

Perth, WA

Print_ISBN

0-7803-2768-3

Type

conf

DOI

10.1109/ICNN.1995.488870

Filename

488870