An efficient simulated annealing algorithm for graph bisectioning

A new simulated annealing algorithm for solving the graph bisectioning problem is proposed. The authors run their simulated annealing algorithm, the Kernighan-Lin algorithm, and the Saab-Rao algorithms on the same set of random graphs with 50 to 500 nodes and compare their performances. Experiments show that their simulated annealing algorithm provides lower bisection cost than the Kernighan-Lin algorithm and the Saab-Rao algorithms for all of the graphs and their algorithm takes less running time than the other algorithms mentioned for all of the graphs with more than 100 nodes. For the simulated annealing approach, they conclude that sequential neighborhood search outperforms random neighborhood search in solving the graph bisectioning problem.<<ETX>>

[1]  Youssef Saab,et al.  Fast effective heuristics for the graph bisectioning problem , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Brian W. Kernighan,et al.  A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[4]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[5]  T. L. Ward,et al.  Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .

[6]  David Connolly.  An improved annealing scheme for the QAP , 1990 .

[7]  Yehoshua Perl,et al.  Circuit partitioning with size and connection constraints , 1983, Networks.

[8]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[9]  Frank Thomson Leighton,et al.  A Framework for Solving VLSI Graph Layout Problems , 1983, J. Comput. Syst. Sci..

[10]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[11]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[12]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[13]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[14]  Stephen W. Director,et al.  Mason: A Global Floorplanning Approach for VLSI Design , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.