.png){kind=icon}
返回
An evolutionary algorithm for the one-dimensional cutting stock problem
.png){kind=icon}
PRE
AI
DOI：10.1111/j.1475-3995.2009.00760.x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper deals with the one-dimensional integer cutting stock problem, which consists of cutting a set of available objects in stock in order to produce ordered smaller items in such a way as to minimize the waste of material. The case in which there are various types of objects available in stock in limited quantities is studied. A new heuristic method based on the evolutionary algorithm concept is proposed to solve the problem. This heuristic is empirically analyzed by solving randomly generated instances and the results are compared with other methods from the literature.
Keyword:
integer optimization
cutting stock problem
evolutionary algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
.png){kind=icon}
A hybrid heuristic to reduce the number of different patterns in cutting stock problems一种混合启发式方法，用于减少切割库存问题中不同模式的数量
PREAI
分享收藏分享收藏Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths具有有限多个库存长度的一维切削库存问题的启发式方法
PREAI
分享收藏
查看更多内容