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

dc.contributorUniversidade Estadual Paulista (UNESP)
dc.contributorUniversidade Federal de São Paulo (UNIFESP)
dc.contributorUniversity of the West of England Faculty of Environment and Technology
dc.creatorAraujo, Silvio Alexandre De
dc.creatorPoldi, Kelly Cristina
dc.creatorSmith, Jim
dc.date.accessioned2015-06-14T13:47:05Z
dc.date.available2015-06-14T13:47:05Z
dc.date.created2015-06-14T13:47:05Z
dc.date.issued2014-05-01
dc.identifierPesquisa Operacional. Sociedade Brasileira de Pesquisa Operacional, v. 34, n. 2, p. 165-187, 2014.
dc.identifier0101-7438
dc.identifierhttp://repositorio.unifesp.br/handle/11600/8367
dc.identifierS0101-74382014000200165.pdf
dc.identifierS0101-74382014000200165
dc.identifier10.1590/0101-7438.2014.034.02.0165
dc.description.abstractThis 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.
dc.languageeng
dc.publisherSociedade Brasileira de Pesquisa Operacional
dc.relationPesquisa Operacional
dc.rightsAcesso aberto
dc.subjectinteger optimization
dc.subjectcutting stock problem with setups
dc.subjectgenetic algorithm
dc.titleA GENETIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH SETUPS
dc.typeArtigo


Este ítem pertenece a la siguiente institución