Solving the Travelling Salesman Problem using the Kohonen Network Incorporating Explicit Statistics
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. The new scheme has been used to solve the Travelling Salesman Problem (TSP). Experimental results for problems taken from TSPLIB  indicate that it is a very accurate NN strategy for the TSP — probably the most accurate neural solutions available in the literature.
KeywordsMigration Hull Lution
Unable to display preview. Download preview PDF.
- N. Aras, B. J. Oommen and Altmel, İ K., (1997), “The Kohonen Network Incorporating Explicit Statistics and Its Application to the Traveling Salesman Problem”. Unabridged version of this paper.Google Scholar
- Kohonen, T., (1995), Self-Organizing Maps, Springer-Verlag, Berlin.Google Scholar
- Lawler, E. L., J. K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, (1985), The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, Chichester.Google Scholar
- Reinelt, G., (1991), “TSPLIB—A Travelling Salesman Problem Library”, ORSA Journal on Computing 3, pp. 376–384.Google Scholar
- Reinelt, G., (1994), The Travelling Salesman. Computational Solutions for TSP Applications, Springer-Verlag, Berlin.Google Scholar