摘要
在对一维下料方案数学模型分析的基础上,提出了一种基于贪心算法的求解方法.主要思想是采用原材料利用率最高的切割方式优先的贪心选择策略,从而将问题转化为求解给定集合的子集和问题.实际应用表明,采用该算法求解出一维优化下料方案,可提高材料的利用率.
Based on analyzing the mathematical models for one -dimensional cutting stock problem, a greedy algorithm has been constructed, which is an approximate algorithm. The main idea is using the most efficient cutting technique of the raw materials at the moment - the greedy - choice strategy, and then changing the problem to a subset problem. Result shows that the algorithm is valid and efficient.
出处
《南昌大学学报（工科版）》
CAS
2005年第4期71-73,84,共4页
Journal of Nanchang University(Engineering & Technology)
关键词
一维下料
贪心算法
子集和
优化
one cutting stock problem
greedy algorithms
subset problem
optimization
