An efficient tabu search algorithm for graph bisectioning

Abstract

A new algorithm for solving the graph bisectioning problem based on tabu search is proposed. The authors run the tabu search algorithm and the Kernighan-Lin algorithm on the same set of random graphs with 50 to 500 nodes and compare their performances. They demonstrate that for all of the graphs their tabu search algorithm provides lower bisection cost than the Kernighan-Lin algorithm; and for all of the graphs with more than 200 nodes, their tabu search algorithm takes less time than the Kernighan-Lin algorithm. >