The knapsack container loading problem is the problem of loading a subset of rectangular boxes into a rectangular container of fixed dimensions such that the volume of the packed boxes is maximized. Lower Bound on the 3DBPP (Three Dimensional Bin Packing Problem) approach is proposed, which decomposes the problem into a number of layers which again are split into a number of strips. The packing of a strip may be formulated and solved optimally as a Knapsack Problem with capacity equal to the width or height of the container. The Depth of a layer as well as the thickness of each strip is decided through a branch-and-bround approach where at each node only a subset of branches is explored. Several rangking rules for the selection of the most promising layer depths and strip widths.Trial using Lower Bound Algorithm exseed the loading box problem into three dimension space and their position.

The knapsack container loading problem is the problem of loading a subset of rectangular boxes into a rectangular container of fixed dimensions such that the volume of the packed boxes is maximized. Lower Bound on the 3DBPP (Three Dimensional Bin Packing Problem) approach is proposed, which decomposes the problem into a number of layers which again are split into a number of strips. The packing of a strip may be formulated and solved optimally as a Knapsack Problem with capacity equal to the width or height of the container. The Depth of a layer as well as the thickness of each strip is decided through a branch-and-bround approach where at each node only a subset of branches is explored. Several rangking rules for the selection of the most promising layer depths and strip widths.Trial using Lower Bound Algorithm exseed the loading box problem into three dimension space and their position.

https://elib.unikom.ac.id/gdl.php?mod=browse&op=read&id=jbptunikompp-gdl-s1-2007-angelinevo-5693