In the container relocation problem (CRP) n items are given that belong to G different itemgroups (g = 1,…,G). The items are piled up in up to S stacks with a maximum stack height H.A move can either shift one item from the top of a stack to the top of another one (relocation)or pick an item...

The article presents a tree search algorithm (TRSA) for the strip packing problem in two and threedimensions with guillotine cutting constraint. In the 3D‐SPP we are given a set of rectangular items(boxes) and a container with fixed width and height but variable length. We have to determine...

This case study deals with a two-stage packing problem that has to be solved in thedaily distribution process of a Portuguese trading company. At the first stage boxesincluding goods are to be packed on pallets while at the second stage these pallets areloaded into one or more trucks. The boxes...