A tree search algorithm for solving the multi‐dimensional strip packing problem with guillotine cutting constraint

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 anarrangement of all boxes within the container so that the required length is minimised. The 2D‐SPP isanalogously defined. The proposed TRSA is based on a tree search algorithm for the containerloading problem that was suggested by Fanslau and Bortfeldt (2010). The TRSA generates guillotinepacking patterns throughout. In a comparison with all recently proposed 3D‐SPP methods the TRSAperforms best. Fine results are also achieved for the 2D‐SPP.