A Level Structure Based Hybrid Evolutionary Algorithm for the Edge Bisection Problem

A hybrid evolutionary algorithm for the edge bisection problem of the graphs is proposed in this paper. The algorithm incorporates the idea of simulated annealing into the selection process of the evolution process. An important feature of this algorithm is that it explores the level structures of the graph to partition its vertex set. Experimental tests on benchmark graphs show that the proposed algorithm is able to provide good quality solutions and the results are well comparable with the best known results obtained from the existing techniques.