The DOI matches its Crossref record.
An Analysis of the Elastic Net Approach to the Traveling Salesman Problem
Abstract
This paper analyzes the elastic net approach (Durbin and Willshaw 1987) to the traveling salesman problem of finding the shortest path through a set of cities. The elastic net approach jointly minimizes the length of an arbitrary path in the plane and the distance between the path points and the cities. The tradeoff between these two requirements is controlled by a scale parameter K. A global minimum is found for large K, and is then tracked to a small value. In this paper, we show that (1) in the small K limit the elastic path passes arbitrarily close to all the cities, but that only one path point is attracted to each city, (2) in the large K limit the net lies at the center of the set of cities, and (3) at a critical value of K the energy function bifurcates. We also show that this method can be interpreted in terms of extremizing a probability distribution controlled by K. The minimum at a given K corresponds to the maximum a posteriori (MAP) Bayesian estimate of the tour under a natural statistical interpretation. The analysis presented in this paper gives us 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Feature extraction from faces using deformable templates
Yuille, A. L., Hallinan, P. W., & Cohen, D. S. (1992) · International Journal of Computer Vision · doi:10.1007/bf00127169 · Cited by 1,369
Self-citationYuille, A. L., & Rangarajan, A. (2003) · Neural Computation · doi:10.1162/08997660360581958 · Cited by 1,151
Self-citationFeature extraction from faces using deformable templates
Yuille, A. L., Cohen, D. S., & Hallinan, P. W. (2003) · Proceedings CVPR '89: IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1989.37836 · Cited by 708
Self-citationMetaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Choosing Mutation and Crossover Ratios for Genetic Algorithms—A Review with a New Dynamic Approach
Hassanat, A., Almohammadi, K., Alkafaween, E., Abunawas, E., Hammouri, A., & Prasath, V. B. S. (2019) · Information · doi:10.3390/info10120390 · Cited by 668
Metadata
- Authors
- Durbin, R., Szeliski, R., & Yuille, A.
- Venue
- Neural Computation
- Publisher
- MIT Press
- Published
- 1989-09
- Volume
- 1
- Issue
- 3
- Pages
- 348-358
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2084151718
- Cited by
- 184
- References
- 0
- FWCI
- 9.72
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Analysis of the Elastic Net Approach to the Traveling Salesman Problem. https://app.cochat.ai/papers/10.1162/neco.1989.1.3.348
- The paper
- Durbin, R., Szeliski, R., & Yuille, A. (1989). An Analysis of the Elastic Net Approach to the Traveling Salesman Problem. Neural Computation. https://doi.org/10.1162/neco.1989.1.3.348
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.