In this contribution, a parallel hybrid local search algorithm for the three-dimensional container loading problem (CLP) is proposed. First a simulated annealing method for the CLP is developed, which is then combined with an existing tabu search algorithm to form a hybrid metaheuristic....

The more-dimensional bin packing problem (BPP) considered here requires packing a set ofrectangular shaped items into a minimum number of identical rectangular shaped bins. All itemsmay be rotated and the guillotine constraint has to be respected. A straightforward heuristic ispresented that is...

The contribution presents a heuristic for the three-dimensional strip-packing problem (3D-SPP) with rectangular shaped pieces (boxes). The considered 3D-SPP can be formulated as follows: for a given set of boxes and a given longitudinal open container, determine a feasible arrangement of all...