摘要
本文给出了一种求解无限制板材下料问题的动态规划解法,对该算法的计算复杂度进行了分析.并针对算法的特点提出了改进方案.通过理论分析得到改进方案的适用范围,并描述了这一改进动态规划算法的应用前景.数值实验表明,该算法可以缩简传统动态规划算法的计算时间和空间,同时得到解的最优值.
In this paper, a new dynamic programming algorithm for unconstrained 2D stuck cutting problem is presented. The complexity of this new algorithm is analyzed. An improved method is also presented according to the property of the new algorithm, with respact to the theoretical analysis, the applicable scope of the improved method is given and the future applicability is described. It has been shown in numerical experiments that compared with the original dynamic programming method, the improved method can save the computational time and space with an optimal solution.
出处
《信息与控制》
CSCD
北大核心
2003年第1期14-18,共5页
Information and Control
