Robust optimization for a maritime inventory routing problem
Autor(a) principal: | |
---|---|
Data de Publicação: | 2018 |
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/24194 |
Resumo: | We consider a single product maritime inventory routing problem in which the production and consumption rates are constant over the planning horizon. The problem involves a heterogeneous fleet and multiple production and consumption ports with limited storage capacity. Maritime transportation is characterized by high levels of uncertainty, and sailing times can be severely influenced by varying and unpredictable weather conditions. To deal with the uncertainty, this paper investigates the use of adaptable robust optimization where the sailing times are assumed to belong to the well-known budget polytope uncertainty set. In the recourse model, the routing, the order of port visits, and the quantities to load and unload are fixed before the uncertainty is revealed, while the visit time to ports and the stock levels can be adjusted to the scenario. We propose a decomposition algorithm that iterates between a master problem that considers a subset of scenarios and an adversarial separation problem that searches for scenarios that make the solution from the master problem infeasible. Several improvement strategies are proposed aiming at reducing the running time of the master problem and reducing the number of iterations of the decomposition algorithm. An iterated local search heuristic is also introduced to improve the decomposition algorithm. A computational study is reported based on a set of real instances. |
id |
RCAP_8146f6c27e12190868b7a0c171975879 |
---|---|
oai_identifier_str |
oai:ria.ua.pt:10773/24194 |
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 optimization for a maritime inventory routing problemRobust optimizationUncertaintyTravel timeDecompositionMatheuristicWe consider a single product maritime inventory routing problem in which the production and consumption rates are constant over the planning horizon. The problem involves a heterogeneous fleet and multiple production and consumption ports with limited storage capacity. Maritime transportation is characterized by high levels of uncertainty, and sailing times can be severely influenced by varying and unpredictable weather conditions. To deal with the uncertainty, this paper investigates the use of adaptable robust optimization where the sailing times are assumed to belong to the well-known budget polytope uncertainty set. In the recourse model, the routing, the order of port visits, and the quantities to load and unload are fixed before the uncertainty is revealed, while the visit time to ports and the stock levels can be adjusted to the scenario. We propose a decomposition algorithm that iterates between a master problem that considers a subset of scenarios and an adversarial separation problem that searches for scenarios that make the solution from the master problem infeasible. Several improvement strategies are proposed aiming at reducing the running time of the master problem and reducing the number of iterations of the decomposition algorithm. An iterated local search heuristic is also introduced to improve the decomposition algorithm. A computational study is reported based on a set of real instances.INFORMS2018-10-03T10:09:16Z2018-06-01T00:00:00Z2018-06info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10773/24194eng0041-165510.1287/trsc.2017.0814Agra, AgostinhoChristiansen, MarielleHvattum, Lars MagnusRodrigues, Filipe Manuelinfo: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:47:32Zoai:ria.ua.pt:10773/24194Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T02:57:57.068367Repositó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 optimization for a maritime inventory routing problem |
title |
Robust optimization for a maritime inventory routing problem |
spellingShingle |
Robust optimization for a maritime inventory routing problem Agra, Agostinho Robust optimization Uncertainty Travel time Decomposition Matheuristic |
title_short |
Robust optimization for a maritime inventory routing problem |
title_full |
Robust optimization for a maritime inventory routing problem |
title_fullStr |
Robust optimization for a maritime inventory routing problem |
title_full_unstemmed |
Robust optimization for a maritime inventory routing problem |
title_sort |
Robust optimization for a maritime inventory routing problem |
author |
Agra, Agostinho |
author_facet |
Agra, Agostinho Christiansen, Marielle Hvattum, Lars Magnus Rodrigues, Filipe Manuel |
author_role |
author |
author2 |
Christiansen, Marielle Hvattum, Lars Magnus Rodrigues, Filipe Manuel |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Agra, Agostinho Christiansen, Marielle Hvattum, Lars Magnus Rodrigues, Filipe Manuel |
dc.subject.por.fl_str_mv |
Robust optimization Uncertainty Travel time Decomposition Matheuristic |
topic |
Robust optimization Uncertainty Travel time Decomposition Matheuristic |
description |
We consider a single product maritime inventory routing problem in which the production and consumption rates are constant over the planning horizon. The problem involves a heterogeneous fleet and multiple production and consumption ports with limited storage capacity. Maritime transportation is characterized by high levels of uncertainty, and sailing times can be severely influenced by varying and unpredictable weather conditions. To deal with the uncertainty, this paper investigates the use of adaptable robust optimization where the sailing times are assumed to belong to the well-known budget polytope uncertainty set. In the recourse model, the routing, the order of port visits, and the quantities to load and unload are fixed before the uncertainty is revealed, while the visit time to ports and the stock levels can be adjusted to the scenario. We propose a decomposition algorithm that iterates between a master problem that considers a subset of scenarios and an adversarial separation problem that searches for scenarios that make the solution from the master problem infeasible. Several improvement strategies are proposed aiming at reducing the running time of the master problem and reducing the number of iterations of the decomposition algorithm. An iterated local search heuristic is also introduced to improve the decomposition algorithm. A computational study is reported based on a set of real instances. |
publishDate |
2018 |
dc.date.none.fl_str_mv |
2018-10-03T10:09:16Z 2018-06-01T00:00:00Z 2018-06 |
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/24194 |
url |
http://hdl.handle.net/10773/24194 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
0041-1655 10.1287/trsc.2017.0814 |
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 |
INFORMS |
publisher.none.fl_str_mv |
INFORMS |
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_ |
1799137633889157120 |