Meta-Heuristic算法在二维图形优化排样中的应用  

A Review of the Application of Meta-Heuristic Algorithms to 2D Packing Problems

作　　者：吴继聪 王兴波[1] WU Jicong;WANG Xingbo(Foshan University of Science and Technology,Foshan Guangdong 528000,China)

机构地区：[1]佛山科学技术学院,广东佛山528000

出　　处：《信息与电脑》2021年第17期57-59,共3页Information & Computer

基　　金：2018年广东省研究生教育创新计划项目“示范课程建设项目《现代设计理论与方法》”(项目编号:2018SFKC39);2020年佛山科学技术学院自由探索基金项目“基于CAD的二维图形优化排样智能算法研究”(项目编号:2020ZYTS15)。

摘　　要：二维排样优化问题是指如何在一个任意形状的母板上排满任意形状的样件使母板的利用率达到最大,二维排样优化方法分为精确方法和近似方法两大类。在求解二维排样这类NP难问题时,Meta-Heuristic算法是较好的解决方案。基于此,笔者针对Meta-Heuristic算法在二维排样问题的应用,综述了多种Meta-Heuristic算法在二维排样优化领域的研究现状,分析了不同算法的性能和适应场景,并总结了发展趋势。The two-dimensional nesting optimization problem refers to filling up samples of any shape on a motherboard of any shape to maximize the utilization of the motherboard.Two-dimensional nesting optimization methods are divided into two categories:accurate methods and approximate methods.When solving NP-hard problems such as two-dimensional nesting,the MetaHeuristic algorithm is a better solution.Therefore,this article focuses on the application of the MetaHeuristic algorithm to the two-dimensional nesting problem,and summarizes a variety of Meta-Heuristic algorithms in two-dimensional nesting optimization The current research status in the field,analyzes the performance and adaptation scenarios of different algorithms,and summarizes the development trend.

关 键 词：二维排样 Meta-Heuristic算法 研究现状 发展趋势 

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