2019 NCTCS2019
全国理论计算机科学学术年会 ( )
求解矩形切割问题快速启发式-动态规划算法*
尹爱华, 黄江海+, 胡冬萍, 陈冲
江西财经大学 软件与物联网工程学院, 南昌 330013
+ 通讯作者 E-mail: 1982589849@,硕士生
摘 要: 讨论了含砂眼的二维矩形切割问题。目标是在满足若干约束条件的前提下从含有多个砂眼的大矩
形原板上切割出已给定高和宽的小矩形块,使得切割下来的小矩形块的面积和最大。约束条件为每一次切
割操作必须是一刀切并且不能穿过砂眼,每一类小矩形块的数量不限且保持给定的方向。将该问题看做是
用矩形块覆盖原板,提出一种基于动态规划的快速启发式算法(Quick Heuristic-Dynamic Programming,
QHDP)。首先,根据小矩形块的高和宽建立一维背包问题,分别生成高效的离散集,然后,以离散集中的
每一个值作为可能的切割线坐标进行子问题划分。如果某个切割线穿过砂眼,则剪切掉该递归分支。该算
法计算了国际公认的14 个典型算例,实验结果表明,它都得到了全部算例的最优解,且计算时间少于当
前文献中最好算法的十分之一。算法复杂度得到分析和证明。
关键词: 二维cutting 问题; 砂眼; 最优化; 动态规划;NP-难
文献标志码:A 中图分类号:TP301.5
A Quick Heuristic-Dynamic Programming for The Two-Dimensional Cutting
Problem*
+
YINAihua,HUANGJianghai ,HU Dongping, CHEN Chong
Schoolof SoftwareandInternet ofThingsEngineering,JiangxiUniversity ofFinanceandEconomics,Nanchang
Jiangxi 330013
Abstract: The two-dimensional rectangular cutting problem with defects is discussed. The goal is to cut a small
rectangular block of a given height andwidth from a large rectangular object containing aplurality of defects on the
premise of satisfying several constraints, so that the sum of the area of the cut small rectangular blocks are
maximized.The constraint is that each cutting operation must be guillotine and cannot passthrough the defects, and
the number of small rectangular blocks of each type is not limited and maintains a given direction. The problem is
regarded as covering the original plate with small rectangular block, and a Quick Heuristic-Dynamic Programming
(QHDP) algorithm is proposed. Firstly, a one-dimensional knapsack problem is established according to the height
andwidth o