Skip to main content
SpringerLink
Log in

A Variable Neighborhood Search Algorithm for Solving the Steiner Minimal Tree Problem

  • Conference paper
  • First Online:
Context-Aware Systems and Applications, and Nature of Computation and Communication (ICCASA 2018, ICTCC 2018)

Abstract

Steiner Minimal Tree (SMT) is a complex optimization problem that has many important applications in science and technology; This is a NP-hard problem. Much research has been carried out to solve the SMT problem using approximate algorithms. This paper presents a variable neighborhood search (VNS) algorithm for solving the SMT problem; The proposed algorithm has been tested on sparse graphs in a standardized experimental data system, and it yields better results than some other heuristic 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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Koster, A., Munoz, X.: Graphs and Algorithms in Communication Networks. Springer, Heidelberg (2010)

    Book  Google Scholar 

  2. Wu, B.Y., Chao, K.: Spanning Trees and Optimization Problems. Chapman & Hall/CRC, Boca Raton (2004). pp. 158–165

    Book  Google Scholar 

  3. Lu, C.L., Tang, C.Y.: The Full Steiner Tree Problem. Elsevier (2003). pp. 55–67

    Google Scholar 

  4. Una, D.D., Gange, G., Schachte, P., Stuckey, P.J.: Steiner tree problems with side constraints using constraint programming. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (2016)

    Google Scholar 

  5. Beasley, J.E.: OR-Library: http://people.brunel.ac.uk/~mastjjb/jeb/orlib/steininfo.html. Accessed 2018

  6. Laarhoven, J.W.V.: Exact and heuristic algorithms for the Euclidean Steiner tree problem. University of Iowa, Doctoral thesis (2010)

    Google Scholar 

  7. Caleffi, M., Akyildiz, I.F., Paura, L.: On the solution of the steiner tree NP-Hard Problem via Physarum BioNetwork, pp. 1092–1106. IEEE (2015)

    Google Scholar 

  8. Hauptmann, M., Karpinski, M.: A compendium on steiner tree problems, pp. 1–36 (2015)

    Google Scholar 

  9. Hougardy, S., Silvanus, J., Vygen, J.: Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm. University of Bonn (2015)

    Google Scholar 

  10. Bosman, T.: A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions, pp. 1–12. VU University Amsterdam, Netherlands (2015)

    Google Scholar 

  11. Cheng, X., Du, D.Z.: Steiner Trees in Industry, vol. 5, pp. 193–216. Kluwer Academic Publishers (2004)

    Google Scholar 

  12. Martins, S.L., Resende, M.G.C., Ribeiro, C.C., Pardalos, P.M.: A parallel grasp for the steiner tree problem in graphs using a hybrid local search strategy (1999)

    Google Scholar 

  13. Uchoa, E., Werneck, R.F.: Fast Local Search for Steiner Trees in Graphs (2010)

    Google Scholar 

  14. Ribeiro, C.C., Mauricio, C., Souza, D.: Tabu search for the steiner problem in graphs. Networks 36, 138–146 (2000)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Center for Information Technology and Communication, 284 Tran Hung Dao Street, Ca Mau City, Vietnam

    Tran Viet Chuong

  2. Research Institute of Posts and Telecommunications (RIPT), 122 Hoang Quoc Viet Street, Ha Noi City, Vietnam

    Ha Hai Nam

Authors
  1. Tran Viet Chuong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ha Hai Nam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tran Viet Chuong .

Editor information

Editors and Affiliations

  1. Nguyen Tat Thanh University, Ho Chi Minh City, Vietnam

    Phan Cong Vinh

  2. Concordia University, Montreal, QC, Canada

    Vangalur Alagar

Rights and permissions

Reprints and permissions

Copyright information

© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chuong, T.V., Nam, H.H. (2019). A Variable Neighborhood Search Algorithm for Solving the Steiner Minimal Tree Problem. In: Cong Vinh, P., Alagar, V. (eds) Context-Aware Systems and Applications, and Nature of Computation and Communication. ICCASA ICTCC 2018 2018. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 266. Springer, Cham. https://doi.org/10.1007/978-3-030-06152-4_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-06152-4_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-06151-7

  • Online ISBN: 978-3-030-06152-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation