Advertisement

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

  • Tran Viet ChuongEmail author
  • Ha Hai Nam
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 266)

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.

Keywords

Minimal tree Sparse graph Variable neighborhood search algorithm Metaheuristic algorithm Steiner minimal tree 

References

  1. 1.
    Koster, A., Munoz, X.: Graphs and Algorithms in Communication Networks. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  2. 2.
    Wu, B.Y., Chao, K.: Spanning Trees and Optimization Problems. Chapman & Hall/CRC, Boca Raton (2004). pp. 158–165CrossRefGoogle Scholar
  3. 3.
    Lu, C.L., Tang, C.Y.: The Full Steiner Tree Problem. Elsevier (2003). pp. 55–67Google Scholar
  4. 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. 5.
    Beasley, J.E.: OR-Library: http://people.brunel.ac.uk/~mastjjb/jeb/orlib/steininfo.html. Accessed 2018
  6. 6.
    Laarhoven, J.W.V.: Exact and heuristic algorithms for the Euclidean Steiner tree problem. University of Iowa, Doctoral thesis (2010)Google Scholar
  7. 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. 8.
    Hauptmann, M., Karpinski, M.: A compendium on steiner tree problems, pp. 1–36 (2015)Google Scholar
  9. 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. 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. 11.
    Cheng, X., Du, D.Z.: Steiner Trees in Industry, vol. 5, pp. 193–216. Kluwer Academic Publishers (2004)Google Scholar
  12. 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. 13.
    Uchoa, E., Werneck, R.F.: Fast Local Search for Steiner Trees in Graphs (2010)Google Scholar
  14. 14.
    Ribeiro, C.C., Mauricio, C., Souza, D.: Tabu search for the steiner problem in graphs. Networks 36, 138–146 (2000)MathSciNetCrossRefGoogle Scholar

Copyright information

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

Authors and Affiliations

  1. 1.The Center for Information Technology and CommunicationCa Mau CityVietnam
  2. 2.Research Institute of Posts and Telecommunications (RIPT)Ha Noi CityVietnam

Personalised recommendations