Improving the Hopfield-Tank approach for the traveling salesman problem
arXiv:cond-mat/9709062 · doi:10.1142/S0129183197000965
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.
arXiv comment7 pages, 4 PS figures. Related papers at http://www.if.uff.br/~tjpp