An improved elastic net method for traveling salesman problem

In this article, we propose a new elastic net method to solve the traveling salesman problem by introducing some time-dependent parameters. This method can help network neurons move quickly near to the cities at early stage, and gradually increase the strength that pulls neurons towards their neighbours on the path to minimize the total path length. This enables the network to have superior ability of searching for cities, and converge sooner to a saturated state. Simulation results illustrate that the proposed network performs better than the classical elastic net for optimization both in solution quality and convergence speed.