Solving the rectangular packing problem by an adaptive GA based on sequence-pair

Author

Hatta, Kazuyuki ; Wakabayashi, Shin´ichi ; Koide, Tetsushi

Author_Institution

Fac. of Eng., Hiroshima Univ., Japan

fYear

1999

fDate

18-21 Jan 1999

Firstpage

181

Abstract

In this paper, we propose a genetic algorithm (GA) to solve the rectangular packing problem (RP), in which the sequence-pair representation is adopted as the coding scheme of each chromosome. New genetic operators for RP are presented to explore the search space efficiently. The proposed GA has an adaptive strategy which dynamically selects an appropriate genetic operator during the GA execution depending on the state of an individual. Experimental results show the effectiveness of our adaptive genetic algorithm compared to simulated annealing (SA)

Keywords

VLSI; circuit layout CAD; circuit optimisation; combinatorial mathematics; genetic algorithms; integrated circuit layout; VLSI layout placement; adaptive GA; adaptive strategy; chromosome coding scheme; constraint graphs; crossovers; discrete combinatorial optimisation; mutation; rectangular packing problem; search space; sequence-pair representation; simulated annealing comparison; Biological cells; Computational modeling; Genetic algorithms; Genetic engineering; Genetic mutations; Robustness; Simulated annealing; Space exploration; Stochastic processes; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Design Automation Conference, 1999. Proceedings of the ASP-DAC '99. Asia and South Pacific

Conference_Location

Wanchai

Print_ISBN

0-7803-5012-X

Type

conf

DOI

10.1109/ASPDAC.1999.759990

Filename

759990