摘要
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.
| 原文 | English |
|---|---|
| 頁（從 - 到） | 75-82 |
| 頁數 | 8 |
| 期刊 | Journal of the Chinese Institute of Industrial Engineers |
| 卷 | 19 |
| 發行號 | 1 |
| DOIs | |
| 出版狀態 | Published - 1 1月 2002 |