基于模拟退火算法的矩形件排样  

The Rectangular Packing Based on Simulated Annealing Algorithm

作　　者：王桂宾[1] 周来水[1] 邓冬梅[1] 

机构地区：[1]南京航空航天大学机电学院,江苏南京210016

出　　处：《中国制造业信息化（学术版）》2006年第8期65-67,70,共4页

摘　　要：针对矩形件排样问题,提出了最低轮廓线最佳匹配算法。该算法根据最低轮廓线排放矩形,使板材浪费降至最低。并将其与模拟退火算法相结合,可获得近似最优的排样结果。最后给出不同规模的算例,结果表明,该算法比最低水平线算法排样结果好,是解决矩形件排放的有效方法。In order to resolve ：rectangular packing problem, it proposes a new heuristic placement aigorithm —— lowest outline best fit algorithm. The algorithm is hybridized with simulated annealing methodand can achieve the approximate furthest packing. Several examples of packing problems of different size give the details. The experimental results show that the hybrid heuristic algorithm is better than lowest line algorithm and is a good solution for rectangle packing problems.

关 键 词：矩形件排样 最低轮廓线最佳匹配算法 模拟退火算法 

分 类 号：TP391.72[自动化与计算机技术—计算机应用技术]