A Hybrid Genetic Search for Graph Partitioning Based on Lock Gain

Abstract

A new hybrid genetic algorithm for graph bisection is proposed. The algorithm includes a new local optimization heuristic. Based on the traditional framework of the KernighanLin algorithm, the local optimization uses a new type of gain as the primary measure for vertex movement. The new algorithm showed signi cant or dramatic improvement over the state-of… (More)

Topics

7 Figures and Tables