A GENETIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH SETUPS

AUTOR(ES)

Araujo, Silvio Alexandre de, Poldi, Kelly Cristina, Smith, Jim

FONTE

Pesqui. Oper.

DATA DE PUBLICAÇÃO

2014-08

RESUMO

This paper investigates the one-dimensional cutting stock problem considering two conflicting objective functions: minimization of both the number of objects and the number of different cutting patterns used. A new heuristic method based on the concepts of genetic algorithms is proposed to solve the problem. This heuristic is empirically analyzed by solving randomly generated instances and also practical instances from a chemical-fiber company. The computational results show that the method is efficient and obtains positive results when compared to other methods from the literature.

Documentos Relacionados

• A genetic symbiotic algorithm applied to the one-dimensional cutting stock problem
• Modification of Haessler’s sequential heuristic procedure for the one-dimensional cutting stock problem with setup cost
• COMPARISON OF MIP MODELS FOR THE INTEGRATED LOT-SIZING AND ONE-DIMENSIONAL CUTTING STOCK PROBLEM
• An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
• On the geometry of Poincaré's problem for one-dimensional projective foliations