Chaotic noise and iterative simulated annealing for TSP

Tohru Kawabe, Tetsushi Ueta, Yoshifumi Nishio · 2003

We investigate the solving ability of TSP by using a Hopfield neural network with chaotic noise and iterative simulated annealing noise. From several numerical experiments, we can conclude that the ability of iterative simulated annealing noise is almost the same as chaotic noise in searching ability of a global minimum, and is superior to the chaotic noise in performance for detecting local minima.

Read the paper · More papers on PaperTik