A hybrid path-relinking method for solving two-stage stochastic integer problems
Autor(a) principal: | |
---|---|
Data de Publicação: | 2015 |
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://repositorio.inesctec.pt/handle/123456789/3775 http://dx.doi.org/10.1111/itor.12084 |
Resumo: | Path relinking has been used for solving deterministic problems by exploring the neighborhood of elite solutions in an intelligent way. We present an algorithm that combines a mixed-integer linear solver with a truncated path-relinking method in order to solve two-stage stochastic integer problems with complete recourse and first-stage integer variables. This method takes advantage of a possible scenario-based decomposition in an innovative way. Therefore, path relinking is used to combine optimized solutions from different scenarios in order to pursue good stochastic solutions. To assess the computational performance of this method, we use the stochastic lot sizing and scheduling problem dealing with perishable products. In this problem, first-stage decision variables are linked to production sequences and production quantities. After the uncertain demand is unveiled, the second-stage variables decide on the inventory usage. Computational results show a clear advantage of the proposed method when compared to a state-of-the-art mixed-integer linear solver. |
id |
RCAP_068d6c0d2fa8a27201c6d0c4e0be4bdf |
---|---|
oai_identifier_str |
oai:repositorio.inesctec.pt:123456789/3775 |
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 |
A hybrid path-relinking method for solving two-stage stochastic integer problemsPath relinking has been used for solving deterministic problems by exploring the neighborhood of elite solutions in an intelligent way. We present an algorithm that combines a mixed-integer linear solver with a truncated path-relinking method in order to solve two-stage stochastic integer problems with complete recourse and first-stage integer variables. This method takes advantage of a possible scenario-based decomposition in an innovative way. Therefore, path relinking is used to combine optimized solutions from different scenarios in order to pursue good stochastic solutions. To assess the computational performance of this method, we use the stochastic lot sizing and scheduling problem dealing with perishable products. In this problem, first-stage decision variables are linked to production sequences and production quantities. After the uncertain demand is unveiled, the second-stage variables decide on the inventory usage. Computational results show a clear advantage of the proposed method when compared to a state-of-the-art mixed-integer linear solver.2017-11-23T11:31:52Z2015-01-01T00:00:00Z2015info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://repositorio.inesctec.pt/handle/123456789/3775http://dx.doi.org/10.1111/itor.12084engPedro AmorimCosta,AMBernardo Almada-Loboinfo:eu-repo/semantics/embargoedAccessreponame: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:RCAAP2023-05-15T10:20:16Zoai:repositorio.inesctec.pt:123456789/3775Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:52:54.122088Repositó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 |
A hybrid path-relinking method for solving two-stage stochastic integer problems |
title |
A hybrid path-relinking method for solving two-stage stochastic integer problems |
spellingShingle |
A hybrid path-relinking method for solving two-stage stochastic integer problems Pedro Amorim |
title_short |
A hybrid path-relinking method for solving two-stage stochastic integer problems |
title_full |
A hybrid path-relinking method for solving two-stage stochastic integer problems |
title_fullStr |
A hybrid path-relinking method for solving two-stage stochastic integer problems |
title_full_unstemmed |
A hybrid path-relinking method for solving two-stage stochastic integer problems |
title_sort |
A hybrid path-relinking method for solving two-stage stochastic integer problems |
author |
Pedro Amorim |
author_facet |
Pedro Amorim Costa,AM Bernardo Almada-Lobo |
author_role |
author |
author2 |
Costa,AM Bernardo Almada-Lobo |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Pedro Amorim Costa,AM Bernardo Almada-Lobo |
description |
Path relinking has been used for solving deterministic problems by exploring the neighborhood of elite solutions in an intelligent way. We present an algorithm that combines a mixed-integer linear solver with a truncated path-relinking method in order to solve two-stage stochastic integer problems with complete recourse and first-stage integer variables. This method takes advantage of a possible scenario-based decomposition in an innovative way. Therefore, path relinking is used to combine optimized solutions from different scenarios in order to pursue good stochastic solutions. To assess the computational performance of this method, we use the stochastic lot sizing and scheduling problem dealing with perishable products. In this problem, first-stage decision variables are linked to production sequences and production quantities. After the uncertain demand is unveiled, the second-stage variables decide on the inventory usage. Computational results show a clear advantage of the proposed method when compared to a state-of-the-art mixed-integer linear solver. |
publishDate |
2015 |
dc.date.none.fl_str_mv |
2015-01-01T00:00:00Z 2015 2017-11-23T11:31:52Z |
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://repositorio.inesctec.pt/handle/123456789/3775 http://dx.doi.org/10.1111/itor.12084 |
url |
http://repositorio.inesctec.pt/handle/123456789/3775 http://dx.doi.org/10.1111/itor.12084 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/embargoedAccess |
eu_rights_str_mv |
embargoedAccess |
dc.format.none.fl_str_mv |
application/pdf |
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_ |
1799131604180795392 |