A new self-organizing strategy based on elastic networks for solving the euclidean traveling salesman problem

Abstract

This paper analyses the viability in use a self-organizing metaheuristic known as Elastic Network to solve the Euclidean Traveling Salesman Problem (ETSP). We propose a new hybrid approach based on Elastic Networks associated with a convex hull algorithm to solve the ETSP. In order to analyze our hybrid algorithm, one of the best Elastic Networks versions was also implemented. Experimental results show the quality of our algorithm is good.KeywordsConvex HullTravel Salesman ProblemTravel Salesman ProblemCircular RingQuadratic Assignment ProblemThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.