TY - JOUR A2 - Carlsson, John Gunnar AU - Hwang, Inwook AU - Kim, Yong-Hyuk AU - Yoon, Yourim PY - 2015 DA - 2015/09/20 TI - Moving Clusters within a Memetic Algorithm for Graph Partitioning SP - 238529 VL - 2015 AB - 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. SN - 1024-123X UR - https://doi.org/10.1155/2015/238529 DO - 10.1155/2015/238529 JF - Mathematical Problems in Engineering PB - Hindawi Publishing Corporation KW - ER -