It is observed that animals often have to resolve difficult tasks of optimization and that this process can be studied by applying the formal framework of neural networks to a simple problem such as the Travelling Salesman Problem. Existing work is reviewed with particular emphasis on recent studies
The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem
✍ Scribed by N. Aras; B.J. Oommen; İ.K. Altınel
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 193 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0893-6080
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper we introduce a new self-organizing neural network, the Kohonen Network Incorporating Explicit Statistics (KNIES) that is based on Kohonen's Self-Organizing Map (SOM). The primary difference between the SOM and the KNIES is the fact that every iteration in the training phase includes two distinct modules-the attracting module and the dispersing module. As a result of the newly introduced dispersing module the neurons maintain the overall statistical properties of the data points. Thus, although in SOM the neurons individually find their places both statistically and topologically, in KNIES they collectively maintain their mean to be the mean of the data points, which they represent. Although the scheme as it is currently implemented maintains the mean as its invariant, the scheme can easily be generalized to maintain higher order central moments as invariants. The new scheme has been used to solve the Euclidean Travelling Salesman Problem (TSP). Experimental results for problems taken from TSPLIB [Reinelt, G. (1991). TSPLIB-A travelling salesman problem library. ORSA Journal on Computing, 3, indicate that it is a very accurate NN strategy for the TSP-probably the most accurate neural solutions available in the literature.
📜 SIMILAR VOLUMES
We present an application of the Kohonen algorithm to the traveling salesman problem: Using only this algorithm, without energy function nor any parameter chosen "ad hoc", we found good suboptimal tours. We give a neural model version of this algorithm, closer to classical neural networks. This is i
Motivated by implementing collective communication operations on workstation clusters, a problem of scheduling a dance party is formulated. The problem is solved by two algorithms based on searching and divide-and-conquer that generate suboptimal schedules and an algorithm based on graph factorizati
Neceaaary and su&%ient condition8 for the realization of 1088k38, tOWpaSS, ladder network8 terminated by a resietance are presented, in term.8 of the poles and zero8 of the resection coeficient. These condition8 yield explicit expre88ion.s for the element VdUe8. They are then extended to highpa netw