Skip to main content
SpringerLink
Log in

A new algorithm for the traveling salesman problem on networked workstations

  • Conference paper
  • First Online:
Parallel Scientific Computing (PARA 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 879))

Included in the following conference series:

  • 148 Accesses

Abstract

In this paper we present a new parallel algorithm for solving traveling salesman problem (TSP). Our algorithm is based on a local optimization method and it was implemented on networked workstations using PVM. The obtained efficiency is 70% on 6 × SUN SPARCstation IPX. It is shown that networked workstations can be efficiently used for solving TSP problem.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Garey, M.R., Johnson, D.S., “Computers and intractability: a guide to the theory of NP-completess”, W.H. Freeman, San Francisco, 1979.

    Google Scholar 

  2. Lenstra, J.K., Rinnooy Kan, A.H.G.,“Some Simple Application of the Traveling Salesman Problem”, Oper. Res 26, 717–733, (1975).

    Google Scholar 

  3. Laporte, G., “The Traveling Salesman Problem: An overview of exact and approximate algorithms”, European Journal of Operational Research, 59, (1992) 231–247.

    Google Scholar 

  4. Christofides, N., “The traveling salesman problem — survey”, Tech. Rep., Imperial Collage, London, 1980

    Google Scholar 

  5. Sunderam, V.S., “PVM: a framework for parallel distributed computing”, Concurrency: Practice and Experience, 2 (1990) 315–339.

    Google Scholar 

  6. Geist, A. Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., and Sunderam, V., “PVM 3.0 A users' guide and reference manual”, ORNL/TM-12187, USA (February, 1993).

    Google Scholar 

  7. G. Reinelt, TSPLIB 1.0, Contact: bixby@rice.edu.

    Google Scholar 

  8. Lin, S., “Computer solution of the traveling salesman problem”, The Bell System Technical Journal, December 1965, 2245–2269.

    Google Scholar 

  9. Dueck, G., Sheuler, T., “Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anniealing”, Journal of Computational Physics, 90 (1990) 161–175.

    Google Scholar 

  10. Lin, S., Kernighan, B.W., “An effective heuristic algorithm for the traveling salesman problem”, Oper. Res. 21, 498–516 (1973).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, AGH, al. Mickiewicza 30, 30-059, Cracow, Poland

    M. Gajecki & J. Mościński

Authors
  1. M. Gajecki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Mościński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jack Dongarra Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gajecki, M., Mościński, J. (1994). A new algorithm for the traveling salesman problem on networked workstations. In: Dongarra, J., Waśniewski, J. (eds) Parallel Scientific Computing. PARA 1994. Lecture Notes in Computer Science, vol 879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030151

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58712-5

  • Online ISBN: 978-3-540-49050-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation