Research Article
Moving Clusters within a Memetic Algorithm for Graph Partitioning
Create initial population of fixed size; | Apply local optimization to each member of population; | Calculate genic distance from population; | Find clusters and store their information; | do { | Select and from population; | Normalization(, ); | offspring Crossover(, ); | Cluster-moving(offspring); | Local-optimization(offspring); | Replace(population, offspring); | } until (stopping condition); | return the best solution; |
|