An efficient approach to the travelling salesman problem using self-organizing maps
Frederico Carvalho Vieira1, Adrião Duarte Dória Neto, José Alfredo Ferreira Costa
1Computer Engineering Department, Universidade Federal do Rio Grande do Norte, Natal-RN, 59072-970, Brazil. fred@dca.ufrn.br
Abstract:
This paper presents an approach to the well-known Travelling Salesman Problem (TSP) using Self-Organizing Maps (SOM). The SOM algorithm has interesting topological information about its neurons configuration on cartesian space, which can be used to solve optimization problems. Aspects of initialization, parameters adaptation, and complexity analysis of the proposed SOM based algorithm are discussed. The results show an average deviation of 3.7% from the optimal tour length for a set of 12 TSP instances.
Related Concept Videos
Self-Schemas
Area Computation by the Alternative Coordinate Method
Introduction to GIS
Manipulation and Analysis
Vectors in Space: Problem Solving
Vectors in 2D: Problem Solving


