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.
This research is supported by the National Natural Science Foundation of China under Grant 60133010.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Jiao, L., Liu, J., Zhong, W.: An Organizational Coevolutionary Algorithm for Classification. IEEE Trans. Evol. Comput. (2006) (to be published)
Guo, P.N., Takahashi, T., Cheng, C.K., Yoshimura, T.: Floorplanning Using a Tree Representation. IEEE Trans. CAD 20(2), 281–289 (2001)
Pang, Y., Cheng, C.K., Yoshimura, T.: An Enhanced Perturbing Algorithm for Floorplan Design using the O-tree Representation. In: Proc. ACM Int. Physical Design Symposia. pp. 168–173 (2000)
Chang, Y.C., Chang, Y.W., Wu, G.M., Wu, S.W.: B*-Trees: a New Representation for Nonslicing Floorplans. In: Proc. ACM/IEEE Design Automation Conf., pp. 458–463 (2000)
Lin, J.M., Chang, Y.W.: TCG: a Transitive Closure Graph-Based Representation for General Floorplans. IEEE Trans. VLSI 13(2), 288–292 (2005)
Lin, J.M., Chang, Y.W.: TCG-S: Orthogonal Coupling of P*-Admissible Representations for General Floorplans. IEEE Trans. CAD 23(6), 968–980 (2004)
Tang, X., Wong, D.F.: FAST-SP: a Fast Algorithm for Block Placement based on Sequence Pair. In: Proc. IEEE Asia South Pacific Design Automation Conf., pp. 521–526 (2001)
Zhuang, C., Sakanushi, K., Jin, L., Kajitani, Y.: An Enhanced Q-sequence Augmented with Empty-room-insertion and Parenthesis Trees. In: Proc. Design Automation Test Europe, pp. 61–68 (2002)
Young, E.F.Y., Chu, C.C.N., Shen, Z.C.: Twin Binary Sequences: a Nonredundant Representation for General Nonslicing Floorplan. IEEE Trans. CAD 22(4), 457–469 (2003)
Lin, J.M., Chang, Y.W., Lin, S.P.: Corner Sequence - a P-Admissible Floorplan Representation With a Worst Case Linear-time Packing Scheme. IEEE Trans. VLSI 11(4), 679–686 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, J., Zhong, W., Jiao, L. (2005). Moving Block Sequence and Organizational Evolutionary Algorithm for General Floorplanning. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_34
Download citation
DOI: https://doi.org/10.1007/11596448_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30818-8
Online ISBN: 978-3-540-31599-5
eBook Packages: Computer ScienceComputer Science (R0)