| 一维下料问题的优化算法及其编程 |
| |
| 引用本文： | 李建星,谷安,徐广增,周韶威.一维下料问题的优化算法及其编程[J].机电一体化,2011(5):100-104. |
| |
| 作者姓名： | 李建星 谷安 徐广增 周韶威 |
| |
| 作者单位： | 南京航空航天大学 机电学院,江苏南京,210016 |
| |
| 摘 要： | 提出了一种下料方案的算法,结合Kantorovich建立的线性规划模型,给出适合一维下料问题的数学模型.设计了一种求最优解的算法,并对最优解进行了分析.利用计算机编程完整地实现了一维下料问题的优化,解决生产中广泛存在的一维下料问题.
|
| 关 键 词： | 一维下料问题 下料方案 线性规划 优化模型 优化算法 计算机编程 |
The Optimization Algorithm of One-dimensional Cutting Stock Problem and Its Programming Realization |
| |
| Abstract: | A method of the scheme of breaking material is introduced here. Combined with the model of linear programming created by Kantorovich, a mathematical model of one-dimensional cutting stock problem is designed. The optimal solution is selected and analysised. The optimization is simulated by computer programming, then the one-dimensional cutting stock problem widely existed in production is solved. |
| |
| Keywords: | one-dimensional cutting stock problem the scheme of breaking material linear programming optimization model optimization algorithm computer programming |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
