메뉴 건너뛰기




Volumn 12, Issue 5, 2008, Pages 630-646

Moving block sequence and organizational evolutionary algorithm for general floorplanning with arbitrarily shaped rectilinear blocks

Author keywords

Evolutionary algorithms; Floorplanning; Moving block sequence; Organization; Very large scale integration

Indexed keywords

AUTOMATIC TRAIN CONTROL; BENCHMARKING; BOOLEAN FUNCTIONS; ELECTRIC NETWORK ANALYSIS; EVOLUTIONARY ALGORITHMS; MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS; SOLUTIONS;

EID: 53349147913     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2008.920679     Document Type: Article
Times cited : (33)

References (53)
  • 3
    • 13844254630 scopus 로고    scopus 로고
    • TCG: A transitive closure graph-based representation for general floorplans
    • Feb
    • J. M. Lin and Y. W. Chang, "TCG: A transitive closure graph-based representation for general floorplans," IEEE Trans. Very Large Scale Integrat. Syst., vol. 13, no. 2, pp. 288-292, Feb. 2005.
    • (2005) IEEE Trans. Very Large Scale Integrat. Syst , vol.13 , Issue.2 , pp. 288-292
    • Lin, J.M.1    Chang, Y.W.2
  • 4
    • 2942546060 scopus 로고    scopus 로고
    • TCG-S: Orthogonal coupling of p -admissible representations for general floorplans
    • J. M. Lin and Y. W. Chang, "TCG-S: Orthogonal coupling of p -admissible representations for general floorplans," IEEE Trans. Comput.-Aided Des., vol. 23, no. 6, pp. 968-980, 2004.
    • (2004) IEEE Trans. Comput.-Aided Des , vol.23 , Issue.6 , pp. 968-980
    • Lin, J.M.1    Chang, Y.W.2
  • 5
    • 0141750617 scopus 로고    scopus 로고
    • Corner sequence - a p-admissible floorplan representation with a worst case linear-time packing scheme
    • J. M. Lin, Y. W. Chang, and S. P. Lin, "Corner sequence - a p-admissible floorplan representation with a worst case linear-time packing scheme," IEEE Trans. Very Large Scale Integrat. Syst., vol. 11, no. 4, pp. 679-686, 2003.
    • (2003) IEEE Trans. Very Large Scale Integrat. Syst , vol.11 , Issue.4 , pp. 679-686
    • Lin, J.M.1    Chang, Y.W.2    Lin, S.P.3
  • 6
    • 31744440533 scopus 로고    scopus 로고
    • An organizational coevolutionary algorithm for classification
    • Feb
    • L. Jiao, J. Jiu, and W. Zhong, "An organizational coevolutionary algorithm for classification," IEEE Trans. Evol. Comput., vol. 10, pp. 67-80, Feb. 2006.
    • (2006) IEEE Trans. Evol. Comput , vol.10 , pp. 67-80
    • Jiao, L.1    Jiu, J.2    Zhong, W.3
  • 7
    • 34547115947 scopus 로고    scopus 로고
    • An organizational evolutionary algorithm for numerical optimization
    • J. Liu, W. Zhong, and L. Jiao, "An organizational evolutionary algorithm for numerical optimization," IEEE Trans. Syst., Man, Cybern. B, vol. 37, no. 4, pp. 1052-1064, 2007.
    • (2007) IEEE Trans. Syst., Man, Cybern. B , vol.37 , Issue.4 , pp. 1052-1064
    • Liu, J.1    Zhong, W.2    Jiao, L.3
  • 8
    • 10444259857 scopus 로고    scopus 로고
    • An organizational evolutionary algorithm for SAT problem, (in Chinese)
    • J. Liu, W. Zhong, F. Liu, and L. Jiao, "An organizational evolutionary algorithm for SAT problem," (in Chinese) Chinese J. Comput., vol.27, no. 10, pp. 1422-1428, 2004.
    • (2004) Chinese J. Comput , vol.27 , Issue.10 , pp. 1422-1428
    • Liu, J.1    Zhong, W.2    Liu, F.3    Jiao, L.4
  • 11
    • 2942598371 scopus 로고    scopus 로고
    • Corner block list representation and its application to floorplan optimization
    • May
    • X. Hong, S. Dong, G. Huang, Y. Cai, C. K. Cheng, and J. Gu, "Corner block list representation and its application to floorplan optimization," IEEE Trans. Circuits Syst. II, vol. 51, no. 5, pp. 228-233, May 2004.
    • (2004) IEEE Trans. Circuits Syst. II , vol.51 , Issue.5 , pp. 228-233
    • Hong, X.1    Dong, S.2    Huang, G.3    Cai, Y.4    Cheng, C.K.5    Gu, J.6
  • 12
    • 0037387688 scopus 로고    scopus 로고
    • Twin binary sequences: A nonredundant representation for general nonslicing floorplan
    • Apr
    • E. F. Y. Young, C. C. N. Chu, and Z. C. Shen, "Twin binary sequences: A nonredundant representation for general nonslicing floorplan," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 22, no. 4, pp. 457-469, Apr. 2003.
    • (2003) IEEE Trans. Comput.-Aided Design Integr. Circuits Syst , vol.22 , Issue.4 , pp. 457-469
    • Young, E.F.Y.1    Chu, C.C.N.2    Shen, Z.C.3
  • 13
    • 4043104116 scopus 로고    scopus 로고
    • An orthogonal simulated annealing algorithm for large floorplanning problems
    • Aug
    • S. Y. Ho, S. J. Ho, Y. K. Lin, and W. C. C. Chu, "An orthogonal simulated annealing algorithm for large floorplanning problems," IEEE Trans. Very Large Scale Integrat. Syst., vol. 12, no. 8, pp. 874-877, Aug. 2004.
    • (2004) IEEE Trans. Very Large Scale Integrat. Syst , vol.12 , Issue.8 , pp. 874-877
    • Ho, S.Y.1    Ho, S.J.2    Lin, Y.K.3    Chu, W.C.C.4
  • 14
    • 1842587736 scopus 로고    scopus 로고
    • A multiagent genetic algorithm for global numerical optimization
    • Apr
    • W. Zhong, J. Liu, M. Xue, and L. Jiao, "A multiagent genetic algorithm for global numerical optimization," IEEE Trans. Syst. Man Cybern. B vol. 34, no. 2, pp. 1128-1141, Apr. 2004.
    • (2004) IEEE Trans. Syst. Man Cybern. B , vol.34 , Issue.2 , pp. 1128-1141
    • Zhong, W.1    Liu, J.2    Xue, M.3    Jiao, L.4
  • 15
    • 31744441103 scopus 로고    scopus 로고
    • A multiagent evolutionary algorithm for constraint satisfaction problems
    • Feb
    • J. Liu, W. Zhong, and L. Jiao, "A multiagent evolutionary algorithm for constraint satisfaction problems," IEEE Trans. Syst. Man Cybern. B vol. 36, no. 1, pp. 54-73, Feb. 2006.
    • (2006) IEEE Trans. Syst. Man Cybern. B , vol.36 , Issue.1 , pp. 54-73
    • Liu, J.1    Zhong, W.2    Jiao, L.3
  • 16
    • 0346503002 scopus 로고    scopus 로고
    • Evolving accurate and compact classification rules with gene expression programming
    • Dec
    • C. Zhou, W. Xiao, T. M. Tirpak, and P. C. Nelson, "Evolving accurate and compact classification rules with gene expression programming," IEEE Trans. Evol. Comput., vol. 7, pp. 519-531, Dec. 2003.
    • (2003) IEEE Trans. Evol. Comput , vol.7 , pp. 519-531
    • Zhou, C.1    Xiao, W.2    Tirpak, T.M.3    Nelson, P.C.4
  • 17
    • 0345872225 scopus 로고    scopus 로고
    • A novel evolutionary data mining algorithm with applications to churn prediction
    • Dec
    • W. H. Au, K. C. C. Chan, and X. Yao, "A novel evolutionary data mining algorithm with applications to churn prediction," IEEE Trans. Evol. Comput., vol. 7, pp. 532-545, Dec. 2003.
    • (2003) IEEE Trans. Evol. Comput , vol.7 , pp. 532-545
    • Au, W.H.1    Chan, K.C.C.2    Yao, X.3
  • 18
    • 0031143030 scopus 로고    scopus 로고
    • A new evolutionary system for evolving artificial neural networks
    • May
    • X. Yao and Y. Liu, "A new evolutionary system for evolving artificial neural networks," IEEE Trans. Neural Netw., vol. 8, no. 3, pp. 694-713, May 1997.
    • (1997) IEEE Trans. Neural Netw , vol.8 , Issue.3 , pp. 694-713
    • Yao, X.1    Liu, Y.2
  • 20
    • 0031277370 scopus 로고    scopus 로고
    • Hybrid genetic algorithms for constrained placement problems
    • Nov
    • V. Schnecke and O. Vornberger, "Hybrid genetic algorithms for constrained placement problems," IEEE Trans. Evol. Comput., vol. 1, pp. 266-277, Nov. 1997.
    • (1997) IEEE Trans. Evol. Comput , vol.1 , pp. 266-277
    • Schnecke, V.1    Vornberger, O.2
  • 21
    • 0036670463 scopus 로고    scopus 로고
    • VLSI placement and area optimization using a genetic algorithm to breed normalized postfix expressions
    • Aug
    • C. L. Valenzuela and P. Y. Wang, "VLSI placement and area optimization using a genetic algorithm to breed normalized postfix expressions," IEEE Trans. Evol. Comput., vol. 6, pp. 390-401, Aug. 2002.
    • (2002) IEEE Trans. Evol. Comput , vol.6 , pp. 390-401
    • Valenzuela, C.L.1    Wang, P.Y.2
  • 22
    • 0031706894 scopus 로고    scopus 로고
    • Rectilinear block placement using sequence-pair
    • J. Xu, P. N. Guo, and C. K. Cheng, "Rectilinear block placement using sequence-pair," in Proc. ISPD, 1998, pp. 173-178.
    • (1998) Proc. ISPD , pp. 173-178
    • Xu, J.1    Guo, P.N.2    Cheng, C.K.3
  • 23
    • 0032311881 scopus 로고    scopus 로고
    • Arbitrary rectilinear block packing based on sequence pair
    • M. Z. Kang and W. W. M. Dai, "Arbitrary rectilinear block packing based on sequence pair," in Proc. ICCAD, 1998, pp. 259-266.
    • (1998) Proc. ICCAD , pp. 259-266
    • Kang, M.Z.1    Dai, W.W.M.2
  • 24
    • 0033885149 scopus 로고    scopus 로고
    • Arbitrary convex and concave rectilinear block packing using sequence-pair
    • Feb
    • K. Fujiyoshi and H. Murata, "Arbitrary convex and concave rectilinear block packing using sequence-pair," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 19, no. 2, pp. 224-233, Feb. 2000.
    • (2000) IEEE Trans. Comput.-Aided Design Integr. Circuits Syst , vol.19 , Issue.2 , pp. 224-233
    • Fujiyoshi, K.1    Murata, H.2
  • 25
    • 0032218618 scopus 로고    scopus 로고
    • Module placement on bsg-structure with pre-placed modules and rectilinear modules
    • S. Nakatake, M. Furuya, and Y. Kajitani, "Module placement on bsg-structure with pre-placed modules and rectilinear modules," in Proc. ASP-DAC, 1998, pp. 571-576.
    • (1998) Proc. ASP-DAC , pp. 571-576
    • Nakatake, S.1    Furuya, M.2    Kajitani, Y.3
  • 26
    • 0031702566 scopus 로고    scopus 로고
    • Topology constrained rectilinear block packing for layout reuse
    • M. Z. Kang and W. W. M. Dai, "Topology constrained rectilinear block packing for layout reuse," in Proc. ISPD, 1998, pp. 179-186.
    • (1998) Proc. ISPD , pp. 179-186
    • Kang, M.Z.1    Dai, W.W.M.2
  • 27
    • 0034819171 scopus 로고    scopus 로고
    • Rectilinear block packing using o-tree representation
    • Y. Pang, C. K. Cheng, K. Lampasert, and W. Xie, "Rectilinear block packing using o-tree representation," in Proc. ISPD, 2001, pp. 156-161.
    • (2001) Proc. ISPD , pp. 156-161
    • Pang, Y.1    Cheng, C.K.2    Lampasert, K.3    Xie, W.4
  • 28
    • 0033680148 scopus 로고    scopus 로고
    • Rectilinear block placement using b* trees
    • G. M. Wu, Y. C. Chang, and Y. W. Chang, "Rectilinear block placement using b* trees," in Proc. ICCD, 2000, pp. 351-356.
    • (2000) Proc. ICCD , pp. 351-356
    • Wu, G.M.1    Chang, Y.C.2    Chang, Y.W.3
  • 29
    • 0034852169 scopus 로고    scopus 로고
    • Hoorplanning with abutment constraints and 1-shaped/t-shaped blocks based on corner block list
    • Y. Ma, X. Hong, S. Dong, Y. Cai, C. K. Cheng, and J. Gu, "Hoorplanning with abutment constraints and 1-shaped/t-shaped blocks based on corner block list," in Proc. DAC, 2001, pp. 770-775.
    • (2001) Proc. DAC , pp. 770-775
    • Ma, Y.1    Hong, X.2    Dong, S.3    Cai, Y.4    Cheng, C.K.5    Gu, J.6
  • 30
    • 0037002429 scopus 로고    scopus 로고
    • Arbitrarily shaped rectilinear module placement using the transitive closure graph representation
    • Dec
    • J. M. Lin, H. L. Chen, and Y. W. Chang, "Arbitrarily shaped rectilinear module placement using the transitive closure graph representation," IEEE Trans. Very Large Scale Integrat. Syst., vol. 10, no. 6, pp. 886-901, Dec. 2002.
    • (2002) IEEE Trans. Very Large Scale Integrat. Syst , vol.10 , Issue.6 , pp. 886-901
    • Lin, J.M.1    Chen, H.L.2    Chang, Y.W.3
  • 31
    • 0347131048 scopus 로고    scopus 로고
    • Nonrectangular shaping and sizing of soft modules for floorplan-design improvement
    • Jan
    • C. C. N. Chu and E. F. Y. Young, "Nonrectangular shaping and sizing of soft modules for floorplan-design improvement," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 23, no. 1, pp. 71-79, Jan. 2004.
    • (2004) IEEE Trans. Comput.-Aided Design Integr. Circuits Syst , vol.23 , Issue.1 , pp. 71-79
    • Chu, C.C.N.1    Young, E.F.Y.2
  • 32
    • 0001363775 scopus 로고
    • Orthogonal packings in two dimensions
    • B. S. Baker, E. G. Coffman, Jr, and R. L. Rivest, "Orthogonal packings in two dimensions," SIAM J. Comput., vol. 9, no. 4, pp. 808-826,1980.
    • (1980) SIAM J. Comput , vol.9 , Issue.4 , pp. 808-826
    • Baker, B.S.1    Coffman Jr, E.G.2    Rivest, R.L.3
  • 33
    • 0020797485 scopus 로고
    • The bottom-left bin packing heuristic: An efficient implementation
    • Aug
    • B. Chazelle, "The bottom-left bin packing heuristic: An efficient implementation," IEEE Trans. Comput., vol. C-32, pp. 697-707, Aug. 1983.
    • (1983) IEEE Trans. Comput , vol.C-32 , pp. 697-707
    • Chazelle, B.1
  • 34
    • 4544259186 scopus 로고    scopus 로고
    • A new placement heuristic for the orthogonal stock-cutting problem
    • E. K. Burke, G. Kendall, and G. Whitwell, "A new placement heuristic for the orthogonal stock-cutting problem," RAIRO Oper. Res., vol. 52, no. 4, pp. 655-671, 2004.
    • (2004) RAIRO Oper. Res , vol.52 , Issue.4 , pp. 655-671
    • Burke, E.K.1    Kendall, G.2    Whitwell, G.3
  • 35
    • 33744788405 scopus 로고    scopus 로고
    • A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem
    • E. K. Burke, R. S. R. Hellier, G. Kendall, and G. Whitwell, "A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem," RAIRO Oper. Res., vol. 54, no. 3, pp. 587-601, 2006.
    • (2006) RAIRO Oper. Res , vol.54 , Issue.3 , pp. 587-601
    • Burke, E.K.1    Hellier, R.S.R.2    Kendall, G.3    Whitwell, G.4
  • 37
    • 0000150947 scopus 로고
    • Applying adaptive search algorithms to epistatic domains
    • Los Angeles, CA
    • L. Davis, "Applying adaptive search algorithms to epistatic domains," in Proc. 9th Int. Joint Conf. Artificial Intell., Los Angeles, CA, 1985, pp. 162-164.
    • (1985) Proc. 9th Int. Joint Conf. Artificial Intell , pp. 162-164
    • Davis, L.1
  • 38
    • 0002919029 scopus 로고
    • A hybrid genetic algorithm for pallet loading
    • London, U.K
    • P. Prosser, "A hybrid genetic algorithm for pallet loading," in Proc. 8th Eur. Conf. Artificial Intell., London, U.K., 1988, pp. 159-164.
    • (1988) Proc. 8th Eur. Conf. Artificial Intell , pp. 159-164
    • Prosser, P.1
  • 39
    • 0032710465 scopus 로고    scopus 로고
    • An improved bl-algorithm for genetic algorithms of the orthogonal packing of rectangles
    • D. Liu and H. Teng, "An improved bl-algorithm for genetic algorithms of the orthogonal packing of rectangles," Eur. J. Oper. Res., vol. 112, pp. 413-419, 1999.
    • (1999) Eur. J. Oper. Res , vol.112 , pp. 413-419
    • Liu, D.1    Teng, H.2
  • 40
    • 24944469055 scopus 로고    scopus 로고
    • Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
    • K. A. Dowsland, E. A. Herbert, G. Kendall, and E. Burke, "Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems," Eur. J. Oper. Res., vol. 168, pp. 390-402, 2006.
    • (2006) Eur. J. Oper. Res , vol.168 , pp. 390-402
    • Dowsland, K.A.1    Herbert, E.A.2    Kendall, G.3    Burke, E.4
  • 42
    • 0035200786 scopus 로고    scopus 로고
    • An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
    • E. Hopper and B. C. H. Turton, "An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem," Eur. J. Oper. Res., vol. 128, pp. 34-57, 2001.
    • (2001) Eur. J. Oper. Res , vol.128 , pp. 34-57
    • Hopper, E.1    Turton, B.C.H.2
  • 44
    • 0012004927 scopus 로고
    • Organizational learning within a learning classifier system,
    • M.S. thesis, Univ. Illinois, Chicago
    • J. R. Wilcox, "Organizational learning within a learning classifier system," M.S. thesis, Univ. Illinois, Chicago, 1995.
    • (1995)
    • Wilcox, J.R.1
  • 49
    • 0033704928 scopus 로고    scopus 로고
    • An enhanced perturbing algorithm for floorplan design using the o-tree representation
    • Y. Pang, C. K. Cheng, and T. Yoshimura, "An enhanced perturbing algorithm for floorplan design using the o-tree representation," in Proc. ACM Int. Phys. Design Symp., 2000, pp. 168-173.
    • (2000) Proc. ACM Int. Phys. Design Symp , pp. 168-173
    • Pang, Y.1    Cheng, C.K.2    Yoshimura, T.3
  • 50
    • 84949784966 scopus 로고    scopus 로고
    • FAST-SP: A fast algorithm for block placement based on sequence pair
    • X. Tang and D. F. Wong, "FAST-SP: A fast algorithm for block placement based on sequence pair," in Proc. LEEE Asia South Pacific Design Autom. Conf., 2001, pp. 521-526.
    • (2001) Proc. LEEE Asia South Pacific Design Autom. Conf , pp. 521-526
    • Tang, X.1    Wong, D.F.2
  • 51
    • 0344017702 scopus 로고    scopus 로고
    • An enhanced q-sequence augmented with empty-room-insertion and parenthesis trees
    • C. Zhuang, K. Sakanushi, L. Jin, and Y. Kajitani, "An enhanced q-sequence augmented with empty-room-insertion and parenthesis trees," Proc. Design Autom. Test Eur., pp. 61-68, 2002.
    • (2002) Proc. Design Autom. Test Eur , pp. 61-68
    • Zhuang, C.1    Sakanushi, K.2    Jin, L.3    Kajitani, Y.4
  • 53
    • 0033705078 scopus 로고    scopus 로고
    • Classical floorplanning harmful
    • San Diego, CA
    • A. B. Kahng, "Classical floorplanning harmful," in Proc. ISPD 2000 San Diego, CA, 2000, pp. 207-213.
    • (2000) Proc. ISPD 2000 , pp. 207-213
    • Kahng, A.B.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.