Date: 20 Jun 2005

Partitioning a graph with a parallel genetic algorithm

* Final gross prices may vary according to local VAT.

Get Access


We present a parallel genetic algorithm for the k way graph partitioning problem. The algorithm uses selection in local neighborhood and sophisticated genetic operators. For a sample problem the algorithm has found better solutions than those found by recent GPP algorithms. The success of the parallel genetic algorithm depends on the representation, a suitable crossover operator and an efficient local hill climbing method which is used to restrict the solution space.