Skip to main content
SpringerLink
Log in

On the synergistic use of parallel exact solvers and heuristic/stochastic methods for combinatorial optimisation problems: A study case for the TSP on the Meiko CS-2

  • Posters
  • Conference paper
  • First Online:
Parallel Virtual Machine — EuroPVM '96 (EuroPVM 1996)

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

Included in the following conference series:

  • 156 Accesses

Abstract

This paper deals with the exact solutions of combinatorial optimisation problems. We describe a parallel implementation of a Branch and Bound algorithm; we complete such software with heuristic schemes and we show results with reference to the well known TSP problem. We evaluate the performance by introducing the concept of implementation efficiency that allows to estimate the communication overhead notwith-standing the over-search 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. Bruno, G., d'Acierno, A.: The Multi-Algorithmic Approach to Optimisation Problems, High-Performance Computing and Networking, Lecture Notes in Computer Science, 919, Springer, Berlin, 1995.

    Google Scholar 

  2. Carpaneto, G., Toth, P.: Some New Branching and Bounding Criteria for the Asymmetric Traveling Salesman Problem, Management Science, 26 (7), 1980.

    Google Scholar 

  3. Geist, G. A., Sanderam, V. S.: Network-Based Concurrent Computing on the PVM System, Concurrency: Practice and Experience, 4 (1992), 293–311.

    Google Scholar 

  4. Lai, T. H., Sahni., Anomalies in Parallel Branch and Bound Algorithms, Comm. of ACM, 27, 6, 1984.

    Google Scholar 

  5. Lai, T.H., Sprague, A.: Performance of Parallel Branch and Bound Algorithms, IEEE Trans. on Computers, C34, 10, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRSIP-CNR, Via P. Castellino 111, I-80131, Napoli

    Antonio d' Acierno & Salvatore Palma

Authors
  1. Antonio d' Acierno
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Salvatore Palma
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Arndt Bode Jack Dongarra Thomas Ludwig Vaidy Sunderam

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Acierno, A.d., Palma, S. (1996). On the synergistic use of parallel exact solvers and heuristic/stochastic methods for combinatorial optimisation problems: A study case for the TSP on the Meiko CS-2. In: Bode, A., Dongarra, J., Ludwig, T., Sunderam, V. (eds) Parallel Virtual Machine — EuroPVM '96. EuroPVM 1996. Lecture Notes in Computer Science, vol 1156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540617795_51

Download citation

  • DOI: https://doi.org/10.1007/3540617795_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61779-2

  • Online ISBN: 978-3-540-70741-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation