为求解二维矩形条带装箱问题,提出了一种新颖而有效的启发式算法.算法主要包括矩形装载适应度的计算规则和树型迭代搜索规则,通过选择最高适应度的矩形来装载空间.对大量国际上公认的Benchmark问题实例的计算结果表明,相对于当前的很多著名算法,提出的算法更加有效.
The paper presents a novel and effective heuristic algorithm for the two-dimensional rectangular strip packing problem.This algorithm is mainly based on the best-fit value and tree recursive search rules and selects the maximal fitness rectangle to the packing the space.The computational results on a large number of Benchmark problems have shown that this algorithm is more effective than the existing novel algorithm.