A Self-Organising Neural Network for the Travelling Salesman Problem that is Competitive with Simulated Annealing
The Travelling Salesman Problem (TSP) has been studied for long times (see e.g. ) and, as for all NP-complete problems, all exact solutions take a time that can grow exponentially with the number of cities. Many heuristic algorithms exist for practical instances .
Unable to display preview. Download preview PDF.