Research Article
Moving Clusters within a Memetic Algorithm for Graph Partitioning
Algorithm 1
Our cluster-moving scheme.
Select clusters: clusters selected at random; | do { | Calculate for all ; | ; | ; | if then { | Move cluster to partition ; | ; | } | } until ( or ) |
|