Solving traveling salesman problems using a parallel synchronized branch and bound algorithm | SpringerLink
Skip to main content
Springer Nature Link
Log in

Solving traveling salesman problems using a parallel synchronized branch and bound algorithm

  • Conference paper
  • First Online:
High-Performance Computing and Networking (HPCN-Europe 1996)

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

Included in the following conference series:

Abstract

In this paper we describe an efficient parallel synchronized branch and bound (PSBB) algorithm for distributed memory parallel computers. The parallelization of the sequential best-first branch and bound algorithm is based on the concept of alternating computation and synchronization steps. The computational steps simplify the problem to solve whereas the synchronization phases solve the problem of load balancing and data distribution. Experimental results show the efficiency of the proposed PSBB algorithm when solving traveling salesman problems on a massively parallel Cray T3D machine.

Supported by Swiss National Science Foundation grants SPP-IF 5003-034349 and SPP-IF 5003-034349/2 as well as the European Union Human Capital and Mobility project SCOOP.

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.

Similar content being viewed by others

References

  1. Cray Research, Cray T3D system architecture overview, Cray Research, Chippewa Falls, WI, Sep. 1993.

    Google Scholar 

  2. C. G. Diderich, M. Gengler, and S. Ubéda, An efficient algorithm for solving the token distribution problem on k-ary d-cube networks, Proc. ISPAN'94 (S. Horiguchi and D. F. Hsu, eds.), Dec. 1994.

    Google Scholar 

  3. M. R. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W. H. Freemand and Company, New York, NY, 1979.

    Google Scholar 

  4. A. Geist et al., PVM 3 user's guide and reference manual, Tech. Report ORLN/TM-12187, Oak Ridge National Laboratories, Oak Ridge, TE, May 1993.

    Google Scholar 

  5. M. Gengler and G. Coray, A parallel best-first branch and bound algorithm and its aximatization, Parallel Algo. and Appl. 2 (1994), 61–80.

    Google Scholar 

  6. E. L. Lawler et al. (eds.), The traveling salesman problem: a guided tour of combinatorial optimization, Wiley and Sons, Chichester, U.K., 1985.

    Google Scholar 

  7. L. Mitten, Branch and bound methods: General formulation and properties, Operations Research 18 (1970), 24–34.

    Google Scholar 

  8. G. Reinelt, TSPLIB — traveling salesman problems library, University of Augsburg, Germany. Available from softlib.rice.edu., 1990.

    Google Scholar 

  9. T. Volgenant and R. Jonker, The symmetric traveling salesman problem and edge exchanges in minimal 1-trees, European J. Oper. Res. 12 (1983), 394–403.

    Google Scholar 

  10. -, A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation, European J. Oper. Res. 9 (1992), 82–89.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Swiss Federal Inst. of Tech. - Lausanne, CH-1015, Lausanne, Switzerland

    Claude G. Diderich

  2. Labo. de l'Info, du Parallélisme, Ecole Normale Supérieure de Lyon, F-69364, Lyon, France

    Marc Gengler

Authors
  1. Claude G. Diderich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marc Gengler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Heather Liddell Adrian Colbrook Bob Hertzberger Peter Sloot

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Diderich, C.G., Gengler, M. (1996). Solving traveling salesman problems using a parallel synchronized branch and bound algorithm. In: Liddell, H., Colbrook, A., Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1996. Lecture Notes in Computer Science, vol 1067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61142-8_607

Download citation

  • DOI: https://doi.org/10.1007/3-540-61142-8_607

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61142-4

  • Online ISBN: 978-3-540-49955-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation