摘要
针对一维型材的下料问题，建立了多规格型材的两类不同的整数规划模型，讨论两个模型的建立和求解算法的异同，综合比较后，指出不依赖于经验所建立的模型的优点，最后提出了有机地结合两种模型的设想．
In this paper,two different types of integer programming model are constructed on the cutting problem of one dimension multi type materials.Their sameness and differences are discussed. Through synthetical comparison,the advantages are pointed out for the model which does not dependent on the experiences.It is logical to assume the combination of two models.
出处
《武汉交通科技大学学报》
1998年第4期373-375,共3页
Journal of Wuhan University of Technology(Transportation Science & Engineering)
基金
湖北省"九五"重点科技项目
关键词
整数规划
遗传算法
下料问题
材料
节约
算法
integer programming
branch and bound
computation complexity
genetic algorithm
