Welcome to the InfoSci Platform
Reference Hub1
On a Genetic-Tabu Search Based Algorithm for Two-Dimensional Guillotine Cutting Problems

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

Hamza Gharsellaoui, Hamadi Hasni
Copyright: © 2012 |Volume: 4 |Issue: 2 |Pages: 15
ISSN: 1937-965X|EISSN: 1937-9668|EISBN13: 9781466610583|DOI: 10.4018/japuc.2012040103
Cite Article Cite Article

MLA

Gharsellaoui, Hamza, and Hamadi Hasni. "On a Genetic-Tabu Search Based Algorithm for Two-Dimensional Guillotine Cutting Problems." IJAPUC vol.4, no.2 2012: pp.26-40. http://doi.org/10.4018/japuc.2012040103

APA

Gharsellaoui, H. & Hasni, H. (2012). On a Genetic-Tabu Search Based Algorithm for Two-Dimensional Guillotine Cutting Problems. International Journal of Advanced Pervasive and Ubiquitous Computing (IJAPUC), 4(2), 26-40. http://doi.org/10.4018/japuc.2012040103

Chicago

Gharsellaoui, Hamza, and Hamadi Hasni. "On a Genetic-Tabu Search Based Algorithm for Two-Dimensional Guillotine Cutting Problems," International Journal of Advanced Pervasive and Ubiquitous Computing (IJAPUC) 4, no.2: 26-40. http://doi.org/10.4018/japuc.2012040103

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.