An efficient variable interdependency-identification and decomposition by minimizing redundant computations for large-scale global optimization
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Kyung Soo | - |
dc.contributor.author | Choi, Yong Suk | - |
dc.date.accessioned | 2022-07-08T09:25:25Z | - |
dc.date.available | 2022-07-08T09:25:25Z | - |
dc.date.created | 2021-05-12 | - |
dc.date.issued | 2020-03 | - |
dc.identifier.issn | 0020-0255 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/146046 | - |
dc.description.abstract | Although many variable decomposition methods for cooperative co-evolution (CC) have been proposed, researches on scalable and efficient decomposition have rarely been done, particularly, for the large-scale global optimization (LSGO) problems. In this paper, we propose an efficient variable interdependency identification and decomposition method, called EVIID. Different from existing studies focusing on only limited scale efficient or accurate variable decomposition, our purpose is to develop a scalable variable decomposition method with high efficiency and accuracy even on very high-dimensional problems. EVIID utilizes three core strategies: a binary variable space search, a dynamic perturbation caching, and a pre-variable sorting. Their synergy effect enables scalable and efficient variable decomposition without sacrificing decomposition accuracy by pruning many redundant computations required to identify interdependencies among decision variables. In comprehensive experiments, EVIID showed highly scalable decomposition ability on 1000 to 10,000 dimensional benchmark problems compared against the state-of-the-art variable decomposition methods. Moreover, when EVIID was embedded into practical CC frameworks, it showed good optimization performance and also fast convergence. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE INC | - |
dc.title | An efficient variable interdependency-identification and decomposition by minimizing redundant computations for large-scale global optimization | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Choi, Yong Suk | - |
dc.identifier.doi | 10.1016/j.ins.2019.10.049 | - |
dc.identifier.scopusid | 2-s2.0-85075383732 | - |
dc.identifier.wosid | 000512221800018 | - |
dc.identifier.bibliographicCitation | INFORMATION SCIENCES, v.513, pp.289 - 323 | - |
dc.relation.isPartOf | INFORMATION SCIENCES | - |
dc.citation.title | INFORMATION SCIENCES | - |
dc.citation.volume | 513 | - |
dc.citation.startPage | 289 | - |
dc.citation.endPage | 323 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | COEVOLUTION | - |
dc.subject.keywordPlus | EVOLUTION | - |
dc.subject.keywordAuthor | Variable interdependency identification | - |
dc.subject.keywordAuthor | Variable decomposition | - |
dc.subject.keywordAuthor | Large-scale global optimization (LSGO) | - |
dc.subject.keywordAuthor | Cooperative co-evolution (CC) | - |
dc.subject.keywordAuthor | Divide-and-conquer strategy | - |
dc.subject.keywordAuthor | Dynamic programming | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0020025519310205?via%3Dihub | - |
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.