A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing

Authors:
Marco Budinich
Affiliations:
Center for Neural Networks, Kings's College London, London, U.K.
Venue:
Neural Computation
Year:
1996

Citing 4
Cited 11

Self-organization and associative memory: 3rd edition

Self-organization and associative memory: 3rd edition
Local optimization and the traveling salesman problem

Proceedings of the seventeenth international colloquium on Automata, languages and programming
Neural networks: an introduction

Neural networks: an introduction
On the ordering conditions for self-organizing maps

Neural Computation

The co-adaptive neural network approach to the Euclidean travelling salesman problem

Neural Networks
A new approach to solve the traveling salesman problem

Neurocomputing
A New Hybrid Ant Colony Optimization Algorithm for the Traveling Salesman Problem

ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
A memetic neural network for the Euclidean traveling salesman problem

Neurocomputing
Improved Clonal Selection Algorithm Combined with Ant Colony Optimization

IEICE - Transactions on Information and Systems
An application of the self-organizing map in the non-Euclidean Traveling Salesman Problem

Neurocomputing
On the performance of self-organizing maps for the non-Euclidean Traveling Salesman Problem in the polygonal domain

Information Sciences: an International Journal
A new neural network approach to the traveling salesman problem

ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part I
An improved multi-agent approach for solving large traveling salesman problem

PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
An overall-regional competitive self-organizing map neural network for the Euclidean traveling salesman problem

Neurocomputing
A neural network model for currency arbitrage detection

ISNN'12 Proceedings of the 9th international conference on Advances in Neural Networks - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unsupervised learning applied to an unstructured neural network can give approximate solutions to the traveling salesman problem. For 50 cities in the plane this algorithm performs like the elastic net of Durbin and Willshaw (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.