求解矩形切割问题的改进启发式动态规划算法.pdfVIP

2019 NCTCS2019 全国理论计算机科学学术年会 （ ） 求解矩形切割问题的改进启发式动态规划算法* + 尹爱华, 陈冲, 胡冬萍, 黄江海，杨帆 江西财经大学 软件与物联网工程学院, 江西 南昌 330013 + 通讯作者 E-mail: 1303841543@，硕士生 摘 要: 讨论了含砂眼的二维切割问题，从包含多个砂眼的大矩形板材切割出若干给定尺寸和方向的小矩 形块，所切割出的每种小矩形块数量不限，每个切割都限制为一刀切且切割线不能切到砂眼。另外，所切 割出的小矩形块不能含有砂眼，目标是最大化切割小矩形块的总价值。为了解决上述问题，提出一种改进 启发式-动态规划算法(Improved Heuristic-Dynamic Programming, IHDP)，并证明了关于其复杂度的重要定 理。该算法降低了离散集规模，用小矩形块的宽和高建立一维背包问题，利用所得解与砂眼的左右边沿和 上下边沿构造两个离散集，以离散集的每一个元素做试切线进行子问题划分，放弃穿过砂眼的切割线。该 算法计算了国际公认的14 个典型算例，实验结果表明，它得到了这些实例的最优解，其计算效率比最新 文献算法高了近十倍。 关键词: 砂眼; 一刀切；离散集；动态规划；NP-难 文献标志码：A 中图分类号：TP301.5 An Improved Heuristic-Dynamic Programming Algorithm for Rectangular CuttingProblem* + YINAihua,CHEN Chong ,HU Dongping,HUANGJianghai,YANG Fan School of Software and Internet of Things Engineering, Jiangxi University of Finance and Economics, Nanchang Jiangxi 330013 Abstract: The two-dimensional cutting problem with defects is discussed.A small rectangular block of a given size and direction is cut from a large rectangular plate containing aplurality of defects.The number of each small rectangular block cut is not limited, and each cut is to be of the guillotine and the cutting line cannot be cut to the defects. In addition, the small rectangular blocks that are cut cannot contain defects, and the goal is to maximize the total value of cutting small rectangular blocks. In order to solve the above problems, an improved Heuristic-Dynamic Programming (IHDP) algorithm is proposed to prove the important theorem about its complexity.The algorithm reduces the size of the discrete set, establishes the one-dimensional knapsack problem *The