스타이너 트리 문제를 위한 Max-Min Ant Colony Optimization
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 서민석 | - |
dc.contributor.author | 김대철 | - |
dc.date.accessioned | 2022-12-20T22:52:49Z | - |
dc.date.available | 2022-12-20T22:52:49Z | - |
dc.date.created | 2022-09-19 | - |
dc.date.issued | 2009-03 | - |
dc.identifier.issn | 1225-1100 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/177059 | - |
dc.description.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. | - |
dc.language | 한국어 | - |
dc.language.iso | ko | - |
dc.publisher | 한국경영과학회 | - |
dc.title | 스타이너 트리 문제를 위한 Max-Min Ant Colony Optimization | - |
dc.title.alternative | A Max-Min Ant Colony Optimization for Undirected Steiner Tree Problem in Graphs | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | 김대철 | - |
dc.identifier.bibliographicCitation | 경영과학, v.26, no.1, pp.65 - 76 | - |
dc.relation.isPartOf | 경영과학 | - |
dc.citation.title | 경영과학 | - |
dc.citation.volume | 26 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 65 | - |
dc.citation.endPage | 76 | - |
dc.type.rims | ART | - |
dc.identifier.kciid | ART001331437 | - |
dc.description.journalClass | 2 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | kci | - |
dc.subject.keywordAuthor | Steiner Tree Problem in Graphs | - |
dc.subject.keywordAuthor | Ant Colony Optimization | - |
dc.subject.keywordAuthor | NP-hardness | - |
dc.identifier.url | https://scienceon.kisti.re.kr/srch/selectPORSrchArticle.do?cn=JAKO200911850424262&SITE=CLICK | - |
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.