IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · 2007 · 159 citations · 13 references
EngineeringComputer EngineeringDesign AutomationOptimizationVlsi DesignEvolutionary ComputationEvolutionary OptimizationGenetic AlgorithmsIntegrated Circuit DesignMetaheuristic OptimizationVery-large-scale Integration LayoutFloorplanningHybrid Genetic AlgorithmsIntegrated Circuit FloorplanningLocal SearchLocal Search AlgorithmsMemetic AlgorithmsMemetic Algorithms In DesignNp-hardness
Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the computational point of view, VLSI floorplanning is an NP-hard problem. In this paper, a memetic algorithm (MA) for a nonslicing and hard-module VLSI floorplanning problem is presented. This MA is a hybrid genetic algorithm that uses an effective genetic search method to explore the search space and an efficient local search method to exploit information in the search region. The exploration and exploitation are balanced by a novel bias search strategy. The MA has been implemented and tested on popular benchmark problems. Experimental results show that the MA can quickly produce optimal or nearly optimal solutions for all the tested benchmark problems.
13
Hisao Ishibuchi, Takafumi Yoshida, Tadahiko Murata · IEEE Transactions on Evolutionary Computation · 2003 · 774 citations
Natural Sciences, Computer Engineering, Computer Science +17