An evolutionary algorithm based hyper-heuristic framework for the set packing problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chaurasia, Sachchida Nand | - |
dc.contributor.author | Kim, Joong Hoon | - |
dc.date.accessioned | 2021-08-31T22:51:56Z | - |
dc.date.available | 2021-08-31T22:51:56Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2019-12 | - |
dc.identifier.issn | 0020-0255 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/61462 | - |
dc.description.abstract | In recent years, hyper-heuristics have received massive attention from the research community as an alternative of meta-heuristics. In a hyper-heuristic, generation or selection of an effective heuristic among a pool of heuristics is an important and challenging task in the search process. At each iteration, a suitable heuristic can take the search process toward the global optimal solution. Moreover, some additional factors such as quality and the number of heuristics also affect the performance. In this paper, we propose an evolutionary algorithm based hyper-heuristic framework that incorporates dynamic selection of parameters. To test its generality, effectiveness and robustness, we apply this approach on two different NP-hard problems - set packing problem (SPP) and minimum weight dominating set (MWDS) problem. The proposed approach for the SPP and the MWDS problem has been evaluated respectively on their respective set of benchmark instances. Computational results show that the proposed approach for the SPP and MWDS problem perform much better than their respective state-of-the-art approaches in terms of the solution quality and computational time. (C) 2019 Elsevier Inc. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE INC | - |
dc.subject | GUIDED MUTATION | - |
dc.subject | SELECTION | - |
dc.subject | GRASP | - |
dc.title | An evolutionary algorithm based hyper-heuristic framework for the set packing problem | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Joong Hoon | - |
dc.identifier.doi | 10.1016/j.ins.2019.07.073 | - |
dc.identifier.scopusid | 2-s2.0-85069721292 | - |
dc.identifier.wosid | 000487167700001 | - |
dc.identifier.bibliographicCitation | INFORMATION SCIENCES, v.505, pp.1 - 31 | - |
dc.relation.isPartOf | INFORMATION SCIENCES | - |
dc.citation.title | INFORMATION SCIENCES | - |
dc.citation.volume | 505 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 31 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.subject.keywordPlus | GUIDED MUTATION | - |
dc.subject.keywordPlus | SELECTION | - |
dc.subject.keywordPlus | GRASP | - |
dc.subject.keywordAuthor | Set packing problem | - |
dc.subject.keywordAuthor | Estimation of distribution algorithm | - |
dc.subject.keywordAuthor | Guided-mutation | - |
dc.subject.keywordAuthor | Heuristic | - |
dc.subject.keywordAuthor | Hyper-heuristic | - |
dc.subject.keywordAuthor | Minimum weight dominating set problem | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
COPYRIGHT © 2021 Korea 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.