Skip to main content

A new self-organizing strategy based on elastic networks for solving the euclidean traveling salesman problem

  • 3 Machine Learning
  • Conference paper
  • First Online:
Tasks and Methods in Applied Artificial Intelligence (IEA/AIE 1998)

Abstract

This paper analyses the viability in use a self-organizing metaheuristic known as Elastic Network to solve the Euclidean Traveling Salesman Problem (ETSP). We propose a new hybrid approach based on Elastic Networks associated with a convex hull algorithm to solve the ETSP. In order to analyze our hybrid algorithm, one of the best Elastic Networks versions was also implemented. Experimental results show the quality of our algorithm is good.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boeres, M.C.S. and Carvalho, L.A.V.: A Faster Elastic Net Algorithm for the PCV. In Proc. of Int. Joint Conf. on Neural Networks, vol II, Baltimore MD (1992) 215–220.

    Google Scholar 

  2. Durbin, R., Szeliski, R. and Yuille, A.: An Analysis of the Elastic Net Approach to the Traveling Salesman Problem. Neural Computation 1 (1989) 348–358.

    Google Scholar 

  3. Durbin, R., and Willshaw, D.: An Analogue Approach to the Traveling Salesman Problem Using an Elastic Net Method. Nature 326 (1987) 689–691.

    Google Scholar 

  4. Gendreau, M., Laporte, G. and Potvin, J.Y.: Metaheuristics for the Vehicle Routing Problem. Publication CRT #963, Centre de Recherche sur les Transports, Universit de Montral (1994).

    Google Scholar 

  5. Graham, R.L.: An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set. In Info. Proc. Lett. 1 (1972) 132–133.

    Google Scholar 

  6. Lin, S. and Kernighan, B.: An Effective Heuristic Algorithm for the Traveling Salesman Problem. Operations Research 21 (1973) 489–516.

    Google Scholar 

  7. Potvin, J.Y.: The Traveling Salesman Problem: A Neural Network Perspective. ORSA Journal on Computing, Vol 5(4) (1993) 328–348.

    Google Scholar 

  8. Simic, P.D.: Constrained Nets for Graph Matching and Other (quadratic Assignment Problems. Neural Computation 3 (1991) 268–281.

    Google Scholar 

  9. Simmen, M.W.: Parameter Sensitivity of the Elastic Net Approach to the Traveling Salesman Problem, Neural Computation 3 (1991) 363–374.

    Google Scholar 

  10. Vakhutinsky, A.I. and Golden, B.L.: A Hierarchical Strategy for Solving Traveling Salesman Problems Using Elastic Nets (1995) (to appear in J. of Heuristics).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Angel Pasqual del Pobil José Mira Moonis Ali

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ochi, L.S., Maculan, N., Figueiredo, R.M.V. (1998). A new self-organizing strategy based on elastic networks for solving the euclidean traveling salesman problem. In: Pasqual del Pobil, A., Mira, J., Ali, M. (eds) Tasks and Methods in Applied Artificial Intelligence. IEA/AIE 1998. Lecture Notes in Computer Science, vol 1416. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64574-8_433

Download citation

  • DOI: https://doi.org/10.1007/3-540-64574-8_433

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64574-0

  • Online ISBN: 978-3-540-69350-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics