Tabu search and design optimization
Computer-Aided Design
Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Computers and Operations Research
Hi-index | 0.00 |
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, the authors undertake an extensive experimental study with a large number of problem instances extracted from the literature by the Burke Benchmarks and the Beasley Benchmarks in order to support and to prove their approach and to evaluate the performance.