An analogue approach to the travelling salesman problem using an elastic net method
Explore this paper's citation graph
Summary
This work describes how a parallel analogue algorithm, derived from a formal model for the establishment of topographically ordered projections in the brain, can be applied to the travelling salesman problem, and produces shorter tour lengths than another recent parallel analogue algorithms.
- Type
- article
- Published
- 1987-04-16
- Cited by
- 896
- References
- 18
- OpenAlex
- https://openalex.org/W2051719061
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:4321691
Keywords
Travelling salesman problem, Elastic net regularization, Computer science, Net (polyhedron), Mathematical optimization
References
- The formation of nerve connections
- Optimal numberings of an N N array
- Anatomy and physiology of experimentally produced striped tecta
- Responses to visual stimulation and relationship between visual, auditory, and somatosensory inputs in mouse superior colliculus.
- A neural map of auditory space in the owl.
- Compound eyes project stripes on the optic tectum in Xenopus
- A marker induction mechanism for the establishment of ordered neural mappings: its application to the retinotectal problem.
- Optimization by simulated annealing: Quantitative studies
- Optimization strategies gleaned from biological evolution
- Optimization by Simulated Annealing
- Physiological Studies on Neural Mechanisms of Visual Localization and Discrimination
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Visual-motor function of the primate superior colliculus.
- Introduction to linear and nonlinear programming
- How to label nerve cells so that they can interconnect in an ordered fashion.
- The Euclidean travelling salesman problem is NP-complete
- The formation of nerve connections
- The Euclidean Traveling Salesman Problem is NP-Complete
- The traveling salesman problem
Cited by
- Modelos neuronales competitivos: Kohonen & ART
- On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms
- Bayesian Inference on Visual Grammars by Neural Nets that Optimize
- Parallel Learning Model and Topological Measurement for Self-Organizing Maps
- Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation
- Modified Self-organizing Maps for Line Extraction in Digitized Text Documents
- Psychological approaches to data visualisation
- Field-Theoretic Methods for Intractable Probabilistic Models
- The Traveling Salesman Problem: A Case Study in Local Optimization
- Small nets and short paths : optimising neural computation
- Modelling the development of the retinogeniculate pathway
- Design space reduction in optimization using generative topographic mapping
- Hardware architecture for Kohonen network
- Neural networks for the N-Queens Problem : a review
- Self-organizing Maps
- Non-Rigid Sheet Metal Assembly Simulation and Selection of the Geo-Spots for Further Optimization
- Dynamic point relocation: An enhancement for traveling salesman problem initial tour construction procedures
- Zastosowanie zmodyfikowanej sieci Hopfielda w problemie komiwojażera
- Resource Allocation with Potts Mean Field Neural Network Techniques
- Neural network models for combinatorial optimization: a survey of deterministic, stochastic and chaotic approaches
Related papers
- A study on bias effect of elastic net penalized regression for model selection
- Design of plastic waste classifier using Elastic Net : Comparative Studies
- Regularization and Variable Selection Via the Elastic Net
- The reciprocal elastic net
- A Robust Variable Selection Method for Sparse Online Regression via the Elastic Net Penalty
- Exploiting Covariate Similarity in Sparse Regression via the Pairwise Elastic Net
- Elastic Gradient Descent, an Iterative Optimization Method Approximating the Solution Paths of the Elastic Net
- Solution of Traveling Salesman Problem with Hotel Selection in the framework of MILP-tropical optimization
- A hierarchical strategy for solving traveling salesman problems using elastic nets