Skip to main content

A Memetic Algorithm for the Optimum Communication Spanning Tree Problem

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 4771)

Abstract

For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each pair of nodes routed over the tree. We present a memetic algorithm (MA) for this problem and focus our discussion on the evaluation of recombination operators for the OCST. The proposed algorithm outperforms evolutionary algorithms (EA) for known benchmark instances and outperforms state-of-the-art solvers for non-Euclidean instances.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-540-75514-2_13
  • Chapter length: 15 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   69.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-75514-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   89.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hu, T.C.: Optimum Communication Spanning Trees. SIAM Journal of Computing 3(3), 188–195 (1974)

    MATH  CrossRef  Google Scholar 

  2. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, CA, USA (1979)

    MATH  Google Scholar 

  3. Wu, B.Y., Chao, K.M., Tang, C.Y.: Approximation algorithms for some optimum communication spanning tree problems. Discr. Appl. Math. 102(3), 245–266 (2000)

    MATH  CrossRef  MathSciNet  Google Scholar 

  4. Ahuja, R.K., Murty, V.V.S.: Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem. Transp. Sci. 21(3), 163–170 (1987)

    MATH  MathSciNet  CrossRef  Google Scholar 

  5. Palmer, C.C., Kershenbaum, A.: Two Algorithms for Finding Optimal Communication Spanning Trees. Technical Report RC 19394, IBM T. J. Watson Research Center, Yorktown Heights, NY, USA (1994)

    Google Scholar 

  6. Palmer, C.C., Kershenbaum, A.: Representing trees in genetic algorithms. In: Proceedings of the First IEEE Conf. Evo. Comp., vol. 1, pp. 379–384 (1994)

    Google Scholar 

  7. Soak, S.M.: A New Evolutionary Approach for the Optimal Communication Spanning Tree Problem. E89–A(10), 2882–2893 (2006)

    Google Scholar 

  8. Bäck, T.: Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York (1996)

    MATH  Google Scholar 

  9. Hoos, H.H., Stützle, T.: Stochastic Local Search: Foundations and Applications. The Morgan Kaufmann Series in Artificial Intelligence. Morgan Kaufmann, San Francisco (2004)

    Google Scholar 

  10. Merz, P.: Memetic Algorithms for Combinatorial Optimization Problems: Fitness Landscapes and Effective Search Strategies. PhD thesis, University of Siegen, Germany, Siegen, Germany (2000)

    Google Scholar 

  11. Rothlauf, F., Gerstacker, J., Heinzl, A.: On the Optimal Communication Spanning Tree Problem. Working Papers in Information Systems 10/2003, University of Mannheim, Germany (2003)

    Google Scholar 

  12. Fischer, T.: Improved Local Search for Large Optimum Communication Spanning Tree Problems. In: MIC 2007. 7th Metaheuristics International Conference (2007)

    Google Scholar 

  13. Rothlauf, F., Heinzl, A.: Developing efficient metaheuristics for communication network problems by using problem-specific knowledge. Technical Report 9/2004, University of Mannheim, Germany (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fischer, T., Merz, P. (2007). A Memetic Algorithm for the Optimum Communication Spanning Tree Problem. In: , et al. Hybrid Metaheuristics. HM 2007. Lecture Notes in Computer Science, vol 4771. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75514-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-75514-2_13

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-75514-2

  • eBook Packages: Computer ScienceComputer Science (R0)