Optimizing Least-Cost Steiner Tree in Graphs via an Encoding-Free Genetic Algorithm

  • Qing LiuEmail author
  • Rongjun Tang
  • Jingyan Kang
  • Junliang Yao
  • Wenqing Wang
  • Yali Wu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10385)


Most bio-inspired algorithms for solving the Steiner tree problem (STP) require the procedures of encoding and decoding. The frequent operations on both encoding and decoding inevitably result in serious time consumption and extra memory overhead, and then reduced the algorithms’ practicability. If a bio-inspired algorithm is encoding-free, its practicability will be improved. Being motivated by this thinking, this article presents an encoding-free genetic algorithm in solving the STP. To verify our proposed algorithm’s validity and investigate its performance, detailed simulations were carried out. Some insights in this article may also have significance for reference when solving the other problems related to the topological optimization.


Steiner tree problem Genetic algorithm Encoding-free Tree-based genotype 



This research is supported in part by National Science Foundation of China (No. 61502385, No. 61401354, No. 61503299), Key Basic Research Fund of Shaanxi Province (2016JQ6015), and Scientific Research Program Funded by Shaanxi Provincial Education Department (No. 16JK1554).


  1. 1.
    Liu, Q., Odaka, T., Kuroiwa, J., et al.: An artificial fish swarm algorithm for the multicast routing problem. IEICE Trans. Commun. E97-B(5), 996–1011 (2014)CrossRefGoogle Scholar
  2. 2.
    Zhou, Z., Jiang, C., Huang, L., et al.: On optimal rectilinear shortest paths and 3-Steiner tree routing in presence of obstacles. J. Softw. 14(9), 1503–1514 (2003). (in Chinese with an English abstract)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Li, Z., Shi, H.: A data-aggregation algorithm based on minimum Steiner tree in wireless sensor networks. J. Northwest. Polytech. Univ. 27(4), 558–564 (2009). (in Chinese with an English abstract)Google Scholar
  4. 4.
    Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem, vol. 53. Elsevier, Amsterdam (1992)zbMATHGoogle Scholar
  5. 5.
    Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Math. Jpn. 24(6), 573–577 (1980)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Informatica 15, 141–145 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Rayward-Smith, V.J.: The computation of nearly minimal Steiner trees in graphs. Int. J. Math. Educ. Sci. Tech. 14(1), 15–23 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness (1979)Google Scholar
  9. 9.
    Plesník, J.: Worst-case relative performances of heuristics for the Steiner problem in graphs. Acta Math. Univ. Comen. LX(2), 269–284 (1991)MathSciNetzbMATHGoogle Scholar
  10. 10.
    Fan, Y., Jianjun, Yu., Fang, Z.: Hybrid genetic simulated annealing algorithm based on niching for QoS multicast routing. J. Commun. 29(5), 65–71 (2008). (in Chinese with an English abstract)Google Scholar
  11. 11.
    Ma, X., Liu, Q.: A particle swarm optimization for Steiner tree problem. In: Proceedings of the 6th International Conference on Natural Computation (ICNC), pp. 2561–2565 (2010)Google Scholar
  12. 12.
    Zhong, W.L., Huang, J., Zhang, J.: A novel particle swarm optimization for the Steiner tree problem in graphs. In: IEEE World Congress on Evolutionary Computation, pp. 2460–2467 (2008)Google Scholar
  13. 13.
    Ma, X., Liu, Q.: An artificial fish swarm algorithm for Steiner tree problem. In: IEEE-FUZZ, pp. 59–63 (2009)Google Scholar
  14. 14.
    Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389–1401 (1957)CrossRefGoogle Scholar
  15. 15.
    Koza, J.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)zbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Qing Liu
    • 1
    • 2
    Email author
  • Rongjun Tang
    • 1
  • Jingyan Kang
    • 1
  • Junliang Yao
    • 1
    • 2
  • Wenqing Wang
    • 1
    • 2
  • Yali Wu
    • 1
    • 2
  1. 1.Faculty of Automation and Information EngineeringXi’an University of TechnologyXi’anChina
  2. 2.Shaanxi Key Laboratory of Complex System Control and Intelligent Information ProcessingXi’anChina

Personalised recommendations