2008 | OriginalPaper | Chapter
A Hybrid Optimization Framework for Cutting and Packing Problems
Case Study on Constrained 2D Non-guillotine Cutting
Authors : Napoleão Nepomuceno, Plácido Pinheiro, André L. V. Coelho
Published in: Recent Advances in Evolutionary Computation for Combinatorial Optimization
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
This work presents a hybrid optimization framework for tackling cutting and packing problems, which is based upon a particular combination scheme between heuristic and exact methods. A metaheuristic engine works as a generator of reduced instances for the original optimization problem, which are formulated as mathematical programming models. These instances, in turn, are solved by an exact optimization technique (solver), and the performance measures accomplished by the respective models are interpreted as score (fitness) values by the metaheuristic, thus guiding its search process. As a means to assess the potentialities behind the novel approach, we provide an instantiation of the framework for dealing specifically with the constrained two-dimensional non-guillotine cutting problem. Computational experiments performed over standard benchmark problems are reported and discussed here, evidencing the effectiveness of the novel approach.