An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems

2005 ◽  
Vol 53 (1) ◽  
pp. 140-150 ◽  
Author(s):  
Mhand Hifi ◽  
Rym M'Hallah
Keyword(s):  
Exact Algorithm ◽  
Two Dimensional ◽  
Cutting Problems

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.

An improved version of Wang's algorithm for two-dimensional cutting problems

1990 ◽  
Vol 44 (2) ◽  
pp. 256-266 ◽  
Author(s):  
JoséFernando Oliveira ◽  
JoséSoeiro Ferreira
Keyword(s):  
Two Dimensional ◽  
Cutting Problems
Sign in / Sign up

Export Citation Format

Share Document