Problema de Corte de Estoque Unidimensional com Sobras Aproveitáveis: Solução via Metaheurística GRASP
DOI:
https://doi.org/10.5540/tema.2020.021.03.441Keywords:
Problema de corte de estoque unidimensional, sobras aproveitáveis, metaheurística, GRASP.Abstract
Neste artigo apresentamos um estudo sobre o Problema de Corte de Estoque com Sobras Aproveitáveis (PCESA) unidimensional. O Problema de Corte de Estoque (PCE) consiste em cortar um conjunto de objetos, disponíveis me estoque, para produzir um conjunto de itens em quantidades e tamanhos especificados. O PCESA é um PCE no qual nem todas as sobras de um processo de corte são consideradas perdas, ou seja, quando uma sobra for maior que um determinado comprimento, ela retorna ao estoque para ser usada nos processos de corte subsequentes. O objetivo do problema abordado é a minimização da perda de material e da quantidade de retalhos (sobras) gerados no PCESA unidimensional. O estoque inicial é composto de objetos padronizados e de retalhos resultantes de cortes anteriores. Para resolver este problema, duas heurísticas e três versões da metaheurística Greedy Randomized Adaptive Search Procedure (GRASP) foram desenvolvidas. Testes computacionais foram realizados para os procedimentos propostos em instâncias da literatura. As abordagens propostas para a solução apresentaram boas soluções em relação ao número de sobras geradas.
References
A. R. Brown, “Optimum packing and depletion: the computer in space and resource usage problem,” Macdonald and Co., 1971.
M. N. Arenales, A. C. Cherri, D. N. d. Nascimento, and A. Vianna, “A new mathematical model for the cutting stock/leftover problem,” Pesquisa Operacional, vol. 35, no. 3, pp. 509–522, 2015.
A. C. Cherri, M. N. Arenales, and H. H. Yanasse, “The one-dimensional cutting stock problem with usable leftover–a heuristic approach,” European Journal of Operational Research, vol. 196, no. 3, pp. 897–908, 2009.
A. C. Cherri, M. N. Arenales, and H. H. Yanasse, “The usable leftover onedimensional cutting stock problem—a priority-in-use heuristic,” International Transactions in Operational Research, vol. 20, no. 2, pp. 189–199, 2013.
M. Gradišar, J. Jesenko, and G. Resinovic, “Optimization of roll cutting in clothing industry,” Computers & Operations Research, vol. 24, no. 10, pp. 945–953, 1997.
S. Koch, S. König, and G. Wäscher, “Integer linear programming for a cutting problem in the wood-processing industry: a case study,” International Transactions in Operational Research, vol. 16, no. 6, pp. 715–726, 2009.
G. M. Roodman, “Near-optimal solutions to one-dimensional cutting stock problems,” Computers & operations research, vol. 13, no. 6, pp. 713–719, 1986.
A. C. Cherri, M. N. Arenales, H. H. Yanasse, K. C. Poldi, and A. C. G. Vianna, “The one-dimensional cutting stock problem with usable leftovers–a survey,” European Journal of Operational Research, vol. 236, no. 2, pp. 395–402, 2014.
M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NP-completeness. WH Free. Co., São Francisco, 1979.
M. G. Resende and J. P. de Sousa, Metaheuristics: computer decision-making, vol. 86. Springer Science & Business Media, 2013.
T. A. Feo and M. G. Resende, “Greedy randomized adaptive search procedures,” Journal of global optimization, vol. 6, no. 2, pp. 109–133, 1995.
E. V. Neto, A. S. Velasco, and G. G. de Paula Junior, “Algoritmos grasp
híbridos para o problema de corte unidimensional,” 2013.
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish in this journal agree to the following terms:
Authors retain copyright and grant the journal the right of first publication, with the work simultaneously licensed under the Creative Commons Attribution License that allows the sharing of the work with acknowledgment of authorship and initial publication in this journal.
Authors are authorized to assume additional contracts separately, for non-exclusive distribution of the version of the work published in this journal (eg, publish in an institutional repository or as a book chapter), with acknowledgment of authorship and initial publication in this journal.
Authors are allowed and encouraged to publish and distribute their work online (eg, in institutional repositories or on their personal page) at any point before or during the editorial process, as this can generate productive changes as well as increase impact and the citation of the published work (See The effect of open access).
This is an open access journal which means that all content is freely available without charge to the user or his/her institution. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles, or use them for any other lawful purpose, without asking prior permission from the publisher or the
author. This is in accordance with the BOAI definition of open access
Intellectual Property
All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License under attribution BY.
