English

Improving the Hopfield-Tank approach for the traveling salesman problem

Soft Condensed Matter 2009-10-30 v1 Disordered Systems and Neural Networks

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.

Keywords

Cite

@article{arxiv.cond-mat/9709062,
  title  = {Improving the Hopfield-Tank approach for the traveling salesman problem},
  author = {M. Argollo de Menezes and T. J. P. Penna},
  journal= {arXiv preprint arXiv:cond-mat/9709062},
  year   = {2009}
}

Comments

7 pages, 4 PS figures. Related papers at http://www.if.uff.br/~tjpp