A stochastic programming approach to the cutting stock problem with usable leftovers
Autor(a) principal: | |
---|---|
Data de Publicação: | 2023 |
Outros Autores: | , , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://dx.doi.org/10.1016/j.ejor.2022.11.013 http://hdl.handle.net/11449/246550 |
Resumo: | In cutting processes, one of the strategies to reduce raw material waste is to generate leftovers that are large enough to return to stock for future use. The length of these leftovers is important since waste is expected to be minimal when cutting these objects in the future. However, in several situations, future demand is unknown and evaluating the best length for the leftovers is challenging. Furthermore, it may not be economically feasible to manage a stock of leftovers with multiple lengths that may not result in minimal waste when cut. In this paper, we approached the cutting stock problem with the possibility of generating leftovers as a two-stage stochastic program with recourse. We approximated the demand levels for the different items by employing a finite set of scenarios. Also, we modeled different decisions made before and after uncertainties were revealed. We proposed a mathematical model to represent this problem and developed a column generation approach to solve it. We ran computational experiments with randomly generated instances, considering a representative set of scenarios with a varying probability distribution. The results validated the efficiency of the proposed approach and allowed us to derive insights on the value of modeling and tackling uncertainty in this problem. Overall, the results showed that the cutting stock problem with usable leftovers benefits from a modeling approach based on sequential decision-making points and from explicitly considering uncertainty in the model and the solution method. |
id |
UNSP_d12844e7fb4e707cfa0b8d68c76f8223 |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/246550 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
A stochastic programming approach to the cutting stock problem with usable leftoversColumn generationCuttingStochastic programmingUsable leftoversIn cutting processes, one of the strategies to reduce raw material waste is to generate leftovers that are large enough to return to stock for future use. The length of these leftovers is important since waste is expected to be minimal when cutting these objects in the future. However, in several situations, future demand is unknown and evaluating the best length for the leftovers is challenging. Furthermore, it may not be economically feasible to manage a stock of leftovers with multiple lengths that may not result in minimal waste when cut. In this paper, we approached the cutting stock problem with the possibility of generating leftovers as a two-stage stochastic program with recourse. We approximated the demand levels for the different items by employing a finite set of scenarios. Also, we modeled different decisions made before and after uncertainties were revealed. We proposed a mathematical model to represent this problem and developed a column generation approach to solve it. We ran computational experiments with randomly generated instances, considering a representative set of scenarios with a varying probability distribution. The results validated the efficiency of the proposed approach and allowed us to derive insights on the value of modeling and tackling uncertainty in this problem. Overall, the results showed that the cutting stock problem with usable leftovers benefits from a modeling approach based on sequential decision-making points and from explicitly considering uncertainty in the model and the solution method.Faculdade de Ciências Universidade Estadual Paulista, SPNewfoundland Capital Management, SPINESC TEC Faculdade de Engenharia Universidade do PortoFaculdade de Ciências Universidade Estadual Paulista, SPUniversidade Estadual Paulista (UNESP)Newfoundland Capital ManagementUniversidade do PortoCherri, Adriana Cristina [UNESP]Cherri, Luiz HenriqueOliveira, Beatriz BritoOliveira, José FernandoCarravilla, Maria Antónia2023-07-29T12:44:05Z2023-07-29T12:44:05Z2023-07-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article38-53http://dx.doi.org/10.1016/j.ejor.2022.11.013European Journal of Operational Research, v. 308, n. 1, p. 38-53, 2023.0377-2217http://hdl.handle.net/11449/24655010.1016/j.ejor.2022.11.0132-s2.0-85144836511Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengEuropean Journal of Operational Researchinfo:eu-repo/semantics/openAccess2023-07-29T12:44:05Zoai:repositorio.unesp.br:11449/246550Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T22:17:34.453460Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
A stochastic programming approach to the cutting stock problem with usable leftovers |
title |
A stochastic programming approach to the cutting stock problem with usable leftovers |
spellingShingle |
A stochastic programming approach to the cutting stock problem with usable leftovers Cherri, Adriana Cristina [UNESP] Column generation Cutting Stochastic programming Usable leftovers |
title_short |
A stochastic programming approach to the cutting stock problem with usable leftovers |
title_full |
A stochastic programming approach to the cutting stock problem with usable leftovers |
title_fullStr |
A stochastic programming approach to the cutting stock problem with usable leftovers |
title_full_unstemmed |
A stochastic programming approach to the cutting stock problem with usable leftovers |
title_sort |
A stochastic programming approach to the cutting stock problem with usable leftovers |
author |
Cherri, Adriana Cristina [UNESP] |
author_facet |
Cherri, Adriana Cristina [UNESP] Cherri, Luiz Henrique Oliveira, Beatriz Brito Oliveira, José Fernando Carravilla, Maria Antónia |
author_role |
author |
author2 |
Cherri, Luiz Henrique Oliveira, Beatriz Brito Oliveira, José Fernando Carravilla, Maria Antónia |
author2_role |
author author author author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (UNESP) Newfoundland Capital Management Universidade do Porto |
dc.contributor.author.fl_str_mv |
Cherri, Adriana Cristina [UNESP] Cherri, Luiz Henrique Oliveira, Beatriz Brito Oliveira, José Fernando Carravilla, Maria Antónia |
dc.subject.por.fl_str_mv |
Column generation Cutting Stochastic programming Usable leftovers |
topic |
Column generation Cutting Stochastic programming Usable leftovers |
description |
In cutting processes, one of the strategies to reduce raw material waste is to generate leftovers that are large enough to return to stock for future use. The length of these leftovers is important since waste is expected to be minimal when cutting these objects in the future. However, in several situations, future demand is unknown and evaluating the best length for the leftovers is challenging. Furthermore, it may not be economically feasible to manage a stock of leftovers with multiple lengths that may not result in minimal waste when cut. In this paper, we approached the cutting stock problem with the possibility of generating leftovers as a two-stage stochastic program with recourse. We approximated the demand levels for the different items by employing a finite set of scenarios. Also, we modeled different decisions made before and after uncertainties were revealed. We proposed a mathematical model to represent this problem and developed a column generation approach to solve it. We ran computational experiments with randomly generated instances, considering a representative set of scenarios with a varying probability distribution. The results validated the efficiency of the proposed approach and allowed us to derive insights on the value of modeling and tackling uncertainty in this problem. Overall, the results showed that the cutting stock problem with usable leftovers benefits from a modeling approach based on sequential decision-making points and from explicitly considering uncertainty in the model and the solution method. |
publishDate |
2023 |
dc.date.none.fl_str_mv |
2023-07-29T12:44:05Z 2023-07-29T12:44:05Z 2023-07-01 |
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.1016/j.ejor.2022.11.013 European Journal of Operational Research, v. 308, n. 1, p. 38-53, 2023. 0377-2217 http://hdl.handle.net/11449/246550 10.1016/j.ejor.2022.11.013 2-s2.0-85144836511 |
url |
http://dx.doi.org/10.1016/j.ejor.2022.11.013 http://hdl.handle.net/11449/246550 |
identifier_str_mv |
European Journal of Operational Research, v. 308, n. 1, p. 38-53, 2023. 0377-2217 10.1016/j.ejor.2022.11.013 2-s2.0-85144836511 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
European Journal of Operational Research |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
38-53 |
dc.source.none.fl_str_mv |
Scopus 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_ |
1808129414574112768 |