A genetic algorithm for the one-dimensional cutting stock problem with setups

Detalhes bibliográficos
Autor(a) principal: Araujo, Silvio Alexandre de [UNESP]
Data de Publicação: 2014
Outros Autores: Poldi, Kelly Cristina, Smith, Jim
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://dx.doi.org/10.1590/0101-7438.2014.034.02.0165
http://hdl.handle.net/11449/114164
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.
id UNSP_1104fce3fff4bf1564edb46588babf5e
oai_identifier_str oai:repositorio.unesp.br:11449/114164
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling A genetic algorithm for the one-dimensional cutting stock problem with setupsinteger optimizationcutting stock problem with setupsgenetic algorithmThis 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.Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Universidade Estadual Paulista Departamento de Matemática AplicadaUniversidade Federal de São Paulo Intituto de Ciência e TecnologiaUniversity of the West of England Faculty of Environment and TechnologyUniversidade Estadual Paulista Departamento de Matemática AplicadaSociedade Brasileira de Pesquisa OperacionalUniversidade Estadual Paulista (Unesp)Universidade Federal de São Paulo (UNIFESP)University of the West of England Faculty of Environment and TechnologyAraujo, Silvio Alexandre de [UNESP]Poldi, Kelly CristinaSmith, Jim2015-02-02T12:39:18Z2015-02-02T12:39:18Z2014-05-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article165-187application/pdfhttp://dx.doi.org/10.1590/0101-7438.2014.034.02.0165Pesquisa Operacional. Sociedade Brasileira de Pesquisa Operacional, v. 34, n. 2, p. 165-187, 2014.0101-7438http://hdl.handle.net/11449/11416410.1590/0101-7438.2014.034.02.0165S0101-74382014000200165S0101-74382014000200165.pdf99197731823160620000-0002-4762-2048SciELOreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengPesquisa Operacional0,365info:eu-repo/semantics/openAccess2024-01-12T06:24:01Zoai:repositorio.unesp.br:11449/114164Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T22:45:12.961172Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv A genetic algorithm for the one-dimensional cutting stock problem with setups
title A genetic algorithm for the one-dimensional cutting stock problem with setups
spellingShingle A genetic algorithm for the one-dimensional cutting stock problem with setups
Araujo, Silvio Alexandre de [UNESP]
integer optimization
cutting stock problem with setups
genetic algorithm
title_short A genetic algorithm for the one-dimensional cutting stock problem with setups
title_full A genetic algorithm for the one-dimensional cutting stock problem with setups
title_fullStr A genetic algorithm for the one-dimensional cutting stock problem with setups
title_full_unstemmed A genetic algorithm for the one-dimensional cutting stock problem with setups
title_sort A genetic algorithm for the one-dimensional cutting stock problem with setups
author Araujo, Silvio Alexandre de [UNESP]
author_facet Araujo, Silvio Alexandre de [UNESP]
Poldi, Kelly Cristina
Smith, Jim
author_role author
author2 Poldi, Kelly Cristina
Smith, Jim
author2_role author
author
dc.contributor.none.fl_str_mv Universidade Estadual Paulista (Unesp)
Universidade Federal de São Paulo (UNIFESP)
University of the West of England Faculty of Environment and Technology
dc.contributor.author.fl_str_mv Araujo, Silvio Alexandre de [UNESP]
Poldi, Kelly Cristina
Smith, Jim
dc.subject.por.fl_str_mv integer optimization
cutting stock problem with setups
genetic algorithm
topic integer optimization
cutting stock problem with setups
genetic algorithm
description 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.
publishDate 2014
dc.date.none.fl_str_mv 2014-05-01
2015-02-02T12:39:18Z
2015-02-02T12:39:18Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://dx.doi.org/10.1590/0101-7438.2014.034.02.0165
Pesquisa Operacional. Sociedade Brasileira de Pesquisa Operacional, v. 34, n. 2, p. 165-187, 2014.
0101-7438
http://hdl.handle.net/11449/114164
10.1590/0101-7438.2014.034.02.0165
S0101-74382014000200165
S0101-74382014000200165.pdf
9919773182316062
0000-0002-4762-2048
url http://dx.doi.org/10.1590/0101-7438.2014.034.02.0165
http://hdl.handle.net/11449/114164
identifier_str_mv Pesquisa Operacional. Sociedade Brasileira de Pesquisa Operacional, v. 34, n. 2, p. 165-187, 2014.
0101-7438
10.1590/0101-7438.2014.034.02.0165
S0101-74382014000200165
S0101-74382014000200165.pdf
9919773182316062
0000-0002-4762-2048
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Pesquisa Operacional
0,365
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 165-187
application/pdf
dc.publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
dc.source.none.fl_str_mv SciELO
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv
_version_ 1808129458250448896

Registros relacionados