Inventory routing under stochastic supply and demand *

被引:33
作者
Alvarez, Aldair [1 ]
Cordeau, Jean-Francois [2 ]
Jans, Raf [2 ]
Munari, Pedro [1 ]
Morabito, Reinaldo [1 ]
机构
[1] Univ Fed Sao Carlos, Dept Prod Engn, BR-13565905 Sao Carlos, SP, Brazil
[2] HEC Montreal, Dept Logist & Operat Management, Montreal, PQ H3T 2A7, Canada
来源
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE | 2021年 / 102卷
基金
巴西圣保罗研究基金会;
关键词
Inventory routing; Stochastic programming; Capacity reservation; Service level; Progressive hedging; CAPACITY RESERVATION; PERISHABLE PRODUCTS; CUT ALGORITHM; DELIVERY; CONSISTENCY; HEURISTICS; MANAGEMENT; ALLOCATION; SEARCH;
D O I
10.1016/j.omega.2020.102304
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
It is well known that the integrated optimization of multiple and inter-related decisions in a supply chain can bring important benefits to companies. In this spirit, the inventory routing problem focuses on jointly optimizing inventory replenishment and vehicle routing decisions in a distribution context. In practice, the presence of uncertainty often further complicates the problem. We address a stochastic inventory routing problem under the consideration that both the product supply and the customer demands are uncertain. We propose a two-stage stochastic programming formulation, where routing decisions are made in the first stage, while delivery quantities, inventory levels and specific recourse actions are determined in the second stage. In this context, we analyze different recourse mechanisms such as lost sales, backlogging and an additional source for the product in a capacity reservation contract setting. We provide managerial insights from the results of computational experiments using instances based on a benchmark test set. In particular, we study the response mechanisms of the optimal solutions for different levels of uncertainty and cost configurations. Furthermore, we observe that supply and demand uncertainty have different effects on the value of taking the uncertainty into account. We also study the effect of incorporating a service level. Finally, we propose a heuristic solution method which is based on the progressive hedging algorithm and provides high-quality solutions within reasonable running times for problems with a large number of scenarios. (c) 2020 Elsevier Ltd. All rights reserved.
引用
收藏
页数:20
相关论文
共 55 条
  • [1] Benders Decomposition for Production Routing Under Demand Uncertainty
    Adulyasak, Yossiri
    Cordeau, Jean-Francois
    Jans, Raf
    [J]. OPERATIONS RESEARCH, 2015, 63 (04) : 851 - 867
  • [2] Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
    Adulyasak, Yossiri
    Cordeau, Jean-Francois
    Jans, Raf
    [J]. INFORMS JOURNAL ON COMPUTING, 2014, 26 (01) : 103 - 120
  • [3] An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem
    Agra, Agostinho
    Requejo, Cristina
    Rodrigues, Filipe
    [J]. NETWORKS, 2018, 72 (01) : 5 - 24
  • [4] A maritime inventory routing problem with stochastic sailing and port times
    Agra, Agostinho
    Christiansen, Marielle
    Delgado, Alexandrino
    Hvattum, Lars Magnus
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2015, 61 : 18 - 30
  • [5] Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products
    Alvarez, Aldair
    Cordeau, Jean-Francois
    Jans, Raf
    Munari, Pedro
    Morabito, Reinaldo
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 283 (02) : 511 - 529
  • [6] Iterated local search and simulated annealing algorithms for the inventory routing problem
    Alvarez, Aldair
    Munari, Pedro
    Morabito, Reinaldo
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2018, 25 (06) : 1785 - 1809
  • [7] Industrial aspects and literature survey: Combined inventory management and routing
    Andersson, Henrik
    Hoff, Arild
    Christiansen, Marielle
    Hasle, Geir
    Lokketangen, Arne
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (09) : 1515 - 1536
  • [8] [Anonymous], 2018, CONCORDE TSP SOLVER
  • [9] A branch-and-cut algorithm for a vendor-managed inventory-routing problem
    Archetti, Claudia
    Bertazzi, Luca
    Laporte, Gilbert
    Speranza, Maria Grazia
    [J]. TRANSPORTATION SCIENCE, 2007, 41 (03) : 382 - 391
  • [10] Managing stochastic demand in an Inventory Routing Problem with transportation procurement
    Bertazzi, Luca
    Bosco, Adamo
    Lagana, Demetrio
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2015, 56 : 112 - 121