Nonlinear cutting stock problem model to minimize the number of different patterns and objects

• Autor(a) principal: Moretti,Antonio Carlos
• Data de Publicação: 2008
• Outros Autores: Salles Neto,Luiz Leduíno de
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Computational & Applied Mathematics
• Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S1807-03022008000100004
• topic: cutting problem; nonlinear programming; column generation

In this article we solve a nonlinear cutting stock problem which represents a cutting stock problem that considers the minimization of, both, the number of objects used and setup. We use a linearization of the nonlinear objective function to make possible the generation of good columns with the Gilmore and Gomory procedure. Each time a new column is added to the problem, we solve the original nonlinear problem by an Augmented Lagrangian method. This process is repeated until no more profitable columns is generated by Gilmore and Gomory technique. Finally, we apply a simple heuristic to obtain an integral solution for the original nonlinear integer problem.