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

Authors:
Hamza Gharsellaoui;Hamadi Hasni
Affiliations:
INSAT Institute, University of Carthago, Tunisia;ENSI School, University of Manouba, Tunisia
Venue:
International Journal of Advanced Pervasive and Ubiquitous Computing
Year:
2012

Citing 3
Cited 0

Tabu search and design optimization

Computer-Aided Design
Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms

Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.