Improving the Hopfield-Tank approach for the traveling salesman problem
M. Argollo de Menezes, T. J. P. Penna
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.
Create a lesson
Related papers
Multi-Fidelity Machine Learning for Predicting Startup Stress Growth and Strain Hardening in Wormlike Micellar Solutions
Saghar Zolfaghari, Nunzia Lauriello, Ilaria Cusano et al.
Non-equilibrium orientational dynamics of pinned topological defects in two-dimensional nematic liquid crystals
Petur Bryde, Jörn Dunkel
Thermodynamically consistent thixotropic viscoelastic modeling of human blood from a conformational free energy
Thomas Martinod, Andrés Córdoba, Jay D. Schieber
Effect of Small Particle Interactions on Assembly of Binary Colloidal Clusters
Dillip Kumar Mohapatra, Teun W. J. Verouden, Bos Everhardus Sprik et al.
Stationary distribution of active Brownian particles in a bounded domain
Alexandra Tzella, Daniel Loghin, David J. Needham et al.
Polarity-Programmed Topological Gating of Knotting in Spatially Patterned Active Polymers
Shiqi Zhou