摘要
结合生产实际中具体的下料问题,本文建立了该类问题的优化模型,并提出下料方式的遴选三准则,即高利用率优先准则,长度优先准则和时间优先准则.运用本文的算法对一维下料的利用率高达99.6%,机器时间4秒.对二维的利用率为98.9%,机器时间约7秒.
Combining of cutting stock problem of the production practice, in this paper, we found a optimization model of this problem .and promotes three selecting rules of cutting stock problem-the priority of the high rate of Utilization .length and time. Depending on the arithmetic in this paper ,for one-dlmension problem.the utilization rate of reaches 99.6% ,while machine time reaches 4 seconds ,and for two-dlmenslon the numbers are 98.9^ and 7 seconds.
出处
《数学理论与应用》
2006年第2期59-62,共4页
Mathematical Theory and Applications
关键词
整数规划
下料问题
NP完全问题
integer-programmlng cutting stock problem NP-entirety problem
