实用下料的数学模型  

The Mathematical Models on the Practical Cutting Stock Problem

作　　者：陈璐[1] 黄伟健[1] 冯真[1] 数模指导组 

机构地区：[1]信息工程大学,河南郑州450004

出　　处：《数学的实践与认识》2005年第7期58-63,共6页Mathematics in Practice and Theory

摘　　要：考虑到整数规划模型的下料方式数量难以穷尽的问题,本文以原材料最少为目标,采用启发式多级序列线性优化的方法建立一维下料模型.对于二维下料问题,采用降维启发式的方法即通过形成“板条”把二维下料问题化为一维下料问题.In consideration of the unlimited ways to cut the stock by the general integer programming model, In this paper,with the goal of minimizing the original material, we build up the 1-dimensional cutting-stock model by inspiring multilevel-sequences-linear approach. As to the 2-dimensional cutting-stock problem, we adopt the algorithm of inspireing decline of the dimensions to “batten”, by which we can descend the 2-dimensional problem to 1-dimensional＇s.

关 键 词：整数规划模型 下料模型 多级序列线性优化 组合优化 数学模型 

分 类 号：O221.4[理学—运筹学与控制论]