I wrote this because I wanted to see whether a Hopfield network, with a little annealing, could shorten a tour. The note is “Solving The Travelling Salesmen Problem using HNN and HNN-SA algorithms” (arXiv:2202.13746), from February 2022.
Fig. 1A tangled tour through eleven dots shortens, one swap at a time, into the shortest loop. The tour is computed by a 2-opt search over these eleven points, not by the paper’s Hopfield network. The final loop is the optimal tour for them.
