TY - JOUR
T1 - Dynamic inventory routing problem
T2 - Policies considering network disruptions
AU - Morales, Francisco
AU - Franco, Carlos
AU - Mendez-Giraldo, German
N1 - Publisher Copyright:
© 2018, Growing Science Ltd. All rights reserved.
Copyright:
Copyright 2018 Elsevier B.V., All rights reserved.
PY - 2018/10
Y1 - 2018/10
N2 - In this paper, we introduce an inventory routing problem with network disruptions. In this problem, not only decisions on inventory levels and vehicle routing are made simultaneously, but also, we consider disruptions over the networks in which a number of arcs are vulnerable to these disruptions, leading to an increase in travel times. We develop a dynamic programming approach to deal with this situation, and we also evaluate some policies adapting well-known instances from the literature.
AB - In this paper, we introduce an inventory routing problem with network disruptions. In this problem, not only decisions on inventory levels and vehicle routing are made simultaneously, but also, we consider disruptions over the networks in which a number of arcs are vulnerable to these disruptions, leading to an increase in travel times. We develop a dynamic programming approach to deal with this situation, and we also evaluate some policies adapting well-known instances from the literature.
UR - http://www.scopus.com/inward/record.url?scp=85047221847&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85047221847&partnerID=8YFLogxK
U2 - 10.5267/j.ijiec.2017.11.001
DO - 10.5267/j.ijiec.2017.11.001
M3 - Article
AN - SCOPUS:85047221847
SN - 1923-2926
VL - 9
SP - 523
EP - 534
JO - International Journal of Industrial Engineering Computations
JF - International Journal of Industrial Engineering Computations
IS - 4
ER -