An analogue approach to the travelling salesman problem using an elastic net method

  title={An analogue approach to the travelling salesman problem using an elastic net method},
  author={Richard Durbin and David J. Willshaw},
The travelling salesman problem1 is a classical problem in the field of combinatorial optimization, concerned with efficient methods for maximizing or minimizing a function of many independent variables. Given the positions of N cities, which in the simplest case lie in the plane, what is the shortest closed tour in which each city can be visited once? We describe how a parallel analogue algorithm, derived from a formal model2–3 for the establishment of topographically ordered projections in… 
Computation of the travelling salesman problem by a shrinking blob
This paper examines the insertion mechanism by which the blob constructs a tour, note some properties and limitations of its performance, and discusses the relationship between the blob TSP and proximity graphs which group points on the plane.
An elastic net method for solving the traveling salesman problem
The traveling salesman problem (TSP) is a prototypical problem of combinatorial optimization, and as such, it has been received considerable attention by neural-network researchers for seeking quick,
An Improved Discrete Neural Network Algorithm for the Traveling Salesman Problem
The simplest and most famous of the classical local optimization algorithms for the Traveling Salesman Problem (TSP) is the 2-opt move. In the implementation of this algorithm the running time
Global Minimum Elastic Net for the Euclidean Travelling Salesman Problem
This article proposes a variant of the Elastic Net that aims to reach the global minimum by reinitializing the neurons each time a local minimum is reached, which enables the network to explore a wider sub space of solutions.
A Neural-Network-Based Approach to the Double Traveling Salesman Problem
Results of tests indicate that the proposed approach is efficient and reliable for harvest sequence planning, and the enhancements added to the pure self-organizing map concept are of wider importance, as proved by a traveling salesman problem version of the program.
An Analysis of the Elastic Net Approach to the Traveling Salesman Problem
The analysis presented in this paper gives a better understanding of the behavior of the elastic net, allows us to better choose the parameters for the optimization, and suggests how to extend the underlying ideas to other domains.
The Optimal Elastic Net: Finding Solutions to the Travelling Salesman Problem
Abstract We introduce the optimal elastic net (OEN) method for finding solutions to the travelling salesman problem (TSP). The OEN method is related to the elastic net (EN) method[1]. The EN method
Solving the Traveling Salesman Problem Using Elastic Net Integrate with SOM
The traveling salesman problem (TSP) is a prototypical problem of combinatorial optimization and, as such, it has received considerable attention from neural-network researchers seeking quick,
Method to solve the travelling salesman problem using the inverse of diffusion process
The travelling salesman problem, in which the best route between cities to be visited is chosen from a large number of possible routes, is reconsidered using the time reversal of physical dynamics,
An improved elastic net method for the traveling salesman problem
  • D. Burr
  • Computer Science
    IEEE 1988 International Conference on Neural Networks
  • 1988
An elastic net method is presented for finding traveling-salesman tours; the method improves on the convergence properties of a recent model proposed by R. Durbin and D. Willshaw (1987) and produces either optimum tours or tours within a few percent of optimum.


An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem. The procedure is based on a general
The traveling salesman problem
This study tested human performance on a real and virtual floor, as well as in a threedimensional (3D) virtual space, and modeled these results by a graph pyramid algorithm, which suggests that deterioration of performance in the 3D space can be attributed to geometrical relations between hierarchical clustering in a3D space and coarse-to-fine production of a tour.
Optimization strategies gleaned from biological evolution
Computer algorithms are used to investigate new strategies for the 64-city travelling salesman problem, which combine conventional optimization or ‘quenching’ with biological elements, namely having a population of trial solutions, helping weaker individuals to survive, and an analogue of sexual crossing-over of genes.
Optimal numberings of an N N array
Given a numbering of the vertices of a graph, one can define the edgesum [6] as the sum of differences between adjacent vertices. The problem of finding numberings which are optimal in the sense of
The Euclidean Traveling Salesman Problem is NP-Complete
Abstract The Travelling Salesman Problem is shown to be NP-Complete even if its instances are restricted to be realizable by sets of points on the Euclidean plane.
Optimization by simulated annealing: Quantitative studies
Experimental studies of the simulated annealing method are presented and its computational efficiency when applied to graph partitioning and traveling salesman problems are presented.
A marker induction mechanism for the establishment of ordered neural mappings: its application to the retinotectal problem.
  • D. Willshaw, C. von der Malsburg
  • Computer Science, Medicine
    Philosophical transactions of the Royal Society of London. Series B, Biological sciences
  • 1979
This paper examines the idea that ordered patterns of nerve connections are set up by means of markers carried by the individual cells, and suggests that the results of many of the regeneration experiments are manifestations of a conflict between the two alternative ways of specifying the orientation of the map.
Visual-motor function of the primate superior colliculus.
The primate superior colliculus is emphasized because most of the work relating to movement has been done in the rhesus monkey, Macaca mulatta, and work done on the cat and tree shrew is drawn on to supplement areas as yet unexplored in the monkey, although many interesting facets of work on these and other species are not considered.
Optimization by Simulated Annealing
A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems.
Responses to visual stimulation and relationship between visual, auditory, and somatosensory inputs in mouse superior colliculus.
The superior colliculus was studied in anesthetized mice by recording from single cells and from unit clusters, suggesting that the entire visual field through one eye is represented on the contralateral superior Colliculus.