Moving Clusters within a Memetic Algorithm for Graph Partitioning
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hwang, Inwook | - |
dc.contributor.author | Kim, Yong-Hyuk | - |
dc.contributor.author | Yoon, Yourim | - |
dc.date.available | 2020-02-28T14:44:38Z | - |
dc.date.created | 2020-02-06 | - |
dc.date.issued | 2015 | - |
dc.identifier.issn | 1024-123X | - |
dc.identifier.uri | https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/11851 | - |
dc.description.abstract | Most memetic algorithms (MAs) for graph partitioning reduce the cut size of partitions using iterative improvement. But this local process considers one vertex at a time and fails to move clusters between subsets when the movement of any single vertex increases cut size, even though moving the whole cluster would reduce it. A new heuristic identifies clusters from the population of locally optimized random partitions that must anyway be created to seed the MA, and as the MA runs it makes beneficial cluster moves. Results on standard benchmark graphs show significant reductions in cut size, in some cases improving on the best result in the literature. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | HINDAWI LTD | - |
dc.relation.isPartOf | MATHEMATICAL PROBLEMS IN ENGINEERING | - |
dc.subject | GEOMETRIC CROSSOVERS | - |
dc.subject | OPTIMIZATION | - |
dc.subject | SEARCH | - |
dc.subject | GREEDY | - |
dc.subject | VERTEX | - |
dc.title | Moving Clusters within a Memetic Algorithm for Graph Partitioning | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.description.journalClass | 1 | - |
dc.identifier.wosid | 000362377900001 | - |
dc.identifier.doi | 10.1155/2015/238529 | - |
dc.identifier.bibliographicCitation | MATHEMATICAL PROBLEMS IN ENGINEERING | - |
dc.identifier.scopusid | 2-s2.0-84943390072 | - |
dc.citation.title | MATHEMATICAL PROBLEMS IN ENGINEERING | - |
dc.contributor.affiliatedAuthor | Yoon, Yourim | - |
dc.type.docType | Article | - |
dc.subject.keywordPlus | GEOMETRIC CROSSOVERS | - |
dc.subject.keywordPlus | OPTIMIZATION | - |
dc.subject.keywordPlus | SEARCH | - |
dc.subject.keywordPlus | GREEDY | - |
dc.subject.keywordPlus | VERTEX | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Engineering, Multidisciplinary | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Interdisciplinary Applications | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
1342, Seongnam-daero, Sujeong-gu, Seongnam-si, Gyeonggi-do, Republic of Korea(13120)031-750-5114
COPYRIGHT 2020 Gachon 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.