Moving block sequence and organizational evolutionary algorithm for general floorplanning

Authors:
Jing Liu;Weicai Zhong;Licheng Jiao
Affiliations:
Institute of Intelligent Information Processing, Xidian University, Xi’an, China;Institute of Intelligent Information Processing, Xidian University, Xi’an, China;Institute of Intelligent Information Processing, Xidian University, Xi’an, China
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Year:
2005

Citing 10
Cited 0

An enhanced perturbing algorithm for floorplan design using the O-tree representation

ISPD '00 Proceedings of the 2000 international symposium on Physical design
B*-Trees: a new representation for non-slicing floorplans

Proceedings of the 37th Annual Design Automation Conference
FAST-SP: a fast algorithm for block placement based on sequence pair

Proceedings of the 2001 Asia and South Pacific Design Automation Conference
An Enhanced Q-Sequence Augmented with Empty-Room-Insertion and Parenthesis Trees

Proceedings of the conference on Design, automation and test in Europe
Corner sequence: a P-admissible floorplan representation with a worst case linear-time packing scheme

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
TCG: a transitive closure graph-based representation for general floorplans

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
An organizational coevolutionary algorithm for classification

IEEE Transactions on Evolutionary Computation
Floorplanning using a tree representation

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Twin binary sequences: a nonredundant representation for general nonslicing floorplan

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
TCG-S: orthogonal coupling of P*-admissible representations for general floorplans

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new nonslicing floorplan representation, moving block sequence (MBS), is first proposed. The MBS is suitable for evolutionary algorithms since no extra constraints are exerted on the solution space. Furthermore, an organizational evolutionary algorithm is designed with the intrinsic properties of MBS in mind, called MBS-OEA. In experiments, 21 benchmarks from MCNC and GSRC are used to test the performance of MBS-OEA. The number of blocks in these benchmarks varies from 9 to 300. Comparisons are also made between MBS-OEA and some well-designed existing algorithms. The experimental results show that MBS-OEA can find high quality solutions even for the problems with 300 blocks. Therefore, MBS-OEA is competent for solving large scale problems.