Publication:
An inventory-routing problem with stochastic demand and stock-out: a solution and risk analysis using simheuristics

Consultable a partir de

2021-02-20

Date

2019

Authors

Onggo, Bhakti Stephan
Juan Pérez, Ángel Alejandro
Panadero, Javier
Corlu, Canan Gunes

Director

Publisher

IEEE
Acceso abierto / Sarbide irekia
Contribución a congreso / Biltzarrerako ekarpena
Versión aceptada / Onetsi den bertsioa

Project identifier

European Commission/Horizon 2020 Framework Programme/731884openaire

Abstract

Supply chain operations have become more complex. Hence, in order to optimise supply chain operations, we often need to simplify the optimisation problem in such a way that it can be solved efficiently using either exact methods or metaheuristics. One common simplification is to assume all model inputs are deterministic. However, for some management decisions, considering the uncertainty in model inputs (e.g., demands, travel times, processing times) is essential. Otherwise, the results may be misleading and might lead to an incorrect decision. This paper considers an example of a complex supply chain operation that can be viewed as an Inventory-Routing Problem with stochastic demands. We demonstrate how a simheuristic framework can be employed to solve the problem. Further, we illustrate the risks of not considering input uncertainty. The results show that simheuristics can produce a good result, and ignoring the uncertainty in the model input may lead to sub-optimal results.

Keywords

Stochastic processes, Supply chains, Routing, Optimization, Uncertainty, Planning, Robustness

Department

Estadística, Informática y Matemáticas / Estatistika, Informatika eta Matematika

Faculty/School

Degree

Doctorate program

Editor version

Funding entities

This work has been partially funded by the IoF2020 project of the European Union (grant agreement no. 731884) and by the Erasmus+ Program (2018-1-ES01-KA103-049767).

© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other work.

Los documentos de Academica-e están protegidos por derechos de autor con todos los derechos reservados, a no ser que se indique lo contrario.