Efficient algorithm to solve the E-TSP

This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a non-deterministic iterative algorithm to solve the Euclidean Traveling Salesman Problem (E-TSP). It begins with a brief introduction to TSP and E-TSP. Then, it presents the proposed algorithm with its two major components: The convex-elastic net (CEN) algorithm and the non-deterministic iterative improvement (NII) algorithm. These two algorithms are combined into an algorithm called Efficient Convex-Elastic Net (ECEN) algorithm. Experimental results axe given to show that the proposed algorithm can find the nearly optimal solution for the E-TSP that outperform many similar algorithms reported in the literature. The paper concludes with the advantages of the new algorithm and possible extensions.