A new approach to solve the traveling salesman problem by using the improved Kohonen's self-organizing feature map

2002 ◽  
Author(s):  
K. Kitaori ◽  
H. Murakoshi ◽  
N. Funakubo
Keyword(s):  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
New Approach ◽  
Feature Map ◽  
The Traveling Salesman Problem ◽  
Self Organizing

Evolving Ant Colony Optimization

1998 ◽  
Vol 01 (02n03) ◽  
pp. 149-159 ◽  
Author(s):  
Hozefa M. Botee ◽  
Eric Bonabeau
Keyword(s):  
Genetic Algorithm ◽  
Combinatorial Optimization ◽  
Ant Colony Optimization ◽  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Ant Colony ◽  
New Approach ◽  
The Traveling Salesman Problem

Ant Colony Optimization (ACO) is a promising new approach to combinatorial optimization. Here ACO is applied to the traveling salesman problem (TSP). Using a genetic algorithm (GA) to find the best set of parameters, we demonstrate the good performance of ACO in finding good solutions to the TSP.

scholarly journals A Self-Organizing Neural Network for the Traveling Salesman Problem That Is Competitive with Simulated Annealing

1996 ◽  
Vol 8 (2) ◽  
pp. 416-424 ◽  
Author(s):  
Marco Budinich
Keyword(s):  
Neural Network ◽  
Simulated Annealing ◽  
Unsupervised Learning ◽  
Traveling Salesman Problem ◽  
Approximate Solutions ◽  
Elastic Net ◽  
Traveling Salesman ◽  
The Traveling Salesman Problem ◽  
Better Than ◽  
Self Organizing

Unsupervised learning applied to an unstructured neural network can give approximate solutions to the traveling salesman problem. For 50 cities in the plane this algorithm performs like the elastic net of Durbin and Willshaw (1987) and it improves when increasing the number of cities to get better than simulated annealing for problems with more than 500 cities. In all the tests this algorithm requires a fraction of the time taken by simulated annealing.

scholarly journals Enhanced Self-Organizing Map Solution for the Traveling Salesman Problem

2021 ◽  
Author(s):  
Joao P. A. Dantas ◽  
Andre N. Costa ◽  
Marcos R. O. A. Maximo ◽  
Takashi Yoneyama
Keyword(s):  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Self Organizing Map ◽  
The Traveling Salesman Problem ◽  
Map Solution ◽  
Self Organizing

Usando um método aprimorado de Mapa Auto-Organizável, fornecemos soluções abaixo do ideal para o Problema do Caixeiro Viajante. Além disso, empregamos o ajuste de hiperparâmetros para identificar os recursos mais críticos do algoritmo. Todas as melhorias no trabalho de benchmark trouxeram resultados consistentes e podem inspirar esforços futuros para melhorar este algoritmo e aplicá-lo a diferentes problemas.

Sign in / Sign up

Export Citation Format

Share Document