스타이너 트리 문제를 위한 Ant Colony Optimization 알고리즘의 개발
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 서민석 | - |
dc.contributor.author | 김대철 | - |
dc.date.accessioned | 2022-12-21T01:16:14Z | - |
dc.date.available | 2022-12-21T01:16:14Z | - |
dc.date.created | 2022-09-19 | - |
dc.date.issued | 2008-09 | - |
dc.identifier.issn | 1225-1119 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/177900 | - |
dc.description.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. | - |
dc.language | 한국어 | - |
dc.language.iso | ko | - |
dc.publisher | 한국경영과학회 | - |
dc.title | 스타이너 트리 문제를 위한 Ant Colony Optimization 알고리즘의 개발 | - |
dc.title.alternative | An Ant Colony Optimization Algorithm to Solve Steiner Tree Problem | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | 김대철 | - |
dc.identifier.bibliographicCitation | 한국경영과학회지, v.33, no.3, pp.17 - 28 | - |
dc.relation.isPartOf | 한국경영과학회지 | - |
dc.citation.title | 한국경영과학회지 | - |
dc.citation.volume | 33 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 17 | - |
dc.citation.endPage | 28 | - |
dc.type.rims | ART | - |
dc.identifier.kciid | ART001279772 | - |
dc.description.journalClass | 2 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | kci | - |
dc.subject.keywordAuthor | Steiner Arborescence Problem | - |
dc.subject.keywordAuthor | Ant Colony Optimization | - |
dc.subject.keywordAuthor | Directed Graph | - |
dc.identifier.url | https://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE01051295 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.