Unsupervised learning applied to an unstructured neural network can give approximate solutions to the travelling salesman problem. For 50 cities in the plane this algorithm performs like the elastic net of Durbin and Willshaw [Durbin 1987] and it improves when increasing the number of cities to get better than simulated annealing for problems with more than 500 cities. In all the tests this algorithm requires a fraction of the time taken by simulated annealing.
A Self-Organising Neural Network for the Travelling Salesman Problem that is Competitive with Simulated Annealing
BUDINICH, MARCO
1996-01-01
Abstract
Unsupervised learning applied to an unstructured neural network can give approximate solutions to the travelling salesman problem. For 50 cities in the plane this algorithm performs like the elastic net of Durbin and Willshaw [Durbin 1987] and it improves when increasing the number of cities to get better than simulated annealing for problems with more than 500 cities. In all the tests this algorithm requires a fraction of the time taken by simulated annealing.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
