An improved heuristic for the two-dimensional cutting stock problem with multiple sized stock sheets

被引:0
|
作者
El-Bouri, Ahmed
Rao, Jinsong
Popplewell, Neil
Balakrishnan, S.
机构
[1] Ryerson Univ, Dept Mech & Ind Engn, Toronto, ON M5B 2K3, Canada
[2] Univ Manitoba, Dept Mech & Ind Engn, Winnipeg, MB R3T 5V6, Canada
关键词
two-dimensional cutting stock problem; multiple stock sheets; bin packing; trim loss; heuristic;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper deals with the problem of cutting multiple sized, rectangular stock sheets into smaller rectangular order pieces to satisfy a given bill of material with minimum him loss. A new heuristic procedure is devised that finds; an effective stock sheet selection sequence, given that the layout procedure used for individual sheets is known. Results for randomly created test problems are compared with those from three previously published procedures. The new heuristic is shown to give a balanced trade-off between trim loss reduction and computational effort, especially as the number of available stock sheet sizes increases.
引用
收藏
页码:198 / 206
页数:9
相关论文
共 50 条