A hybrid genetic algorithm for the floorplan optimization problem

Author

Tseng, Lin-yu ; Han, Tun-Yung

Author_Institution

Dept. of Comput. Sci., National Chung Hsing Univ., Taichung, Taiwan

Volume

2

fYear

2005

fDate

14-15 July 2005

Firstpage

781

Abstract

The floorplan optimization problem is an important problem in VLSI design. In a floorplan optimization problem, a set of rectangular blocks is given and the objective is to find a rectangle with minimum area that encloses all blocks. In this paper, a genetic algorithm combined with a local search is proposed for this problem. The chromosome is represented by the sequence pair. The genetic algorithm, acting as a global search method, tries to search large areas while the local search tries to search small areas. As revealed by the experimental results on MCNC benchmark circuits, the proposed method is highly competitive.

Keywords

VLSI; circuit optimisation; genetic algorithms; integrated circuit layout; search problems; VLSI design; chromosome; floorplan optimization problem; global search method; hybrid genetic algorithm; rectangular block; Biological cells; Circuits; Communications technology; Encoding; Genetic algorithms; Intellectual property; Optimization methods; Process design; Simulated annealing; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Circuits and Systems, 2005. ISSCS 2005. International Symposium on

Print_ISBN

0-7803-9029-6

Type

conf

DOI

10.1109/ISSCS.2005.1511357

Filename

1511357