The three-dimensional bin packing problem is concerned with packing a given set of rectangular items into rectangular bins. We are interested in solving real-life problems where rotations of items are allowed and the packings must be packable and stable. Load bearing of items is taken into account as well. An on-line heuristic and an exact method have been developed and compared on real-life instances and as well on some benchmark instances. The on-line algorithm consistently reaches good solutions within a few seconds. The exact method is able to improve the solutions, but a significant amount of computation time is required.
| Publication status | Published - 2003 |
|---|