Improving the Hopfield-Tank approach for the traveling salesman problem

TL;DR

This paper enhances the Hopfield-Tank algorithm for the TSP by introducing a new dynamics, resulting in more efficient solutions with better quality and reduced computational time.

Contribution

It proposes a modified dynamics for the Hopfield-Tank algorithm, improving its efficiency and solution quality for the TSP.

Findings

Faster convergence to better solutions

Reduced computational time

Improved solution quality

Abstract

In this work we revisit the Hopfield-Tank algorithm for the traveling salesman problem (TSP) and report encouraging results, with a different dynamics, that makes the algorithm more efficient finding better solutions in much less computational time.