Improved genetic algorithm for VLSI floorplan design with non-slicing structure

Floorplan design is an important engineering problem. This problem can be modeled as a combinatorial optimization problem, in which a given set of rectangles in floorplan must be arranged. The goal is to find the arrangement with minimum area and minimum interconnection. Floorplans can be classified into slicing structure and non-slicing structure problems. In both problem types, it is difficult to obtain a true optimal solution in a time that could be used in practice. We proposed the new immune algorithm for optimization of the slicing structure problem in the past. In this paper, we focus on and analyze the improved points considered to be especially effective, and propose a new genetic algorithm for the non-slicing structure problem. The proposed method is compared with existing methods using well-known benchmark problems.