Redução do número de padrões em problemas de corte de estoque / Pattern reduction in cutting stock problem

AUTOR(ES)

Marcelo Saraiva Limeira

DATA DE PUBLICAÇÃO

2003

RESUMO

In this thesis we focus on the problem of reducing the number of patterns in cutting stock problems. A review of the literature found on this subject is made and new heuristics for this problem are proposed. The first heuristic proposed is composed of three phases. In the first phase, patterns are generated and chosen if they satisfy some pre-established aspiration levels. The problem is reduced and solved in the second phase. In the third phase, some pattern reduction technique is applied. In the second heuristic proposed we scale the demands of the items by a constant factor and we solve the resulting problem. The third heuristic proposed is a variant of Heuristic 1 with a small modification in phase 1. The fourth heuristic proposed is a variant of the methods of reduction presented by Foerster and Wäscher (1999). Some lower bounds for the minimum possible number of different patterns in an optimal solution for the cutting stock problem were also introduced. Heuristics 1, 2 and 3 were implemented and computational tests were performed. The results obtained from the computational tests indicate that the proposed heuristics have good performance in comparison with previous procedures suggested in the literature.

ASSUNTO(S)

optimization patterns corte otimização cutting heuristic methods computer science métodos heurísticos padrões

Documentos Relacionados

• Redução do número de padrões em problemas de corte de estoque
• Redução do número de padrões em problemas de corte de estoque
• Uma aplicação simulated annealing em problemas de corte de estoque
• O problema de corte de estoque multiperíodo
• Heurísticas baseadas em geração sequencial de padrões para o problema de corte de estoque unidimensional com número reduzido de padrões