Korean Management Science Review (경영과학)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

A Max-Min Ant Colony Optimization for Undirected Steiner Tree Problem in Graphs

스타이너 트리 문제를 위한 Mar-Min Ant Colony Optimization

  • 서민석 (삼성전자 Device solution부분(business) Test and Package 센터 TP 기술2팀) ;
  • 김대철 (한양대학교 경영대학 경영학부)
  • Published : 2009.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

The undirected Steiner tree problem in graphs is known to be NP-hard. The objective of this problem is to find a shortest tree containing a subset of nodes, called terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step. graph reduction rules eliminate useless nodes and edges which do not contribute to make an optimal solution. In the second step, a max-min ant colony optimization combined with Prim's algorithm is developed to solve the reduced problem. The proposed algorithm is tested in the sets of standard test problems. The results show that the algorithm efficiently presents very correct solutions to the benchmark problems.

Keywords

References

  1. 서민석, 김대철, '스타이너 트리 문제를 위한 Ant Colony Optimization 알고리즘의 개발', '한국경영과학회지', 제33권, 제3호(2008), pp.17-28
  2. Beasley, J.E., 'An Algorithm for the Steiner Problem in Graphs,' Networks, Vol.14(1984), pp.147-159 https://doi.org/10.1002/net.3230140112
  3. Blum, C. and M Dorigo, 'The Hyper-Cube Framework for Ant Colony Optimization,' IEEE Transactions on Systems, Man, and Cybernetics-Part B, Vol.34(2004), pp.1161-1172 https://doi.org/10.1109/TSMCB.2003.821450
  4. Dorigo, M and T. Stutzle, Ant Colony Optimization, The MIT press, London, England, 2004
  5. Dorigo, M and L.M Gambardella, 'Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem,' IEEE Transactions on Evolutionary Computation, Vol.1(1997), pp.53-66 https://doi.org/10.1109/4235.585892
  6. Dowsland, K.A. Hill-climing, 'Simulated Annealing and the Steiner Problem in Graphs,' Eng. Optimization, Vol.17(1991), pp.91-107 https://doi.org/10.1080/03052159108941063
  7. Duin, C.W. and S. Voss, 'Steiner Tree Heuristics-A Survey,' Operations Research Proceedings, Springer-Verlag, Berlin, 1994, pp.485-496
  8. Duin, C.W. and A, Volgenant, 'Reduction Tests for the Steiner Problem in Graphs,' Networks, Vol.19(1989), pp.549-567 https://doi.org/10.1002/net.3230190506
  9. Esbensen, H., 'Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using a Genetic Algorithm,' Networks, Vol. 26(1995), pp.173-185 https://doi.org/10.1002/net.3230260403
  10. Kapsalis, A, V.J. Rayward-Smith, and G.D. Smith, 'Solving the Graphical Steiner Tree Problem Using Genetic Algorithms,' Journal of Operation Research Society, Vol.44(1993), pp.397-406 https://doi.org/10.1057/jors.1993.69
  11. Koch, T., A Martin, and S. Voss, 'SteinLib: An Updated Library on Steiner Tree Problems in Graphs,' Technical Report ZIB-Report 00-37, Konrad-Zuse-Zentrum fur Informationstechnik Berlin, 2000
  12. Garey, M.R. and D.S. Johnson, Computers and Intractability : A Guide to Theory of NP-Completeness, Freeman, New York, 1979
  13. Hwang, F.K., D.S. Richard, and P. Winter, The Steiner Tree Problem. North-Holland, Publishing Company, Amsterdam, Netherlands, 1992
  14. Maculan, N., P. Souza, and A.C. Vejar, 'An Approach for the Steiner Problem in Directed Graphs,' Annals of Operations Research, Vol.33(1991), pp.471-480 https://doi.org/10.1007/BF02071983
  15. Minoux, M., 'Efficient Greedy Heuristics for Steiner Tree problems Using Reoptimization and Supermodularity,' INFOR, Vol.28(1990), pp.221-233
  16. Prim, RC., 'Shortest Connection Networks and Some Generalisations,' Bell System Technical Journal, Vol.36(1957), pp.1389-1401 https://doi.org/10.1002/j.1538-7305.1957.tb01515.x
  17. Schiemangk, C., 'Thermodynmically Motivated Simulation for Solving the Steiner Tree Problem and the Optimization of Interacting Path Systems,' Optimization of Connection Structures in Graphs, Iwainsky, A (ed,), CICIP, East Berlin, GDR, 1985, pp.74-90
  18. Singh, G., S. Das, S. Gosavi, and S. Pujar, Ant Colony Algorithms for Steiner Trees: An Application to Routing in Sensor Networks, In Recent Developments in Biologically Inspired Computing, L.N. de Castro and F.J. von Zuben, Eds. Idea Group Inc., Chapter 6. 2004
  19. Studetzle, Thomas and Hogler H. Hoos, 'Max-Min Ant System,' Future Generation Computer Systems, Vol.16(2000), pp.889-914 https://doi.org/10.1016/S0167-739X(00)00043-1
  20. Voss, S., 'Steiner's Problem in Graphs: Heuristic Methods,' Discrete Applied Mathermtics, Vol.40(1992), pp.45-72 https://doi.org/10.1016/0166-218X(92)90021-2
  21. Xu, J., S.Y. Chiu, and F. Glover, 'Probabilistic Tabu Search for Telecommunications Network Design,' Combin Optim Theory Pract, Vol.1 (1997), pp.69-94
  22. Xu, J., S.Y. Chiu, and F. Glover, 'Using Tabu Search to Solve the Steiner Tree-Star Problem in Telecommunications Network Design,' Telecommun Syst, Vol.6(1996), pp.117-125 https://doi.org/10.1007/BF02114289