| 下料问题的优化模型及其快速算法 |
| |
| 引用本文： | 庄陈坚,邓珠子,张中峰.下料问题的优化模型及其快速算法[J].数学理论与应用,2006,26(2):59-62. |
| |
| 作者姓名： | 庄陈坚 邓珠子 张中峰 |
| |
| 作者单位： | 中南大学数学科学与计算技术学院 长沙410083 |
| |
| 摘 要： | 结合生产实际中具体的下料问题,本文建立了该类问题的优化模型,并提出下料方式的遴选三准则,即高利用率优先准则,长度优先准则和时间优先准则.运用本文的算法对一维下料的利用率高达99.6%,机器时间4秒.对二维的利用率为98.9%,机器时间约7秒.
|
| 关 键 词： | 整数规划 下料问题 NP完全问题 |
| 收稿时间： | 11 14 2005 12:00AM |
The Optimization Model of Cutting Stock Problem and Its Celerity Algorithm |
| |
| Zhuang Chenjian ,Deng Zhuzi ,Zhang Zhongfeng.The Optimization Model of Cutting Stock Problem and Its Celerity Algorithm[J].Mathematical Theory and Applications,2006,26(2):59-62. |
| |
| Authors: | Zhuang Chenjian Deng Zhuzi Zhang Zhongfeng |
| |
| Institution: | School of Mathematical Sciences and Computing Technology,Central South University,Changsha,410083 |
| |
| Abstract: | 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-dimension problem,the utilization rate of reaches 99.6%,while machine time reaches 4 seconds,and for two-dimension the numbers are 98.9% and 7 seconds. |
| |
| Keywords: | integer-programming cutting stock problem NP-entirety problem |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
