New fast heuristics for the 2d strip packing problem with guillotine constraint

Authors:
Minh Hoang Ha;François Clautiaux;Saïd Hanafi;Christophe Wilbaut
Affiliations:
Ecole des Mines de Nantes, IRCCyN UMR CNRS;Université des Sciences et Technologies de Lille, LIFL UMR CNRS;Université de Valenciennes et du Hainaut-Cambrésis, LAMIH FRE CNRS;Université de Valenciennes et du Hainaut-Cambrésis, LAMIH FRE CNRS
Venue:
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Year:
2010

Citing 8
Cited 0

Record breaking optimization results using the ruin and recreate principle

Journal of Computational Physics
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems

INFORMS Journal on Computing
Heuristics for large strip packing problems with guillotine patterns: an empirical study

Metaheuristics
A new heuristic recursive algorithm for the strip rectangular packing problem

Computers and Operations Research
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

Operations Research
A new graph-theoretical model for k-dimensional guillotine-cutting problems

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A new lower bound for the non-oriented two-dimensional bin-packing problem

Operations Research Letters
A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose new and fast level-packing algorithms to solve the two-dimensional strip rectangular packing problem with guillotine constraints. Our methods are based on constructive and destructive strategies. The computational results on many different instances show that our method leads to the best results in many cases among fast heuristics.