Improving the Hopfield–Tank Approach for the Traveling Salesman Problem

M. Argollo de Menezes () and T. J. P. Penna ()
Additional contact information
M. Argollo de Menezes: Instituto de Fisica, Universidade Federal Fluminense, Av. Litorânea s/n, 24210-340, Niterói, RJ, Brasil
T. J. P. Penna: Instituto de Fisica, Universidade Federal Fluminense, Av. Litorânea s/n, 24210-340, Niterói, RJ, Brasil

International Journal of Modern Physics C (IJMPC), 1997, vol. 08, issue 05, 1095-1102

Abstract: 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.

Keywords: Neural Networks; Optimization Problems; Traveling Salesman Problem; Kawasaki Dynamics (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183197000965
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:08:y:1997:i:05:n:s0129183197000965

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183197000965

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().