An overall-regional competitive self-organizing map neural network for the Euclidean traveling salesman problem

2012 ◽  
Vol 89 ◽  
pp. 1-11 ◽  
Author(s):  
Junying Zhang ◽  
Xuerong Feng ◽  
Bin Zhou ◽  
Dechang Ren
Keyword(s):  
Neural Network ◽  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Self Organizing Map ◽  
Euclidean Traveling Salesman Problem ◽  
Self Organizing

An application of the self-organizing map in the non-Euclidean Traveling Salesman Problem

2011 ◽  
Vol 74 (5) ◽  
pp. 671-679 ◽  
Author(s):  
Jan Faigl ◽  
Miroslav Kulich ◽  
Vojtěch Vonásek ◽  
Libor Přeučil
Keyword(s):  
Traveling Salesman Problem ◽  
The Self ◽  
Traveling Salesman ◽  
Self Organizing Map ◽  
Euclidean Traveling Salesman Problem ◽  
Self Organizing

A Neural-Network-Based Approach to the Double Traveling Salesman Problem

2002 ◽  
Vol 14 (2) ◽  
pp. 437-471 ◽  
Author(s):  
Alessio Plebe ◽  
Angelo Marcello Anile
Keyword(s):  
Neural Network ◽  
Relaxation Process ◽  
Collision Avoidance ◽  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Real Problem ◽  
Self Organizing Map ◽  
Artificial Neurons ◽  
Harvesting Robot ◽  
Self Organizing

The double traveling salesman problem is a variation of the basic traveling salesman problem where targets can be reached by two salespersons operating in parallel. The real problem addressed by this work concerns the optimization of the harvest sequence for the two independent arms of a fruit-harvesting robot. This application poses further constraints, like a collision-avoidance function. The proposed solution is based on a self-organizing map structure, initialized with as many artificial neurons as the number of targets to be reached. One of the key components of the process is the combination of competitive relaxation with a mechanism for deleting and creating artificial neurons. Moreover, in the competitive relaxation process, information about the trajectory connecting the neurons is combined with the distance of neurons from the target. This strategy prevents tangles in the trajectory and collisions between the two tours. Results of tests indicate that the proposed approach is efficient and reliable for harvest sequence planning. Moreover, the enhancements added to the pure self-organizing map concept are of wider importance, as proved by a traveling salesman problem version of the program, simplified from the double version for comparison.

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