A hybrid heuristic for a stochastic production-inventory-routing problem

Detalhes bibliográficos
Autor(a) principal: Agra, Agostinho
Data de Publicação: 2018
Outros Autores: Requejo, Cristina, Rodrigues, Filipe
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/24193
Resumo: We consider a stochastic single item production-inventory-routing problem with a single producer and multiple clients. At the clients, demand is allowed to be backlogged incurring a penalty cost. Demands are considered uncertain. A recourse model is presented where the production and routing decisions are taken before the scenario is known, and the quantities to deliver to the clients and the inventory levels are adjustable to the scenario. Valid inequalities are introduced and a hybrid heuristic that combines ideas from the sample average approximation method and from relax-and-fix approaches is proposed. Preliminary tests based on randomly generated instances are reported showing that the hybrid heuristic performs better than the classical sample approximation algorithm for hard instances.
id RCAP_c7b629fd231f623bbaa3a7493f882977
oai_identifier_str oai:ria.ua.pt:10773/24193
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 heuristic for a stochastic production-inventory-routing problemInventory routingStochastic programmingSample approximation algorithmHybrid heuristicWe consider a stochastic single item production-inventory-routing problem with a single producer and multiple clients. At the clients, demand is allowed to be backlogged incurring a penalty cost. Demands are considered uncertain. A recourse model is presented where the production and routing decisions are taken before the scenario is known, and the quantities to deliver to the clients and the inventory levels are adjustable to the scenario. Valid inequalities are introduced and a hybrid heuristic that combines ideas from the sample average approximation method and from relax-and-fix approaches is proposed. Preliminary tests based on randomly generated instances are reported showing that the hybrid heuristic performs better than the classical sample approximation algorithm for hard instances.Elsevier2020-02-01T00:00:00Z2018-01-01T00:00:00Z2018info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10773/24193eng1571-065310.1016/j.endm.2018.02.009Agra, AgostinhoRequejo, CristinaRodrigues, Filipeinfo: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/24193Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T02:57:56.975261Repositó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 heuristic for a stochastic production-inventory-routing problem
title A hybrid heuristic for a stochastic production-inventory-routing problem
spellingShingle A hybrid heuristic for a stochastic production-inventory-routing problem
Agra, Agostinho
Inventory routing
Stochastic programming
Sample approximation algorithm
Hybrid heuristic
title_short A hybrid heuristic for a stochastic production-inventory-routing problem
title_full A hybrid heuristic for a stochastic production-inventory-routing problem
title_fullStr A hybrid heuristic for a stochastic production-inventory-routing problem
title_full_unstemmed A hybrid heuristic for a stochastic production-inventory-routing problem
title_sort A hybrid heuristic for a stochastic production-inventory-routing problem
author Agra, Agostinho
author_facet Agra, Agostinho
Requejo, Cristina
Rodrigues, Filipe
author_role author
author2 Requejo, Cristina
Rodrigues, Filipe
author2_role author
author
dc.contributor.author.fl_str_mv Agra, Agostinho
Requejo, Cristina
Rodrigues, Filipe
dc.subject.por.fl_str_mv Inventory routing
Stochastic programming
Sample approximation algorithm
Hybrid heuristic
topic Inventory routing
Stochastic programming
Sample approximation algorithm
Hybrid heuristic
description We consider a stochastic single item production-inventory-routing problem with a single producer and multiple clients. At the clients, demand is allowed to be backlogged incurring a penalty cost. Demands are considered uncertain. A recourse model is presented where the production and routing decisions are taken before the scenario is known, and the quantities to deliver to the clients and the inventory levels are adjustable to the scenario. Valid inequalities are introduced and a hybrid heuristic that combines ideas from the sample average approximation method and from relax-and-fix approaches is proposed. Preliminary tests based on randomly generated instances are reported showing that the hybrid heuristic performs better than the classical sample approximation algorithm for hard instances.
publishDate 2018
dc.date.none.fl_str_mv 2018-01-01T00:00:00Z
2018
2020-02-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/24193
url http://hdl.handle.net/10773/24193
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 1571-0653
10.1016/j.endm.2018.02.009
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 Elsevier
publisher.none.fl_str_mv Elsevier
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_ 1799137633884962816

Registros relacionados