A global optimization method for packing problems

Nian Ze Hu, Jung Fa Tsai, Han-Lin Li

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

The packing optimization problem is to seek the best way of placing a given set of rectangular boxes within a rectangular container with minimal volume. Current packing optimization methods (Chen et al., Li and Chang) are either difficult to find an optimal solution or required to use too many extra 0-1 variables to solve the problems. This paper proposes a new method for finding the global optimum of the packing problem within tolerable error based on piecewise linearization techniques, which is more computationally efficient than current methods.

Original languageEnglish
Pages (from-to)75-82
Number of pages8
JournalJournal of the Chinese Institute of Industrial Engineers
Volume19
Issue number1
DOIs
StatePublished - 1 Jan 2002

Keywords

  • Optimization
  • Packing
  • Piecewise linearization

Fingerprint Dive into the research topics of 'A global optimization method for packing problems'. Together they form a unique fingerprint.

  • Cite this