Advertisement

A Hybrid Evolutionary Algorithm for the Euclidean Steiner Tree Problem Using Local Searches

  • Byounghak Yang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4251)

Abstract

In this paper we introduce a hybrid evolutionary algorithm for the Euclidean Steiner tree problem (ESTP) which is to find a minimum-length Euclidean interconnection of a set of terminals in the plane. The individual is an assembly of locations of a non-fixed number of Steiner points and number of Steiner points. We use the operators crossover, mutation and selection. A Steiner points pool is introduced base on the optimal 3-terminal Steiner points generation and the minimum spanning tree. An initial population is generated by random selecting from the Steiner points pool. To improve the solution quality, some Steiner points in individual are deleted and rearranged. Randomly generated Steiner points are inserted in selected individual to search a new solution. Experimental results show that the quality of solution is improved by the hybrid operator. The gap between the optimal solution and the solution of hybrid evolutionary algorithm is less than 0.3%.

Keywords

Local Search Minimum Span Tree Steiner Tree Steiner Point Steiner Tree Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bäck, T.: Evolutionary Algorithm in Theory and Practice. Oxford University Press, Oxford (1996)Google Scholar
  2. 2.
    Barreiros, J. : An Hierarchic Genetic Algorithm for Computing (near) Optimal Euclidean Stein Steiner Trees. In: Workshop on Application of hybrid Evolutionary Algorithms to NP-Complete Problems, Chicago (2003)Google Scholar
  3. 3.
    Beasley, J.E.: OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society 41, 1069–1072 (1990)CrossRefGoogle Scholar
  4. 4.
    Beasley, J.E., Goffinet, F.: A Delaunay Triangulation-based Heuristic for the Euclidean Steiner problem. Networks 24, 215–224 (1994)MATHCrossRefGoogle Scholar
  5. 5.
    Du, D.Z., Hwang, F.K.: A Proof of Gilbert and Pollak’s Conjecture on the Steiner Ratio. Algorithmica 7, 121–135 (1992)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Garey, M.R., Graham, L.R., Johnson, D.S.: The Complexity of Computing Steiner Minimal Trees. SIAM Journal on Applied Mathematics 32, 835–859 (1977)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Hesser, J., Manner, R., Stucky, O.: Optimization of Steiner Trees using Genetic Algorithms. In: Proceedings of the Third International Conference on Genetic Algorithm, pp. 231–236 (1989)Google Scholar
  8. 8.
    Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree problem. Annals of Discrete Mathematics 53 (1992)Google Scholar
  9. 9.
    Ivanov, A.O., Tuzhilin, A.A.: Minimal Networks: The Steiner Problem and its Geberalization. CRC Press, Boca Raton (1994)Google Scholar
  10. 10.
    Joseph, J., Harris, F.C.: A Genetic Algorithm for the Steiner Minimal Tree Problem. In: Proceedings of International Conference on Intelligent Systems (1996)Google Scholar
  11. 11.
    Julstrom, B.A.: Encoding Rectilinear Trees as Lists of Edges. In: Proceedings of the 16th ACM Symposium on Applied Computing, pp. 356–360 (2001)Google Scholar
  12. 12.
    Prim, R.C.: Shortest Connection Networks and Some Generalizations. Bell System Technical Journal 56, 1389–1401 (1957)Google Scholar
  13. 13.
    Sock, S.M., Ahn, B.H.: A New Tree Representation for Evolutionary Algorithms. Journal of the Korean Institute of Industrial Engineers 31, 10–19 (2005)Google Scholar
  14. 14.
    Soukup, J., Chow, W.F.: Set of Test Problems for the Minimum Length Connection Networks. ACM/SIGMAP Newsletter 15, 48–51 (1973)Google Scholar
  15. 15.
    Wakabayashi, S.: A Genetic Algorithm for Generating a Set of Rectilinear Steiner Trees in VLSI Interconnection Layout. Information processing Society of Japan Journal 43(5) (2002)Google Scholar
  16. 16.
    Warme, D.M., Winter, P., Zachariasen, M.: Exact Algorithms for Plane Steiner Tree Problems: A Computational Study. In: Du, D.Z., Smith, J.M., Rubinstein, J.H. (eds.) Advances in Steiner Tree, Kluwer Academic Publishers, Dordrecht (1998)Google Scholar
  17. 17.
  18. 18.
    Yang, B.H.: An Evolution Algorithm for the Rectilinear Steiner Tree Problem. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3483, pp. 241–249. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  19. 19.
    Zachariasen, M.: Local search for the Steiner tree problem in the Euclidean plane. European Journal of Operational Research 119, 282–300 (1999)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Byounghak Yang
    • 1
  1. 1.Industrial EngineeringKyungwon UniversitySeongnam-si, Kyunggi-doKorea

Personalised recommendations