Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands
- Autores
- Juan, A.; Faulin, J.; Grasman, S.; Riera, D.; Marull, J.; Mendez, Carlos Alberto
- Año de publicación
- 2011
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- After introducing the Vehicle Routing Problem with Stochastic Demands (VRPSD) and some related work, this paper proposes a flexible solution methodology. The logic behind this methodology is to transform the issue of solving a given VRPSD instance into an issue of solving a small set of Capacitated Vehicle Routing Problem (CVRP) instances. Thus, our approach takes advantage of the fact that extremely efficient metaheuristics for the CVRP already exists. The CVRP instances are obtained from the original VRPSD instance by assigning different values to the level of safety stocks that routed vehicles must employ to deal with unexpected demands. The methodology also makes use of Monte Carlo simulation (MCS) to obtain estimates of the reliability of each aprioristic solution – that is, the probability that no vehicle runs out of load before completing its delivering route – as well as for the expected costs associated with corrective routing actions (recourse actions) after a vehicle runs out of load before completing its route. This way, estimates for expected total costs of different routing alternatives are obtained. Finally, an extensive numerical experiment is included in the paper with the purpose of analyzing the efficiency of the described methodology under different uncertainty scenarios
Fil: Juan, A.. Open University of Catalonia; España
Fil: Faulin, J.. Public University of Navarre; España
Fil: Grasman, S.. Missouri University of Science & Technology; Estados Unidos
Fil: Riera, D.. Open University of Catalonia; España
Fil: Marull, J.. Open University of Catalonia; España
Fil: Mendez, Carlos Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química (i); Argentina - Materia
-
Vehicle Routing Problem with Stochastic Demands
Monte Carlo Simulation
Reliability Indices
Metaheuristics - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/13006
Ver los metadatos del registro completo
id |
CONICETDig_381dcfdccb709e20aac5fe07439fb490 |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/13006 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
Using safety stocks and simulation to solve the vehicle routing problem with stochastic demandsJuan, A.Faulin, J.Grasman, S.Riera, D.Marull, J.Mendez, Carlos AlbertoVehicle Routing Problem with Stochastic DemandsMonte Carlo SimulationReliability IndicesMetaheuristicshttps://purl.org/becyt/ford/2.11https://purl.org/becyt/ford/2After introducing the Vehicle Routing Problem with Stochastic Demands (VRPSD) and some related work, this paper proposes a flexible solution methodology. The logic behind this methodology is to transform the issue of solving a given VRPSD instance into an issue of solving a small set of Capacitated Vehicle Routing Problem (CVRP) instances. Thus, our approach takes advantage of the fact that extremely efficient metaheuristics for the CVRP already exists. The CVRP instances are obtained from the original VRPSD instance by assigning different values to the level of safety stocks that routed vehicles must employ to deal with unexpected demands. The methodology also makes use of Monte Carlo simulation (MCS) to obtain estimates of the reliability of each aprioristic solution – that is, the probability that no vehicle runs out of load before completing its delivering route – as well as for the expected costs associated with corrective routing actions (recourse actions) after a vehicle runs out of load before completing its route. This way, estimates for expected total costs of different routing alternatives are obtained. Finally, an extensive numerical experiment is included in the paper with the purpose of analyzing the efficiency of the described methodology under different uncertainty scenariosFil: Juan, A.. Open University of Catalonia; EspañaFil: Faulin, J.. Public University of Navarre; EspañaFil: Grasman, S.. Missouri University of Science & Technology; Estados UnidosFil: Riera, D.. Open University of Catalonia; EspañaFil: Marull, J.. Open University of Catalonia; EspañaFil: Mendez, Carlos Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química (i); ArgentinaElsevier2011-12info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/13006Juan, A.; Faulin, J.; Grasman, S.; Riera, D.; Marull, J.; et al.; Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands; Elsevier; Transportation Research. Part C, Emerging Technologies; 19; 5; 12-2011; 751-7650968-090Xenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.trc.2010.09.007info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0968090X10001439info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T09:43:16Zoai:ri.conicet.gov.ar:11336/13006instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 09:43:16.449CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands |
title |
Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands |
spellingShingle |
Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands Juan, A. Vehicle Routing Problem with Stochastic Demands Monte Carlo Simulation Reliability Indices Metaheuristics |
title_short |
Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands |
title_full |
Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands |
title_fullStr |
Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands |
title_full_unstemmed |
Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands |
title_sort |
Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands |
dc.creator.none.fl_str_mv |
Juan, A. Faulin, J. Grasman, S. Riera, D. Marull, J. Mendez, Carlos Alberto |
author |
Juan, A. |
author_facet |
Juan, A. Faulin, J. Grasman, S. Riera, D. Marull, J. Mendez, Carlos Alberto |
author_role |
author |
author2 |
Faulin, J. Grasman, S. Riera, D. Marull, J. Mendez, Carlos Alberto |
author2_role |
author author author author author |
dc.subject.none.fl_str_mv |
Vehicle Routing Problem with Stochastic Demands Monte Carlo Simulation Reliability Indices Metaheuristics |
topic |
Vehicle Routing Problem with Stochastic Demands Monte Carlo Simulation Reliability Indices Metaheuristics |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/2.11 https://purl.org/becyt/ford/2 |
dc.description.none.fl_txt_mv |
After introducing the Vehicle Routing Problem with Stochastic Demands (VRPSD) and some related work, this paper proposes a flexible solution methodology. The logic behind this methodology is to transform the issue of solving a given VRPSD instance into an issue of solving a small set of Capacitated Vehicle Routing Problem (CVRP) instances. Thus, our approach takes advantage of the fact that extremely efficient metaheuristics for the CVRP already exists. The CVRP instances are obtained from the original VRPSD instance by assigning different values to the level of safety stocks that routed vehicles must employ to deal with unexpected demands. The methodology also makes use of Monte Carlo simulation (MCS) to obtain estimates of the reliability of each aprioristic solution – that is, the probability that no vehicle runs out of load before completing its delivering route – as well as for the expected costs associated with corrective routing actions (recourse actions) after a vehicle runs out of load before completing its route. This way, estimates for expected total costs of different routing alternatives are obtained. Finally, an extensive numerical experiment is included in the paper with the purpose of analyzing the efficiency of the described methodology under different uncertainty scenarios Fil: Juan, A.. Open University of Catalonia; España Fil: Faulin, J.. Public University of Navarre; España Fil: Grasman, S.. Missouri University of Science & Technology; Estados Unidos Fil: Riera, D.. Open University of Catalonia; España Fil: Marull, J.. Open University of Catalonia; España Fil: Mendez, Carlos Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química (i); Argentina |
description |
After introducing the Vehicle Routing Problem with Stochastic Demands (VRPSD) and some related work, this paper proposes a flexible solution methodology. The logic behind this methodology is to transform the issue of solving a given VRPSD instance into an issue of solving a small set of Capacitated Vehicle Routing Problem (CVRP) instances. Thus, our approach takes advantage of the fact that extremely efficient metaheuristics for the CVRP already exists. The CVRP instances are obtained from the original VRPSD instance by assigning different values to the level of safety stocks that routed vehicles must employ to deal with unexpected demands. The methodology also makes use of Monte Carlo simulation (MCS) to obtain estimates of the reliability of each aprioristic solution – that is, the probability that no vehicle runs out of load before completing its delivering route – as well as for the expected costs associated with corrective routing actions (recourse actions) after a vehicle runs out of load before completing its route. This way, estimates for expected total costs of different routing alternatives are obtained. Finally, an extensive numerical experiment is included in the paper with the purpose of analyzing the efficiency of the described methodology under different uncertainty scenarios |
publishDate |
2011 |
dc.date.none.fl_str_mv |
2011-12 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11336/13006 Juan, A.; Faulin, J.; Grasman, S.; Riera, D.; Marull, J.; et al.; Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands; Elsevier; Transportation Research. Part C, Emerging Technologies; 19; 5; 12-2011; 751-765 0968-090X |
url |
http://hdl.handle.net/11336/13006 |
identifier_str_mv |
Juan, A.; Faulin, J.; Grasman, S.; Riera, D.; Marull, J.; et al.; Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands; Elsevier; Transportation Research. Part C, Emerging Technologies; 19; 5; 12-2011; 751-765 0968-090X |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.trc.2010.09.007 info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0968090X10001439 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier |
publisher.none.fl_str_mv |
Elsevier |
dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
reponame_str |
CONICET Digital (CONICET) |
collection |
CONICET Digital (CONICET) |
instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
_version_ |
1844613361832034304 |
score |
13.070432 |