A distributed implementation of simulated annealing for the travelling salesman problem
The authors describe a novel implementation of the simulated annealing algorithm for finding an approximate solution of the travelling salesman problem. The implementation was on an array of Inmos T4/4 transputers, programmed in Occam 2. The authors claim they were able to compute solutions which appeared to be reasonably good to a problem of several thousand towns.
scientific article; zbMATH DE number 4113872