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

Ahmed El-Bouri, Jinsong Rao, Neil Popplewell, S. Balakrishnan

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

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 trim 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. Significance: The approach presented in this paper significantly reduces trim loss in sheet cutting operations, with only modest increases in computational effort in comparison to the quickest among a selection of existing heuristics.

Original languageEnglish
Pages (from-to)198-206
Number of pages9
JournalInternational Journal of Industrial Engineering : Theory Applications and Practice
Volume13
Issue number2
Publication statusPublished - Jun 2006

Keywords

  • Bin packing
  • Heuristic
  • Multiple stock sheets
  • Trim loss
  • Two-dimensional cutting stock problem

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

An improved heuristic for the two-dimensional cutting stock problem with multiple sized stock sheets. / El-Bouri, Ahmed; Rao, Jinsong; Popplewell, Neil; Balakrishnan, S.

In: International Journal of Industrial Engineering : Theory Applications and Practice, Vol. 13, No. 2, 06.2006, p. 198-206.

Research output: Contribution to journalArticle

@article{ee821d5a9cac4d2dad148ccd78354b08,
title = "An improved heuristic for the two-dimensional cutting stock problem with multiple sized stock sheets",
abstract = "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 trim 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. Significance: The approach presented in this paper significantly reduces trim loss in sheet cutting operations, with only modest increases in computational effort in comparison to the quickest among a selection of existing heuristics.",
keywords = "Bin packing, Heuristic, Multiple stock sheets, Trim loss, Two-dimensional cutting stock problem",
author = "Ahmed El-Bouri and Jinsong Rao and Neil Popplewell and S. Balakrishnan",
year = "2006",
month = "6",
language = "English",
volume = "13",
pages = "198--206",
journal = "International Journal of Industrial Engineering : Theory Applications and Practice",
issn = "1072-4761",
publisher = "University of Cincinnati",
number = "2",

}

TY - JOUR

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

AU - El-Bouri, Ahmed

AU - Rao, Jinsong

AU - Popplewell, Neil

AU - Balakrishnan, S.

PY - 2006/6

Y1 - 2006/6

N2 - 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 trim 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. Significance: The approach presented in this paper significantly reduces trim loss in sheet cutting operations, with only modest increases in computational effort in comparison to the quickest among a selection of existing heuristics.

AB - 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 trim 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. Significance: The approach presented in this paper significantly reduces trim loss in sheet cutting operations, with only modest increases in computational effort in comparison to the quickest among a selection of existing heuristics.

KW - Bin packing

KW - Heuristic

KW - Multiple stock sheets

KW - Trim loss

KW - Two-dimensional cutting stock problem

UR - http://www.scopus.com/inward/record.url?scp=34047148783&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34047148783&partnerID=8YFLogxK

M3 - Article

VL - 13

SP - 198

EP - 206

JO - International Journal of Industrial Engineering : Theory Applications and Practice

JF - International Journal of Industrial Engineering : Theory Applications and Practice

SN - 1072-4761

IS - 2

ER -