An efficient approach of the SOM algorithm to the traveling salesman problem

摘要

The results obtained have shown the power of the SETSP and a superior quality when compared with others neural network based approaches [1]. The SETSP is well suited for larger instances of the TSP since it has a fast convergence (about 30 iterations) and low complexity.