Active-set sequential quadratic programming method with compact neighbourhood algorithm for the multi-polygon mass production cutting-stock problem with rotatable polygons

M. T. Yu, T. Y. Lin*, Ching-Hua Hung

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

The cutting-stock problem, which considers how to arrange the component profiles on the material without overlaps, can increase the utility rate of the sheet stock, and is thus a standard constrained optimisation problem. In some applications the components should be placed with specific orientations, but in others the components may be placed with any orientation. This study presents an overlap index and it is much more suitable for the active-set SQP method which can reduce the time spend for constraint consideration. Using this method, various object orientations can be considered easily and the number of object on the sheet stock can be improved by up to eight percent.

Original languageEnglish
Pages (from-to)148-161
Number of pages14
JournalInternational Journal of Production Economics
Volume121
Issue number1
DOIs
StatePublished - 1 Sep 2009

Keywords

  • Active-set
  • Cutting-stock problem
  • Material saving
  • Rotatable
  • Sequential quadratic programming

Fingerprint Dive into the research topics of 'Active-set sequential quadratic programming method with compact neighbourhood algorithm for the multi-polygon mass production cutting-stock problem with rotatable polygons'. Together they form a unique fingerprint.

Cite this