.png){kind=icon}
.png){kind=icon}
Return
Improved genetic algorithm for VLSI floorplan design with non-slicing structure
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2005.01.023.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (c) 2006 Elsevier Ltd. All rights reserved.
Keywords:
genetic algorithm
floorplan design problem
non-slicing structure
sequence-pair
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
No organization information available