스타이너 트리 문제를 위한 Ant Colony Optimization 알고리즘의 개발An Ant Colony Optimization Algorithm to Solve Steiner Tree Problem
- Other Titles
- An Ant Colony Optimization Algorithm to Solve Steiner Tree Problem
- Authors
- 서민석; 김대철
- Issue Date
- Sep-2008
- Publisher
- 한국경영과학회
- Keywords
- Steiner Arborescence Problem; Ant Colony Optimization; Directed Graph
- Citation
- 한국경영과학회지, v.33, no.3, pp.17 - 28
- Indexed
- KCI
- Journal Title
- 한국경영과학회지
- Volume
- 33
- Number
- 3
- Start Page
- 17
- End Page
- 28
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/177900
- ISSN
- 1225-1119
- Abstract
- The Steiner arborescence problem is known to be NP-hard. The objective of this problem is to find a minimal Steiner tree which starts from a designated node and spans all given 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 arcs which do not contribute to make an optimal solution. In the second step, ant colony algorithm with use of Prim’s algorithm is used to solve the Steiner arborescence problem in the reduced graph. The proposed method based on a two-step procedure is tested in the five test problems. The results show that this method finds the optimal solutions to the tested problems within 50 seconds. The algorithm can be applied to undirected Steiner tree problems with minor changes. 18 problems taken from Beasley are used to compare the performances of the proposed algorithm and Singh et al.’s algorithm. The results show that the proposed algorithm generates better solutions than the algorithm compared.
- 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/177900)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.