New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint.
Résumé
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.