A steplike stacking algorithm was prooposed to solving 2D rectangular packing problem. The algorithm was based on a steplike heuristic rule and probabilistic backtracking algorithm. For the zero-wasted problem, the algorithm spends less on finding the optimal solution than other methods. It also demonstrated fairly good performance on solving none-zero-waste problems. Two well known test cases were executed, and verified that our proposed algorithm was very effective.%针对二维矩形Packing问题,提出了一种沿阶梯线轮廓进行布局矩形的启发式算法.该算法基于"阶梯式堆码"的启发式规则,能够快速地对矩形块进行紧靠布局.为避免算法陷入局部最优,算法采用随机回溯策略在选择矩形和阶位上扩大搜索范围.结果表明,算法对于浪费面积为零的矩形全Packing问题,能够在极短的时间内找到最优解,同时它也可以很好地求解非零浪费问题.采用国际公认的两个算例进行测试,证明文中算法是非常高效的.
展开▼
