| 一维下料方案的贪心算法优化 |
| |
| 引用本文： | 陈炼,马永生,刘光明.一维下料方案的贪心算法优化[J].南昌大学学报(工科版),2005,27(4):71-73,84. |
| |
| 作者姓名： | 陈炼 马永生 刘光明 |
| |
| 作者单位： | 南昌大学,信息工程学院,江西,南昌,330029 |
| |
| 摘 要： | 在对一维下料方案数学模型分析的基础上,提出了一种基于贪心算法的求解方法.主要思想是采用原材料利用率最高的切割方式优先的贪心选择策略,从而将问题转化为求解给定集合的子集和问题.实际应用表明,采用该算法求解出一维优化下料方案,可提高材料的利用率.
|
| 关 键 词： | 一维下料 贪心算法 子集和 优化 |
| 文章编号： | 1006-0456（2005）04-0071-03 |
| 收稿时间： | 2005-02-25 |
| 修稿时间： | 2005-02-25 |
Optimization for One Dimensional Cutting Stock Problem Based on Greedy Algorithms |
| |
| CHEN Lian,MA Yong-sheng,LIU Guang-ming.Optimization for One Dimensional Cutting Stock Problem Based on Greedy Algorithms[J].Journal of Nanchang University(Engineering & Technology Edition),2005,27(4):71-73,84. |
| |
| Authors: | CHEN Lian MA Yong-sheng LIU Guang-ming |
| |
| Affiliation: | School of Information Engineering, Nanchang University, Nanchang 330029, China |
| |
| Abstract: | Based on analyzing the mathematical models for one -dimensional cutting stock problem, a greedy algorithm has been constructed, which is an approximate algorithm. The main idea is using the most efficient cutting technique of the raw materials at the moment - the greedy - choice strategy, and then changing the problem to a subset problem. Result shows that the algorithm is valid and efficient. |
| |
| Keywords: | one cutting stock problem greedy algorithms subset problem optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
