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 language | English |
---|---|
Pages (from-to) | 75-82 |
Number of pages | 8 |
Journal | Journal of the Chinese Institute of Industrial Engineers |
Volume | 19 |
Issue number | 1 |
DOIs | |
State | Published - 1 Jan 2002 |
Keywords
- Optimization
- Packing
- Piecewise linearization