摘要
针对小矩形切割的二维排样问题,尤其是对玻璃或厚钢板等材料,在切割时定向一次性切割到头的排布,结合综合蚂蚁算法和模拟退火算法思想,提出了一种最低水平线与填充式算法相结合的启发式排样算法。通过对计算机上随机产生的实验数据进行模拟,实现了自动排样。实验表明,该算法提高了单次切割的材料利用率,得到较好的排样效果。
The packing problem of cutting the optimal layout of small rectangles on a pallet is considered. Combining the ant algorithm with the simulated annealing algorithm, a mixed new algorithm of layout optimization, which is implemented by the lowest horizontal and filling algorithm, is proposed in this paper. In order to investigate the computation, numerical tests with randomly generated instances are carried out. By comparison, the solutions show the robust effectiveness of this approach. The results show that this approach achieves a better effect.
出处
《电子科技》
2011年第1期50-51,54,共3页
Electronic Science and Technology
关键词
排样
矩形件
启发式
填充式算法
packing problem
rectangle
heuristics
filling algorithm
