Parallel mean field annealing neural network for solving traveling salesman problem

The authors propose a parallel mean field annealing (MFA) algorithm and a new energy function for finding traveling salesman optimal tours. The proposed parallel MFA neural network has the advantages of a simplified energy function, and that it converges more rapidly to an optimal solution. The experimental results showed that the parallel MFA and the new energy function can generate the optimal solution.<
>