Annals of Operations Research

, Volume 196, Issue 1, pp 53–71

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

Authors

    • Department of Information SystemsUniversity in Hagen
  • Sabine Jungmann
    • Department of Information SystemsUniversity in Hagen
Article

DOI: 10.1007/s10479-012-1084-7

Cite this article as:
Bortfeldt, A. & Jungmann, S. Ann Oper Res (2012) 196: 53. doi:10.1007/s10479-012-1084-7
  • 210 Views

Abstract

The article presents a tree search algorithm (TRSA) for the strip packing problem in two and three dimensions with guillotine cutting constraint. In the 3D-SPP a set of rectangular items (boxes) and a container with fixed width and height but variable length are given. An arrangement of all boxes within the container has to be determined so that the required length is minimised. The 2D-SPP is analogously defined. The proposed TRSA is based on a tree search algorithm for the container loading problem by Fanslau and Bortfeldt (INFORMS J. Comput. 22:222–235, 2010). The TRSA generates guillotine packing patterns throughout. In a comparison with all recently proposed 3D-SPP methods the TRSA performs very competitive. Fine results are also achieved for the 2D-SPP.

Keywords

Strip packingOpen dimension problemGuillotine cuttingTree search

Copyright information

© Springer Science+Business Media, LLC 2012