Abstract
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). It combines the notion of symmetric forces described by the author in an earlier paper (1981) with an annealing schedule derived directly from the input data. The author demonstrates that the method converges about 50 times faster than the Durbin-Willshaw model on patterns of up to 50 cities. It produces either optimum tours or tours within a few percent of optimum. Several search strategies for larger problems are suggested.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Keywords
Travelling salesman problemSimulated annealingConvergence (economics)ScheduleMathematical optimizationComputer scienceElastic net regularizationNet (polyhedron)MathematicsAlgorithmArtificial intelligence
Related Publications
Performance evaluation of genetic algorithms for flowshop scheduling problems
The aim of this paper is to evaluate the performance of genetic algorithms for the flowshop scheduling problem with an objective of minimizing the makespan. First we examine var...
Matched filter performance bounds for diversity combining receivers in digital mobile radio
By employing the technique known as the matched filter bound, the authors derive analytical expressions for the distribution and average of the bit-error-rate in an ideal space ...
Optimum linear diversity receivers in digital cellular radio
The paper analyzes and quantifies the performance of a space diversity combining receiver operating in a digital cellular radio environment with quaternary phase shift keying (Q...
Optimum linear diversity receivers for mobile communications
This paper analyzes and quantifies the performance of a space diversity combining receiver operating in a mobile radio environment with quaternary phase-shift-keying transmissio...
Stochastic Petri net representation of discrete event simulations
In the context of discrete event simulation, the marking of a stochastic Petri net (SPN) corresponds to the state of the underlying stochastic process of the simulation and the ...
Publication Info
- Year
- 1988
- Type
- article
- Pages
- 69-76 vol.1
- Citations
- 37
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
37
OpenAlex
3
Influential
28
CrossRef
Cite This
Burr
(1988).
An improved elastic net method for the traveling salesman problem.
IEEE International Conference on Neural Networks
, 69-76 vol.1.
https://doi.org/10.1109/icnn.1988.23830
Identifiers
- DOI
- 10.1109/icnn.1988.23830