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

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

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...

Full description

Bibliographic Details
Main Authors: Silvio Alexandre de Araujo, Kelly Cristina Poldi, Jim Smith
Format: Article
Language:English
Published: Sociedade Brasileira de Pesquisa Operacional 2014-05-01
Series:Pesquisa Operacional
Subjects:
integer optimization
cutting stock problem with setups
genetic algorithm
Online Access:http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382014000200165&lng=en&tlng=en

Internet

http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382014000200165&lng=en&tlng=en

Similar Items