A heuristic dynamic-programming algorithm for 2D unconstrained guillotine cutting
文献类型：会议论文
| 作者 | Song X(宋翔); Chu CB(储诚斌); Nie YY(聂义勇) |
| 出版日期 | 2004 |
| 会议名称 | 2004 IADIS International Conference Applied Computing |
| 会议日期 | March 23-26, 2004 |
| 会议地点 | Lisbon, Portugal |
| 关键词 | Unconstraint knapsack problem Heuristic dynamic programming |
| 页码 | 527-534 |
| 中文摘要 | In this paper, a heuristic dynamic-programming recursion is proposed for solving unconstrained 2D knapsack problem efficiently. The algorithm we propose is an incompletely enumerative method, in which some intricate cutting patterns may not be enumerated. Compared with the traditional dynamic-programming, the algorithm gives a high percentage of optimal solutions (93%) with a much lowered computational complexity. Some theoretical analyses for the algorithm are performed. Computational results are given for small and medium-sized problems. |
| 产权排序 | 1 |
| 会议录 | Proceedings of the 2004 IADIS International Conference Applied Computing
 |
| 语种 | 英语 |
| 源URL | [http://ir.sia.cn/handle/173321/9726]  |
| 专题 | 沈阳自动化研究所_工业信息学研究室_工业控制系统研究室 |
| 推荐引用方式 GB/T 7714 | Song X,Chu CB,Nie YY. A heuristic dynamic-programming algorithm for 2D unconstrained guillotine cutting[C]. 见:2004 IADIS International Conference Applied Computing. Lisbon, Portugal. March 23-26, 2004. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。