A BI-OBJECTIVE MULTIPERIOD ONE-DIMENSIONAL CUTTING STOCK PROBLEM

Detalhes bibliográficos
Autor(a) principal: Pierini,Livia Maria
Data de Publicação: 2022
Outros Autores: Poldi,Kelly Cristina
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Pesquisa operacional (Online)
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382022000100217
Resumo: ABSTRACT In this paper, we investigate the bi-objective multiperiod one-dimensional cutting stock problem that seeks to minimize the cost of production associated with the total length of cut objects (waste) and the inventory costs related to objects and items. A mathematical model is presented and heuristically solved by a column generation method. Computational tests were performed using the Weighted Sum method, the ε-Constraint method and a variation of the Benson method. The Pearson correlation coefficient was calculated in order to investigate the trade-off between the conflicting objectives of the problem. The results confirmed a strong negative correlation between the objective functions of the problem. All the applied scalar methods were able to find multiple efficient solutions for the problem in a reasonable computational time; however, the ε-Constraint and the modified Benson methods performed better.
id SOBRAPO-1_e8e785dd5d6dad219c6eafcaea01992e
oai_identifier_str oai:scielo:S0101-74382022000100217
network_acronym_str SOBRAPO-1
network_name_str Pesquisa operacional (Online)
repository_id_str
spelling A BI-OBJECTIVE MULTIPERIOD ONE-DIMENSIONAL CUTTING STOCK PROBLEMcutting stock problembi-objective optimizationε-constraint methodweighted sum methodBenson methodABSTRACT In this paper, we investigate the bi-objective multiperiod one-dimensional cutting stock problem that seeks to minimize the cost of production associated with the total length of cut objects (waste) and the inventory costs related to objects and items. A mathematical model is presented and heuristically solved by a column generation method. Computational tests were performed using the Weighted Sum method, the ε-Constraint method and a variation of the Benson method. The Pearson correlation coefficient was calculated in order to investigate the trade-off between the conflicting objectives of the problem. The results confirmed a strong negative correlation between the objective functions of the problem. All the applied scalar methods were able to find multiple efficient solutions for the problem in a reasonable computational time; however, the ε-Constraint and the modified Benson methods performed better.Sociedade Brasileira de Pesquisa Operacional2022-01-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382022000100217Pesquisa Operacional v.42 2022reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/0101-7438.2022.042.00258432info:eu-repo/semantics/openAccessPierini,Livia MariaPoldi,Kelly Cristinaeng2022-07-13T00:00:00Zoai:scielo:S0101-74382022000100217Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2022-07-13T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false
dc.title.none.fl_str_mv A BI-OBJECTIVE MULTIPERIOD ONE-DIMENSIONAL CUTTING STOCK PROBLEM
title A BI-OBJECTIVE MULTIPERIOD ONE-DIMENSIONAL CUTTING STOCK PROBLEM
spellingShingle A BI-OBJECTIVE MULTIPERIOD ONE-DIMENSIONAL CUTTING STOCK PROBLEM
Pierini,Livia Maria
cutting stock problem
bi-objective optimization
ε-constraint method
weighted sum method
Benson method
title_short A BI-OBJECTIVE MULTIPERIOD ONE-DIMENSIONAL CUTTING STOCK PROBLEM
title_full A BI-OBJECTIVE MULTIPERIOD ONE-DIMENSIONAL CUTTING STOCK PROBLEM
title_fullStr A BI-OBJECTIVE MULTIPERIOD ONE-DIMENSIONAL CUTTING STOCK PROBLEM
title_full_unstemmed A BI-OBJECTIVE MULTIPERIOD ONE-DIMENSIONAL CUTTING STOCK PROBLEM
title_sort A BI-OBJECTIVE MULTIPERIOD ONE-DIMENSIONAL CUTTING STOCK PROBLEM
author Pierini,Livia Maria
author_facet Pierini,Livia Maria
Poldi,Kelly Cristina
author_role author
author2 Poldi,Kelly Cristina
author2_role author
dc.contributor.author.fl_str_mv Pierini,Livia Maria
Poldi,Kelly Cristina
dc.subject.por.fl_str_mv cutting stock problem
bi-objective optimization
ε-constraint method
weighted sum method
Benson method
topic cutting stock problem
bi-objective optimization
ε-constraint method
weighted sum method
Benson method
description ABSTRACT In this paper, we investigate the bi-objective multiperiod one-dimensional cutting stock problem that seeks to minimize the cost of production associated with the total length of cut objects (waste) and the inventory costs related to objects and items. A mathematical model is presented and heuristically solved by a column generation method. Computational tests were performed using the Weighted Sum method, the ε-Constraint method and a variation of the Benson method. The Pearson correlation coefficient was calculated in order to investigate the trade-off between the conflicting objectives of the problem. The results confirmed a strong negative correlation between the objective functions of the problem. All the applied scalar methods were able to find multiple efficient solutions for the problem in a reasonable computational time; however, the ε-Constraint and the modified Benson methods performed better.
publishDate 2022
dc.date.none.fl_str_mv 2022-01-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382022000100217
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382022000100217
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/0101-7438.2022.042.00258432
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
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 Pesquisa Operacional v.42 2022
reponame:Pesquisa operacional (Online)
instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
instname_str Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron_str SOBRAPO
institution SOBRAPO
reponame_str Pesquisa operacional (Online)
collection Pesquisa operacional (Online)
repository.name.fl_str_mv Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
repository.mail.fl_str_mv ||sobrapo@sobrapo.org.br
_version_ 1750318018513076224

Registros relacionados