Improving the Hopfield-Tank approach for the traveling salesman problem

摘要

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