DocumentCode :
3208218
Title :
An efficient approach of the SOM algorithm to the traveling salesman problem
Author :
Vieira, Frederico Carvalho ; Neto, Adrião Duarte Dória ; Costa, Jose Alfredo
fYear :
2002
fDate :
2002
Firstpage :
152
Abstract :
This paper presents an approach to the well-known traveling salesman problem (TSP) via competitive neural networks. The neural network model adopted in this work is the Kohonen network or self-organizing maps (SOM), which has important topological information about its neurons configuration. This paper is concerned with the initialization aspects, parameters adaptation, and the complexity analysis of the proposed algorithm. The modified SOM algorithm proposed in this paper has shown better results when compared with others neural network based approaches to the TSP.
Keywords :
computational complexity; mathematics computing; self-organising feature maps; travelling salesman problems; Kohonen network; SETSP; algorithm complexity; competitive neural networks; self-organizing maps; traveling salesman problem; Algorithm design and analysis; Automation; Cities and towns; Convergence; Intelligent systems; Joining processes; Neural networks; Neurons; Self organizing feature maps; Traveling salesman problems;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks, 2002. SBRN 2002. Proceedings. VII Brazilian Symposium on
Print_ISBN :
0-7695-1709-9
Type :
conf
DOI :
10.1109/SBRN.2002.1181459
Filename :
1181459
Link To Document :
بازگشت