Robust inventory theory with perishable products
Autor(a) principal: | |
---|---|
Data de Publicação: | 2020 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10773/29855 |
Resumo: | We consider a robust inventory problem where products are perishable with a given shelf life and demands are assumed uncertain and can take any value in a given polytope. Interestingly, considering uncertain demands leads to part of the production being spoiled, a phenomenon that does not appear in the deterministic context. Based on a deterministic model we propose a robust model where the production decisions are first-stage variables and the inventory levels and the spoiled production are recourse variables that can be adjusted to the demand scenario following a FIFO policy. To handle the non-anticipativity constraints related to the FIFO policy, we propose a non-linear reformulation for the robust problem, which is then linearized using classical techniques. We propose a row-and-column generation algorithm to solve the reformulated model to optimality using a decomposition algorithm. Computational tests show that the decomposition approach can solve a set of instances representing different practical situations within reasonable amount of time. Moreover, the robust solutions obtained ensure low losses of production when the worst-case scenarios are materialized. |
id |
RCAP_dd8f2bb9a3f7e1628649799df65e79b1 |
---|---|
oai_identifier_str |
oai:ria.ua.pt:10773/29855 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Robust inventory theory with perishable productsLot-sizingInteger programmingRobust optimizationRow-and-column generation algorithmsWe consider a robust inventory problem where products are perishable with a given shelf life and demands are assumed uncertain and can take any value in a given polytope. Interestingly, considering uncertain demands leads to part of the production being spoiled, a phenomenon that does not appear in the deterministic context. Based on a deterministic model we propose a robust model where the production decisions are first-stage variables and the inventory levels and the spoiled production are recourse variables that can be adjusted to the demand scenario following a FIFO policy. To handle the non-anticipativity constraints related to the FIFO policy, we propose a non-linear reformulation for the robust problem, which is then linearized using classical techniques. We propose a row-and-column generation algorithm to solve the reformulated model to optimality using a decomposition algorithm. Computational tests show that the decomposition approach can solve a set of instances representing different practical situations within reasonable amount of time. Moreover, the robust solutions obtained ensure low losses of production when the worst-case scenarios are materialized.Springer2020-062020-06-01T00:00:00Z2021-07-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10773/29855eng0254-533010.1007/s10479-019-03264-5Santos, Marcio CostaAgra, AgostinhoPoss, Michaelinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-02-22T11:57:44Zoai:ria.ua.pt:10773/29855Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T03:02:04.629477Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Robust inventory theory with perishable products |
title |
Robust inventory theory with perishable products |
spellingShingle |
Robust inventory theory with perishable products Santos, Marcio Costa Lot-sizing Integer programming Robust optimization Row-and-column generation algorithms |
title_short |
Robust inventory theory with perishable products |
title_full |
Robust inventory theory with perishable products |
title_fullStr |
Robust inventory theory with perishable products |
title_full_unstemmed |
Robust inventory theory with perishable products |
title_sort |
Robust inventory theory with perishable products |
author |
Santos, Marcio Costa |
author_facet |
Santos, Marcio Costa Agra, Agostinho Poss, Michael |
author_role |
author |
author2 |
Agra, Agostinho Poss, Michael |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Santos, Marcio Costa Agra, Agostinho Poss, Michael |
dc.subject.por.fl_str_mv |
Lot-sizing Integer programming Robust optimization Row-and-column generation algorithms |
topic |
Lot-sizing Integer programming Robust optimization Row-and-column generation algorithms |
description |
We consider a robust inventory problem where products are perishable with a given shelf life and demands are assumed uncertain and can take any value in a given polytope. Interestingly, considering uncertain demands leads to part of the production being spoiled, a phenomenon that does not appear in the deterministic context. Based on a deterministic model we propose a robust model where the production decisions are first-stage variables and the inventory levels and the spoiled production are recourse variables that can be adjusted to the demand scenario following a FIFO policy. To handle the non-anticipativity constraints related to the FIFO policy, we propose a non-linear reformulation for the robust problem, which is then linearized using classical techniques. We propose a row-and-column generation algorithm to solve the reformulated model to optimality using a decomposition algorithm. Computational tests show that the decomposition approach can solve a set of instances representing different practical situations within reasonable amount of time. Moreover, the robust solutions obtained ensure low losses of production when the worst-case scenarios are materialized. |
publishDate |
2020 |
dc.date.none.fl_str_mv |
2020-06 2020-06-01T00:00:00Z 2021-07-01T00:00:00Z |
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://hdl.handle.net/10773/29855 |
url |
http://hdl.handle.net/10773/29855 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
0254-5330 10.1007/s10479-019-03264-5 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Springer |
publisher.none.fl_str_mv |
Springer |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799137676222267392 |