Competitive self-organization and combinatorial optimization

Applications to traveling salesman problem

Yasuo Matsuyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationIJCNN. International Joint Conference on Neural Networks
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages819-824
Number of pages6
Publication statusPublished - 1990
Externally publishedYes
Event1990 International Joint Conference on Neural Networks - IJCNN 90 Part 3 (of 3) - San Diego, CA, USA
Duration: 1990 Jun 171990 Jun 21

Other

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

Fingerprint

Traveling salesman problem
Combinatorial optimization
Simulated annealing
Neurons
Topology
Neural networks

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Matsuyama, Y. (1990). Competitive self-organization and combinatorial optimization: Applications to traveling salesman problem. In IJCNN. International Joint Conference on Neural Networks (pp. 819-824). Piscataway, NJ, United States: Publ by IEEE.

Competitive self-organization and combinatorial optimization : Applications to traveling salesman problem. / Matsuyama, Yasuo.

IJCNN. International Joint Conference on Neural Networks. Piscataway, NJ, United States : Publ by IEEE, 1990. p. 819-824.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Matsuyama, Y 1990, Competitive self-organization and combinatorial optimization: Applications to traveling salesman problem. in IJCNN. International Joint Conference on Neural Networks. Publ by IEEE, Piscataway, NJ, United States, pp. 819-824, 1990 International Joint Conference on Neural Networks - IJCNN 90 Part 3 (of 3), San Diego, CA, USA, 90/6/17.
Matsuyama Y. Competitive self-organization and combinatorial optimization: Applications to traveling salesman problem. In IJCNN. International Joint Conference on Neural Networks. Piscataway, NJ, United States: Publ by IEEE. 1990. p. 819-824
Matsuyama, Yasuo. / Competitive self-organization and combinatorial optimization : Applications to traveling salesman problem. IJCNN. International Joint Conference on Neural Networks. Piscataway, NJ, United States : Publ by IEEE, 1990. pp. 819-824
@inproceedings{c0fc8a2248aa45ee900bd7f91c8c13d8,
title = "Competitive self-organization and combinatorial optimization: Applications to traveling salesman problem",
abstract = "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.",
author = "Yasuo Matsuyama",
year = "1990",
language = "English",
pages = "819--824",
booktitle = "IJCNN. International Joint Conference on Neural Networks",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Competitive self-organization and combinatorial optimization

T2 - Applications to traveling salesman problem

AU - Matsuyama, Yasuo

PY - 1990

Y1 - 1990

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0025551359&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025551359&partnerID=8YFLogxK

M3 - Conference contribution

SP - 819

EP - 824

BT - IJCNN. International Joint Conference on Neural Networks

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -