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

Analysis patterns have recently shown their great potential to enhance the set-up of models inobject-oriented analysis. This report attempts to summarise the present state of literature on thesubject of analysis patterns. It is organised in two main parts. In the first part, we present...

Given a set of rectangular pieces and a rectangular container, the two-dimensional knapsackproblem (2D-KP) consists of orthogonally packing a subset of the pieces within the container suchthat the sum of the values of the packed pieces is maximized. If the value of a piece is given by itsarea...