A global optimization method for packing problems

Jung Fa Tsai*, Han-Lin Li

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

Abstract

The objective of packing problems is to determine an optimal way of placing a given set of three-dimensional (3D) rectangular cartons within a minimum volume 3D rectangular container. Current packing optimization methods either use too many extra 0-1 variables or find it difficult to obtain a globally optimal solution. This study proposes an efficient method for finding the global optimum of packing problems. First the traditional packing optimization problem is converted into an equivalent program containing many fewer 0-1 variables than contained in current methods. Then the global optimum of the converted program is found by utilizing piecewise linearization techniques. The numerical examples demonstrate that the proposed method is capable of finding the global optimum of a packing problem.

Original languageEnglish
Pages (from-to)687-700
Number of pages14
JournalEngineering Optimization
Volume38
Issue number6
DOIs
StatePublished - 1 Sep 2006

Keywords

  • Global 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