Competitive self-organization and combinatorial optimization: Applications to traveling salesman problem

Yasuo Matsuyama

研究成果: Conference contribution

6 被引用数 (Scopus)

抄録

The author discusses algorithms of competitive self-organization and their application to a typical combinatorial problem, the traveling salesman problem. The main feature of the proposed algorithm is the sophisticated use of excitatory/inhibitory intralayer connections of neurons combined with a judicious selection of neural network topology. Such properties contribute to obtaining excellent approximate solutions. Five hundred sets of 30-city solutions are compared with those obtained by a pure simulated annealing method. From this comparison, it is found that a considerable number of the solutions obtained by this self-organization method are highly likely to be the optimal tours. Successive training algorithms are mainly used; however, applications of batch training algorithms are also discussed. Implications for multisalesman problems are discussed.

本文言語English
ホスト出版物のタイトルIJCNN. International Joint Conference on Neural Networks
Place of PublicationPiscataway, NJ, United States
出版社Publ by IEEE
ページ819-824
ページ数6
出版ステータスPublished - 1990
外部発表はい
イベント1990 International Joint Conference on Neural Networks - IJCNN 90 Part 3 (of 3) - San Diego, CA, USA
継続期間: 1990 6 171990 6 21

Other

Other1990 International Joint Conference on Neural Networks - IJCNN 90 Part 3 (of 3)
CitySan Diego, CA, USA
Period90/6/1790/6/21

ASJC Scopus subject areas

  • Engineering(all)

フィンガープリント 「Competitive self-organization and combinatorial optimization: Applications to traveling salesman problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル