An Efficient Genetic Algorithm Based Approach for the Minimum Graph Bisection Problem

Summary The goal of the minimum graph bisection problem is to divide the vertices set of the given undirected graph into two equal-size subsets and such that the number of edges connecting vertices in to vertices in is minimized. In this paper, we propose an efficient method based on genetic algorithm with conditional genetic operators. In the proposed approach, the genetic operators are performed conditionally instead of probably to make sure the algorithm has good global search and local search ability; furthermore, a selection method combining roulette selection with tournament selection is presented to reinforce the local search ability. The proposed approach is tested on a large number of instances and is compared with other optimization methods. The experimental results show that the proposed approach is superior to its competitors. V ) , ( E V G = 1 V 2 V 1 V 2 V