Skip to main content
SpringerLink
Log in

A Hybrid-Heuristics Algorithm for k-Minimum Spanning Tree Problems

  • Chapter
  • First Online:
IAENG Transactions on Engineering Technologies

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 186))

Abstract

A combinatorial optimization problem, namely k-Minimum Spanning Tree Problem (KMSTP), is to find a subtree with exactly k edges in an undirected graph G, such that the sum of edges’ weights is minimal. This chapter provides a Hybrid algorithm using Memetic Algorithm (MA) as a diversification strategy for Tabu Search (TS) to solve KMSTPs. The genetic operator in the proposed MA is based on dynamic programming, which efficiently finds the optimal subtree in a given tree. The experimental results show that the proposed algorithm is superior to several exiting algorithms in terms of solution accuracy and that the algorithm updates some best known solutions that were found by existing algorithms.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Hamacher HW, Jorsten K, Maffioli F (1991) Weighted k-cardinality trees. Technical report, Politecnico di Milano, Dipartimento di Elettronica, Italy

    Google Scholar 

  2. Hamacher HW, Jorsten K (1993) Optimal relinquishment according to the Norwegian petrol law: a combinatorial optimization approach. Technical report, no. 7/93, Norwegian School of Economics and Business Administration, Bergen, Norway

    Google Scholar 

  3. Ma B, Hero A, Gorman J, Michel O (2000), Image registration with minimum spanning tree algorithm. In: IEEE international conference on image processing

    Google Scholar 

  4. Fischetti M, Hamacher HW, Jornsten K, Maffioli F (1994) Weighted k-cardinality trees: complexity and polyhedral structure. Networks 24:11–21

    Article  MathSciNet  MATH  Google Scholar 

  5. Ravi D, Sundaram R, Marathe MV, Rosenkrantz DJ, Ravi SS (1996) Spanning trees-short or small. SIAM J Discrete Math 9(2):178–200

    Article  MathSciNet  MATH  Google Scholar 

  6. Maffioli F (1991) Finding a best subtree of a tree. Technical report, Politecnico di Milano, Dipartimento di Elettronica e Informazione

    Google Scholar 

  7. Quintaoa FP, da Cunha AS, Mateus GR, Lucena A (2010) The k-cardinality tree problem: reformulations and Lagrangian relaxation. Discrete Appl Math 158:1305–1314

    Article  MathSciNet  Google Scholar 

  8. Ehrgott M, Freitag J, Hamacher HW, MaLoli F (1997) Heuristics for the k-cardinality tree and subgraph problem. Asia–Pacific J Oper Res 14(1):87–114

    MathSciNet  MATH  Google Scholar 

  9. Urosevic D, Brimberg J, Mladenovic N (2004) Variable neighbourhood decomposition search for the edge weighted k-cardinality tree problem. Comput Oper Res 31:1205–1213

    Article  MathSciNet  MATH  Google Scholar 

  10. Blum C (2007) Revisiting dynamic programming for finding optimal subtrees in trees. Eur J Oper Res 177:102–115

    Article  MATH  Google Scholar 

  11. Blum C, Blesa M (2005) New metaheuristic approaches for the edge-weighted k-cardinality tree problem. Comput Oper Res 32:1355–1377

    Article  Google Scholar 

  12. Katagiri H, Hayashida T, Nishizaki I, Guo Q (2012) A hybrid algorithm based on tabu search and ant colony optimization for k-minimum spanning tree problems. Expert Syst Appl 39(5):5681–5686

    Article  Google Scholar 

  13. Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 5:533–549

    Article  MathSciNet  Google Scholar 

  14. Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, Dordrecht

    Book  MATH  Google Scholar 

  15. Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: toward memetic algorithms. Caltech concurrent computation program, CalTech, Pasadena, CA, Rep 826

    Google Scholar 

  16. Katagiri H, Hayashida T, Nishizaki I, Ishimatsu J (2010) An approximate solution method based on tabu search for k-minimum spanning tree problems. Int J Knowl Eng Soft Data Paradigms 2(3):263–274

    Article  Google Scholar 

  17. Guo Q, Katagiri H, Hayashida T, Nishizaki I (2012) A hybrid algorithm based on memetic algorithm and tabu search for k-minimum spanning tree problems. In: Lecture notes in engineering and computer science: proceedings of the international multiconference of engineers and computer scientists 2012, IMECS 2012, 14–16 March, 2012, Hong Kong, pp 1611–1616

    Google Scholar 

  18. A library for the edge-weighted k-cardinality tree problem (2003). http://iridia.ulb.ac.be/~cblum/kctlib/. Accessed 20 June 2012

Download references

Author information

Authors and Affiliations

  1. Department of System Cybernetics, Graduate School of Engineering, Hiroshima University, 4-1, Kagamiyama 1-chome, Higashi-Hiroshima, 739-8527, Japan

    Hideki Katagiri

  2. Graduate School of Engineering, Hiroshima University, 4-1, Kagamiyama 1-chome, Higashi-Hiroshima, 739-8527, Japan

    Qingqiang Guo

Authors
  1. Hideki Katagiri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qingqiang Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hideki Katagiri .

Editor information

Editors and Affiliations

  1. , Department of Multimedia Engineering, Mokpo National University, Dorim-ri, MuanGun 61, Chonnam, 534-729, Korea, Republic of (South Korea)

    Gi-Chul Yang

  2. , Unit 1, 1/F, International Association of Engineers, Hung To Road, Hong Kong, 37-39, Hong Kong SAR

    Sio-Iong Ao

  3. , Faculty of Information Sciences and Engi, University of Canberra, Building 11, Room A17, Bruce ACT, 2601, Australia

    Xu Huang

  4. , Calzada Tecnologico s/n, Tijuana Institute of Technology, Fracc. Tomas Aquino CP, Tijuana, 22379, Mexico

    Oscar Castillo

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Katagiri, H., Guo, Q. (2013). A Hybrid-Heuristics Algorithm for k-Minimum Spanning Tree Problems. In: Yang, GC., Ao, SI., Huang, X., Castillo, O. (eds) IAENG Transactions on Engineering Technologies. Lecture Notes in Electrical Engineering, vol 186. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-5651-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-94-007-5651-9_12

  • Published:

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-007-5623-6

  • Online ISBN: 978-94-007-5651-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation