An efficient approach to the travelling salesman problem using self-organizing maps

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

Full description

Saved in:

Bibliographic Details
Published in:	International journal of neural systems Vol. 13; no. 2; p. 59
Main Authors:	Vieira, Frederico Carvalho, Dória Neto, Adrião Duarte, Costa, José Alfredo Ferreira
Format:	Journal Article
Language:	English
Published:	Singapore 01-04-2003
Subjects:	Algorithms Computer Simulation Humans Maps as Topic Neural Networks (Computer) Neurons - physiology Problem Solving Reproducibility of Results Travel
Online Access:	Get more information
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
ISSN:	0129-0657
DOI:	10.1142/S0129065703001443