Name
Abstract | ||
|---|---|---|
1. Purpose 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 (1). |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1109/SBRN.2002.1181459 | SBRN |
Keywords | Field | DocType |
som algorithm,efficient approach,salesman problem,algorithm design and analysis,computational complexity,convergence,intelligent systems,neural network model,traveling salesman problem,automation,kohonen network,neural networks,self organizing maps,neural network | Bottleneck traveling salesman problem,Topological information,Computer science,Algorithm,Self-organizing map,Travelling salesman problem,Artificial intelligence,2-opt,Initialization,Artificial neural network,Machine learning,Computational complexity theory | Conference |
ISBN | Citations | PageRank |
0-7695-1709-9 | 1 | 0.39 |
References | Authors | |
2 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frederico Carvalho Vieira | 1 | 11 | 0.99 |
| Adrião Duarte Dória Neto | 2 | 84 | 15.21 |
| José Alfredo F. Costa | 3 | 52 | 10.11 |