A novel pheromone-based evolutionary algorithm for solving degree-constrained minimum spanning tree problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Huang, Xiao-Ma | - |
dc.contributor.author | Gong, Yue-Jiao | - |
dc.contributor.author | Zhang, Jun | - |
dc.date.accessioned | 2024-01-22T13:36:40Z | - |
dc.date.available | 2024-01-22T13:36:40Z | - |
dc.date.issued | 2013-07 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/117931 | - |
dc.description.abstract | The degree-constrained minimum spanning tree problem (dc- MSTP) is crucial in the design of networks and it is proved to be NP-hard. The recently developed evolutionary algorithm utilizing node-depth-degree representation (EANDD) has successfully enabled the dc-MSTP solvable by generating new spanning trees in average time complexity O(√ n) , which is the fastest in the literature. However, as the generic operation of EANDD is to change two edges that are randomly selected from the entire tree, the efficiency of EANDD still has potential to be further improved. In this paper, we propose a novel pheromone-based tree modification method (PTMM) to improve the efficiency of EANDD. For each edge, a pheromone value is defined based on the historical contribution of the edge to the fitness of the spanning tree. Then, PTMM considers the pheromone value on each edge as a desirability measure for selecting the edge to construct the spanning tree. In this way, the more promising edge is more likely to be selected and therefore the efficiency of the tree modification operation in EANDD can be improved. The effectiveness and effieciency of PTMM is demonstrated on a set of benchmark instances in comparison with the original EANDD. | - |
dc.format.extent | 2 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | ACM | - |
dc.title | A novel pheromone-based evolutionary algorithm for solving degree-constrained minimum spanning tree problem | - |
dc.type | Article | - |
dc.publisher.location | 네델란드 | - |
dc.identifier.doi | 10.1145/2464576.2464636 | - |
dc.identifier.scopusid | 2-s2.0-84882323434 | - |
dc.identifier.bibliographicCitation | GECCO '13 Companion: Proceedings of the 15th annual conference companion on Genetic and evolutionary computation, pp 121 - 122 | - |
dc.citation.title | GECCO '13 Companion: Proceedings of the 15th annual conference companion on Genetic and evolutionary computation | - |
dc.citation.startPage | 121 | - |
dc.citation.endPage | 122 | - |
dc.type.docType | Conference paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Degree-constrained minimum spanning tree | - |
dc.subject.keywordAuthor | Evolutionary algorithms | - |
dc.subject.keywordAuthor | Network design | - |
dc.subject.keywordAuthor | Pheromone | - |
dc.subject.keywordAuthor | Tree modification | - |
dc.identifier.url | https://dl.acm.org/doi/abs/10.1145/2464576.2464636? | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
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.