The capacitated vehicle routing problem with three‐dimensional loading constraints combinescapacitated vehicle routing and three‐dimensional loading with additional packing constraints whichconcern, for example, unloading operations. An efficient hybrid algorithm including a tabu...

The paper presents a tree search algorithm for the three-dimensional container loading problem(3D-CLP). The 3D-CLP is the problem of loading a subset of a given set of rectangularboxes into a rectangular container so that the packed volume is maximized. The method hastwo variants: the packing...

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