Moving Clusters within a Memetic Algorithm for Graph Partitioning
- Authors
- Hwang, Inwook; Kim, Yong-Hyuk; Yoon, Yourim
- Issue Date
- 2015
- Publisher
- HINDAWI LTD
- Citation
- MATHEMATICAL PROBLEMS IN ENGINEERING
- Journal Title
- MATHEMATICAL PROBLEMS IN ENGINEERING
- URI
- https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/11851
- DOI
- 10.1155/2015/238529
- ISSN
- 1024-123X
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - IT융합대학 > 컴퓨터공학과 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.