Self-ogranizing neural networks and various euclidean traveling salesman problems

Yasuo Matsuyama

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

By using competitive learning, which causes just one or a group of a small number of neurons to respond to a given input, self-organization of entire neural networks can be achieved. When this self-organization process is applied to various kinds of traveling salesman problems in a Euclidean space, a good approximation or the true solution is obtained. We use a sequential update which looks at the position vector of each city one at a time as the training method for a neural network arranged as a closed loop. In this case, we use symmetrical connections between neurons. The number of neurons required is approximately linear in the number of cities. In the first experiment, we carried out a quantitative comparison with the simulated annealing method using 500 sets of 30 cities and demonstrated this method's superiority. Next, we obtained a good approximation on a set of 532 U.S. cities and demonstrate its superiority with respect to the increase in the number of cities in actual (realistic) data. Further for a generalized constrained multiple-salesman problem, we explain this method's compactness and efficiency and give an experimental example. The computation can be adequately performed by a common workstation with a serial processor.

Original languageEnglish
Pages (from-to)101-112
Number of pages12
JournalSystems and Computers in Japan
Volume23
Issue number2
Publication statusPublished - 1992
Externally publishedYes

Fingerprint

Traveling salesman problem
Travelling salesman problems
Neurons
Euclidean
Neural Networks
Neural networks
Neuron
Self-organization
Simulated annealing
Position vector
Competitive Learning
Approximation
Use Case
Simulated Annealing
Closed-loop
Compactness
Euclidean space
Update
Entire
Experiments

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Information Systems
  • Theoretical Computer Science

Cite this

Self-ogranizing neural networks and various euclidean traveling salesman problems. / Matsuyama, Yasuo.

In: Systems and Computers in Japan, Vol. 23, No. 2, 1992, p. 101-112.

Research output: Contribution to journalArticle

@article{4e9360b0b8c24cba82e907f654dbfbf6,
title = "Self-ogranizing neural networks and various euclidean traveling salesman problems",
abstract = "By using competitive learning, which causes just one or a group of a small number of neurons to respond to a given input, self-organization of entire neural networks can be achieved. When this self-organization process is applied to various kinds of traveling salesman problems in a Euclidean space, a good approximation or the true solution is obtained. We use a sequential update which looks at the position vector of each city one at a time as the training method for a neural network arranged as a closed loop. In this case, we use symmetrical connections between neurons. The number of neurons required is approximately linear in the number of cities. In the first experiment, we carried out a quantitative comparison with the simulated annealing method using 500 sets of 30 cities and demonstrated this method's superiority. Next, we obtained a good approximation on a set of 532 U.S. cities and demonstrate its superiority with respect to the increase in the number of cities in actual (realistic) data. Further for a generalized constrained multiple-salesman problem, we explain this method's compactness and efficiency and give an experimental example. The computation can be adequately performed by a common workstation with a serial processor.",
author = "Yasuo Matsuyama",
year = "1992",
language = "English",
volume = "23",
pages = "101--112",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "2",

}

TY - JOUR

T1 - Self-ogranizing neural networks and various euclidean traveling salesman problems

AU - Matsuyama, Yasuo

PY - 1992

Y1 - 1992

N2 - By using competitive learning, which causes just one or a group of a small number of neurons to respond to a given input, self-organization of entire neural networks can be achieved. When this self-organization process is applied to various kinds of traveling salesman problems in a Euclidean space, a good approximation or the true solution is obtained. We use a sequential update which looks at the position vector of each city one at a time as the training method for a neural network arranged as a closed loop. In this case, we use symmetrical connections between neurons. The number of neurons required is approximately linear in the number of cities. In the first experiment, we carried out a quantitative comparison with the simulated annealing method using 500 sets of 30 cities and demonstrated this method's superiority. Next, we obtained a good approximation on a set of 532 U.S. cities and demonstrate its superiority with respect to the increase in the number of cities in actual (realistic) data. Further for a generalized constrained multiple-salesman problem, we explain this method's compactness and efficiency and give an experimental example. The computation can be adequately performed by a common workstation with a serial processor.

AB - By using competitive learning, which causes just one or a group of a small number of neurons to respond to a given input, self-organization of entire neural networks can be achieved. When this self-organization process is applied to various kinds of traveling salesman problems in a Euclidean space, a good approximation or the true solution is obtained. We use a sequential update which looks at the position vector of each city one at a time as the training method for a neural network arranged as a closed loop. In this case, we use symmetrical connections between neurons. The number of neurons required is approximately linear in the number of cities. In the first experiment, we carried out a quantitative comparison with the simulated annealing method using 500 sets of 30 cities and demonstrated this method's superiority. Next, we obtained a good approximation on a set of 532 U.S. cities and demonstrate its superiority with respect to the increase in the number of cities in actual (realistic) data. Further for a generalized constrained multiple-salesman problem, we explain this method's compactness and efficiency and give an experimental example. The computation can be adequately performed by a common workstation with a serial processor.

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

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

M3 - Article

AN - SCOPUS:0026743862

VL - 23

SP - 101

EP - 112

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 2

ER -