C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction
文献类型：期刊论文
| 作者 | Cui, Yaodong1; Liu, Zhiyong2 |
| 刊名 | OPTIMIZATION METHODS & SOFTWARE
 |
| 出版日期 | 2011 |
| 卷号 | 26期号:1页码:155-167 |
| 关键词 | cutting stock one-dimensional cutting pattern reduction look-ahead strategy |
| ISSN号 | 1055-6788 |
| DOI | 10.1080/10556780903420531 |
| 英文摘要 | This paper presents a sequential heuristic procedure (SHP) for the 1D cutting stock problem with pattern reduction, where a set of items are cut from stock bars of the same length to minimize the bar cost, with a secondary objective being to reduce the pattern count of the cutting plan. The SHP generates the current pattern to produce some items, and continues until all items are fulfilled. The algorithm uses two candidate sets (C-Sets). The first is the set of the candidate items for generating the current pattern. The second is the set of candidate patterns from which the current pattern is selected. The algorithm generates candidate patterns using the candidate items, determines the estimated cutting-plan cost (ECP-cost) of each pattern using a look-ahead strategy, and selects the pattern of the minimum ECP-cost as the current pattern. The computational results indicate that the algorithm is efficient. |
| 资助项目 | Special Foundation for Improving Science Research Conditions of Guizhou Province of China ; National Natural Science Foundation[60763011] ; National Natural Science Foundation[60752001] |
| WOS研究方向 | Computer Science ; Operations Research & Management Science ; Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000282171700008 |
| 出版者 | TAYLOR & FRANCIS LTD |
| 源URL | [http://119.78.100.204/handle/2XEOYT63/13217]  |
| 专题 | 中国科学院计算技术研究所期刊论文_英文 |
| 通讯作者 | Cui, Yaodong |
| 作者单位 | 1.Guangxi Univ, Sch Comp Elect & Informat, Nanning 530004, Peoples R China 2.Chinese Acad Sci, Inst Comp Technol, Beijing, Peoples R China |
| 推荐引用方式 GB/T 7714 | Cui, Yaodong,Liu, Zhiyong. C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction[J]. OPTIMIZATION METHODS & SOFTWARE,2011,26(1):155-167. |
| APA | Cui, Yaodong,&Liu, Zhiyong.(2011).C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction.OPTIMIZATION METHODS & SOFTWARE,26(1),155-167. |
| MLA | Cui, Yaodong,et al."C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction".OPTIMIZATION METHODS & SOFTWARE 26.1(2011):155-167. |
入库方式： OAI收割
来源：计算技术研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。