CAJ | 학술논문

在最低水平线算法基础上，结合工匠砌墙策略，引入矩形块聚类思想，提出了一种矩形块装填问题的改进算法。该算法能使得矩形块装填紧凑，有效提升容器的利用率和提高算法执行速度。实验仿真结果表明，与BL、SA+BLF及PH相比，本文提出的改进算法对于求解矩形块装填问题十分有效。
재최저수평선산법기출상，결합공장체장책략，인입구형괴취류사상，제출료일충구형괴장전문제적개진산법。해산법능사득구형괴장전긴주，유효제승용기적이용솔화제고산법집행속도。실험방진결과표명，여BL、SA+BLF급PH상비，본문제출적개진산법대우구해구형괴장전문제십분유효。
An Improved algorithm is proposed for rectangle packing problem, which is based on the lowest horizontal algorithm, craftsman bricklaying policy and the rectangular block clustering idea. This algorithm can make all the rectangular blocks next to each other very compact, effectively improve the utilization rate of container and speed up the algorithm execution. The experimental simulation results show that, compared with BL, SA+BLF and PH, this algorithm proposed in this paper for solving rectangle packing problem is very effective.