Multiagent evolutionary algorithm for floorplanning using moving block sequence

Focusing on the floorplan problem, a non-slicing representation, moving block sequence(MBS), is introduced and suitable for evolutionary computation since no extra constraints are exerted on the solution space. Then we design a multiagent evolutionary algorithm with the intrinsic properties of MBS in mind, which is named as MAEA-MBS. In experiments, 17 benchmarks from MCNC and GSRC are used to test the performance of MAEA-MBS. The experimental results are compared with other 9 existing well-designed algorithms and demonstrate that the algorithm is quite promising.

[1]  Takeshi Yoshimura,et al.  Floorplanning using a tree representation , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Jing Liu,et al.  A multiagent evolutionary algorithm for constraint satisfaction problems , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[3]  Jing Liu,et al.  Moving Block Sequence and Organizational Evolutionary Algorithm for General Floorplanning , 2005, CIS.

[4]  Evangeline F. Y. Young,et al.  Twin binary sequences: a non-redundant representation for general non-slicing floorplan , 2002, ISPD '02.