Skip to main content
SpringerLink
Log in

A hierarchical strategy for solving traveling salesman problems using elastic nets

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

In this article, we focus on implementing the elastic net method to solve the traveling salesman problem using a hierarchical approach. The result is a significant speed-up, which is studied both analytically and experimentally.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Boeres, M., Carvalho, L., and Barbosa, V. (1992). A faster elastic-net algorithm for the traveling salesman problem.Proceedings of the International Joint Conference on Neural Newtworks (pp. II-215–II-220). Baltimore, MD: IEEE Press.

    Google Scholar 

  • Durbin, R., Szeliski, R., and Yuille, A. (1989). An analysis of the elastic net approach to the traveling salesman problem.Neural Computation, 1, 348–358.

    Google Scholar 

  • Durbin, R., and Willshaw, D. (1987). An analogue approach to the traveling salesman problem using an elastic net method.Nature, 326, 689–691.

    Article  Google Scholar 

  • Karp, R. (1977). Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane.Mathematics of Operations Research 2, 209–224.

    Article  MATH  MathSciNet  Google Scholar 

  • Potvin, J.Y. (1993). The traveling salesman problem: A neural network perspective.ORSA Journal on Computing, 5, 328–348.

    MATH  Google Scholar 

  • Simmen, M.W. (1991). Parameter sensitivity of the elastic net approach to the traveling salesman problem.Neural Computation, 3, 363–374.

    Google Scholar 

  • Stein, D. (1977). Scheduling dial-a-ride transportation systems. Ph. D. dissertation, Harvard University.

  • Sun, T., Meakin, P., and Jossang, T. (1993). A fast optimization method based on a hierarchical strategy for the traveling salesman problem.Physica A, 199, 232–242.

    Article  MATH  Google Scholar 

  • Vakhutinsky, A., and Golden, B. (1994). Solving vehicle routing problems using elastic nets.Proceedings of the IEEE World Congress on Computational Intelligence (pp. 4535–4540). Orlando, FL: IEEE Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Business and Management, University of Maryland, 20742, College Park, MD

    Andrew I. Vakhutinsky & Bruce L. Golden

Authors
  1. Andrew I. Vakhutinsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bruce L. Golden
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vakhutinsky, A.I., Golden, B.L. A hierarchical strategy for solving traveling salesman problems using elastic nets. J Heuristics 1, 67–76 (1995). https://doi.org/10.1007/BF02430366

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02430366

Key Words

Search

Navigation