摘要
下料问题在生产中普遍存在,优化下料可以提高原材料利用率,是企业增加经济效益的途径之一.对一维下料问题进行了探讨,给出一维下料问题的一些概念和数学模型,讨论解决一维下料问题的常用算法以及算法的适用情况,分析与之相关的一些问题和具体的实际应用.
Cutting stock problem exits widely in production. Optimizing cutting stock is a method to improve the using rate of materials and to increase the benefit of industry.It is significant for cutting stock problem research. The survey of one-dimensional cutting stock problem presents the general mathematic model of cutting stock problem with the discussion of the common method of one dimensional cutting stock problem and the algorithm situation used. Related problems and application are also discussed.
出处
《桂林工学院学报》
2004年第1期103-106,共4页
Journal of Guilin University of Technology
基金
广西自然科学基金资助项目(桂科基0236017).
关键词
下料
最优化
整数规划
cutting stock
optimization
integer programming
