Two-stage and one-group two-dimensional guillotine cutting problems with defects: a CP-based algorithm and ILP formulations

2021 ◽  
pp. 1-20
Author(s):  
Mateus Martin ◽  
Reinaldo Morabito ◽  
Pedro Munari
Keyword(s):  
Two Dimensional ◽  
Two Stage ◽  
Cutting Problems ◽  
Guillotine Cutting

On a Genetic-Tabu Search Based Algorithm for Two-Dimensional Guillotine Cutting Problems

2012 ◽  
Vol 4 (2) ◽  
pp. 26-40 ◽  
Author(s):  
Hamza Gharsellaoui ◽  
Hamadi Hasni
Keyword(s):  
Tabu Search ◽  
Hybrid Approach ◽  
Search Method ◽  
Two Dimensional ◽  
Whole Number ◽  
Infinite Height ◽  
Tabu Search Method ◽  
Problem Instances ◽  
Cutting Problems ◽  
Guillotine Cutting

The paper deals with the purpose of one hybrid approach for solving the constrained two-dimensional cutting (2DC) problem. The authors study this hybrid approach that combines the genetic algorithm and the Tabu search method. For this problem, they assume a packing of a whole number of rectangular pieces to cut, and that all cuts are of guillotine type in one sheet of a fixed width and an infinite height. Finally, they undertake an extensive experimental study with a large number of problem instances extracted from the literature by the Hopper’s benchmarks in order to support and to prove their approach and to evaluate the performance.

Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming

2016 ◽  
Vol 28 (4) ◽  
pp. 736-751 ◽  
Author(s):  
Fabio Furini ◽  
Enrico Malaguti ◽  
Dimitri Thomopulos
Keyword(s):  
Integer Programming ◽  
Two Dimensional ◽  
Cutting Problems ◽  
Guillotine Cutting

MIP models for two-dimensional non-guillotine cutting problems with usable leftovers

2014 ◽  
Vol 65 (11) ◽  
pp. 1649-1663 ◽  
Author(s):  
Ricardo Andrade ◽  
Ernesto G Birgin ◽  
Reinaldo Morabito ◽  
Débora P Ronconi
Keyword(s):  
Two Dimensional ◽  
Mip Models ◽  
Cutting Problems ◽  
Guillotine Cutting
Sign in / Sign up

Export Citation Format

Share Document