A GRASP-based heuristic algorithm for the issue of restricted, Ggillotine two-dimensional cut

Authors

  • André Soares Velasco
  • Geraldo Geraldo de Paula Junior
  • Euclydes Vieira Neto

DOI:

https://doi.org/10.15675/gepros.v0i1.218

Abstract

This work study a particular case of cutting problems, known in the literature as constrained and guillotine two-dimensional cutting problems. The problem consist in determining the best form to obtain a quantity of rectangles pieces, making cuts like guillotine kinds, in rectangles plates in store. Considering its combinatorial complexity and a variety of practical application, this problem is approached by heuristic method. In this work is presented a heuristic formulation based on the GRASP methodology, as proposition to solve the cutting problems. In order to presenting the efficiency the heuristic propose it was realized computer tests in instances found in the literature. Keywords: Cutting problem; Two-dimensional constrained guillotine cutting patterns; GRASP

Published

2008-03-01

How to Cite

Velasco, A. S., Paula Junior, G. . G. de, & Neto, E. V. (2008). A GRASP-based heuristic algorithm for the issue of restricted, Ggillotine two-dimensional cut. Revista Gestão Da Produção Operações E Sistemas, (1), Pag. 129. https://doi.org/10.15675/gepros.v0i1.218

Issue

Section

Articles