A Fused Algorithm for Sovling VLSI Placement Problem

Placement is the crucial step in modern VLSI physical design, and the result may decisively influence the follow-up wiring design. The advantages and limitations of the random optimization algorithm, ant colony algorithm, genetic algorithm, heuristic algorithm and simulated annealing algorithm which are used for placement optimization were analyzed in allusion to optimal search problems of VLSI placement. With a view to speedability of search, global convergence and the optimality of the solution, the initial placement is received through integrated use of all algorithms. In the meantime, the iterative improvement placement is realized by means of dynamic multi-branch tree. Practice has shown that the structure of the algorithm is clear, and it can also ensure the optimality of the received solution.