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...

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....

This paper presents a parallel tabu search algorithm for the container loading problem with a single container to be loaded. The emphasis is on the case of a weakly heterogeneous load. The distributed-parallel approach is based on the concept of multi-search threads according to Toulouse et al....