Moving Block Sequence and Organizational Evolutionary Algorithm for General Floorplanning

⎯A new nonslicing floorplan representation, the moving block sequence (MBS), is proposed in this paper. Our idea of the MBS originates from the observation that placing blocks on a chip has some similarities to playing the game, Tetris® . Because no extra constraints are exerted on solution spaces, the MBS is not only useful for evolutionary algorithms, but also for dealing with rectangular, convex rectilinear, and concave rectilinear blocks, similarly and simultaneously, without partitioning rectilinear blocks into sub-blocks. This is owed to a special structure designed for recording the information of both convex and concave rectilinear blocks in a uniform form. Theoretical analyses show that the computational cost of transforming an MBS to a floorplan with rectangular blocks, in terms of the number of blocks, is between linear and quadratic. Furthermore, as a follow-up of our previous works, a new organizational evolutionary algorithm (OEA) based on the MBS (MBS-OEA) is proposed...

• Type: Conference
• Year: 2005
• Where: CIS
• Authors: Jing Liu, Weicai Zhong, Licheng Jiao
• Keywords: CIS 2005, Evolutionary Algorithm, Hard Rectilinear Blocks, Rectilinear Blocks