期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2012
卷号：9
期号：2
出版社：IJCSI Press
摘要：This paper presents the strategies of bestfit Bottom-Left by Right first (BL-Rf) and Bottom-Left by Top first (BL-Tf) (BL-Rf/BL-Tf) for block division selection. The block solution inspires from Space Allocation Problems (SAPs) and Packing Problems (PPs), however the huge number of possible solutions the heuristic with guided strategies required for the satisfied results. The mathematical expression was formulated to represent this problem. The independent strategy by BL-Rf or BL-Tf has inconsistent result and led to fail to promote optimal solution. Therefore, BL-Rf/BL-Tf attempts to improve the result performance. The strategies applied in GA, the generated numbers of optimal solutions were stated for the purpose of analysis. The BL-Rf/BL-Tf promotes more solutions number than the independent strategies and indicates that result quality and time efficiency are better.
关键词：Genetic Algorithm; Space Allocation Problems; Block Division; Shape Assignment
