Two-staged Tabu Search for Floorplan Problem Using O-Tree Representation

This paper describes the two-staged Tabu search for the non-slicing floorplan problem using the ordered tree representation called O-tree. The floorplan problem is a part of VLSI layout design problem. Furthermore, we combine ideas from the simulated annealing into the two-staged Tabu search and propose a novel hybrid algorithm for floorplan represented by O-tree. Finally, we demonstrate the validity of two-staged search and hybrid method for MCNC benchmark tests through the computer simulations.