Elastic Neural Nets for the Traveling Salesman Problem

Abstract

In order to speed up the standard Elastic Neural Net (ENN) [1] and make it robust against, local minima problem, we present three variants of the ENN, namely, the Modified ENN, the Double ENN and the Smooth ENN. The efficiency of the new algorithms is demonstrated and compared with some well-known classical algorithms on collections of cities with known optimal tours.