An adaptive genetic algorithm for VLSI floorplanning based on sequence-pair

In this paper, we propose an adaptive genetic algorithm (GA) to solve the floorplanning problem in VLSI layout design, in which the sequence-pair representation is adopted as the coding scheme of each chromosome. New genetic operators for the problem 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 stare of an individual. Experimental results show the effectiveness of our adaptive genetic algorithm compared to simulated annealing (SA).