TY - JOUR
A2 - Hifi, Mhand
AU - Bekrar, Abdelghani
AU - Kacem, Imed
PY - 2009
DA - 2009/07/21
TI - An Exact Method for the 2D Guillotine Strip Packing Problem
SP - 732010
VL - 2009
AB - We consider the two-dimensional strip packing problem with guillotinecuts. 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 ofcuts that go from one edge to the opposite edge (guillotine constraint). To solve this problem,we use a dichotomic algorithm that uses a lower bound, an upper bound, and a feasibility testalgorithm. The lower bound is based on solving a linear program by introducing new validinequalities. A new heuristic is used to compute the upper bound. Computational resultsshow that the dichotomic algorithm, using the new bounds, gives good results compared toexisting methods.
SN - 1687-9147
UR - https://doi.org/10.1155/2009/732010
DO - 10.1155/2009/732010
JF - Advances in Operations Research
PB - Hindawi Publishing Corporation
KW -
ER -