A Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem

Authors

  • Abdelghani Bekrar ICD-LOSI, (CNRS FRE 2848) UNIVERSITE DE TECHNOLOGIE DE TROYES FRANCE
  • Chengbin Chu ICD-LOSI, (CNRS FRE 2848) UNIVERSITE DE TECHNOLOGIE DE TROYES FRANCE
  • Imed Kacem ICD-LOSI, (CNRS FRE 2848) UNIVERSITE DE TECHNOLOGIE DE TROYES FRANCE
Abstract:

In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a dichotomous algorithm and a branch and price method. The three methods were carried out and compared on literature instances.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Exact algorithms for the two-dimensional strip packing problem with and without rotations

We examine various strategies for exact approaches to the 2dimensional strip packing problem (2SP) with and without rotations of 90 degrees. We first develop a branch-and-bound algorithm based on the sequence pair representation. Next, we focus on the perfect packing problem (PP), which is a special case of 2SP where all given rectangles are required to be packed without wasted space, and desig...

full text

A genetic algorithm for the two-dimensional strip-packing problem

The paper presents a genetic algorithm (GA) for the two-dimensional strip-packing problem (SPP) with rectangular shaped pieces. Both the non-guillotinable SPP and the guillotinable SPP can be tackled. The genetic algorithm has been derived from a GA that was proposed earlier for solving the container-loading problem (CLP) with a single container to be loaded. The characteristic features of the ...

full text

Exact Algorithms for the 2-Dimensional Strip Packing Problem with and without Rotations

We propose exact algorithms for the 2-dimensional strip packing problem (2SP) with and without 90 degrees rotations. We first focus on the perfect packing problem (PP), which is a special case of 2SP, wherein all given rectangles are required to be packed without wasted space, and design branch-and-bound algorithms introducing several branching rules and bounding operations. A combination of th...

full text

An Exact Method for the 2D Guillotine Strip Packing Problem

We consider the two-dimensional strip packing problem with guillotine cuts. The problem consists in packing a set of rectangular items on one strip of width W and infinite height. The items packed without overlapping must be extracted by a series of cuts that go from one edge to the opposite edge guillotine constraint . To solve this problem, we use a dichotomic algorithm that uses a lower boun...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 1  issue 2

pages  151- 170

publication date 2007-09-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023