Heuristic algorithms for the weight constrained 3-dimensional bin packing model

In this paper we consider a modified three dimensional bin packing problem which appears in loading vehicles during planning transportation. This model is a common generalization of two multidimensional bin packing models (box packing and vector packing). We analyse two simple heuristic algorithms for the solution of the problem and their extension with the interval preparation method. We test these algorithms by experiments on test data derived from the literature and show that in some test classes using the extension we can obtain better solutions, and the time requirement does not grow tremendously.