An efficient algorithm for circuit partitioning

This paper describes an improved simulated annealing algorithm applied for graph balanced bipartitioning problem, in particular for circuit partitioning problem. The new algorithm has incorporated the idea and procedure required in a genetic algorithm Experiment results on industrial benchmark circuits show that the proposed algorithm is superior to a conventional simulated annealing algorithm in both cut cost and run time.