스타이너 트리 문제를 위한 Max-Min Ant Colony OptimizationA Max-Min Ant Colony Optimization for Undirected Steiner Tree Problem in Graphs
- Other Titles
- A Max-Min Ant Colony Optimization for Undirected Steiner Tree Problem in Graphs
- Authors
- 서민석; 김대철
- Issue Date
- Mar-2009
- Publisher
- 한국경영과학회
- Keywords
- Steiner Tree Problem in Graphs; Ant Colony Optimization; NP-hardness
- Citation
- 경영과학, v.26, no.1, pp.65 - 76
- Indexed
- KCI
- Journal Title
- 경영과학
- Volume
- 26
- Number
- 1
- Start Page
- 65
- End Page
- 76
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/177059
- ISSN
- 1225-1100
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 경영대학 > 서울 경영학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/177059)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.