Logotipo do repositório
 

Publicação:
A genetic algorithm for the one-dimensional cutting stock problem with setups

Página do item simplificado
dc.contributor.authorAraujo, Silvio Alexandre de [UNESP]
dc.contributor.authorPoldi, Kelly Cristina
dc.contributor.authorSmith, Jim
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.contributor.institutionUniversidade Federal de São Paulo (UNIFESP)
dc.contributor.institutionUniversity of the West of England Faculty of Environment and Technology
dc.date.accessioned2015-02-02T12:39:18Z
dc.date.available2015-02-02T12:39:18Z
dc.date.issued2014-05-01
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.en
dc.description.affiliationUniversidade Estadual Paulista Departamento de Matemática Aplicada
dc.description.affiliationUniversidade Federal de São Paulo Intituto de Ciência e Tecnologia
dc.description.affiliationUniversity of the West of England Faculty of Environment and Technology
dc.description.affiliationUnespUniversidade Estadual Paulista Departamento de Matemática Aplicada
dc.description.sponsorshipFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.description.sponsorshipConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.description.sponsorshipCoordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
dc.format.extent165-187
dc.identifierhttp://dx.doi.org/10.1590/0101-7438.2014.034.02.0165
dc.identifier.citationPesquisa Operacional. Sociedade Brasileira de Pesquisa Operacional, v. 34, n. 2, p. 165-187, 2014.
dc.identifier.doi10.1590/0101-7438.2014.034.02.0165
dc.identifier.fileS0101-74382014000200165.pdf
dc.identifier.issn0101-7438
dc.identifier.lattes9919773182316062
dc.identifier.orcid0000-0002-4762-2048
dc.identifier.scieloS0101-74382014000200165
dc.identifier.urihttp://hdl.handle.net/11449/114164
dc.language.isoeng
dc.publisherSociedade Brasileira de Pesquisa Operacional
dc.relation.ispartofPesquisa Operacional
dc.relation.ispartofsjr0,365
dc.rights.accessRightsAcesso aberto
dc.sourceSciELO
dc.subjectinteger optimizationen
dc.subjectcutting stock problem with setupsen
dc.subjectgenetic algorithmen
dc.titleA genetic algorithm for the one-dimensional cutting stock problem with setupsen
dc.typeArtigo
dspace.entity.typePublication
unesp.author.lattes9919773182316062
unesp.author.orcid0000-0002-4762-2048[1]
unesp.campusUniversidade Estadual Paulista (UNESP), Instituto de Biociências, Letras e Ciências Exatas, São José do Rio Pretopt
unesp.departmentMatemática Aplicada - IBILCEpt

Arquivos

Pacote Original

Agora exibindo 1 - 1 de 1
Imagem de Miniatura
Nome:
S0101-74382014000200165.pdf
Tamanho:
362.43 KB
Formato:
Adobe Portable Document Format
Baixar

Coleções

São José do Rio Preto - IBILCE - Instituto de Biociências, Letras e Ciências Exatas