Multiperiod Stock Allocation via Robust Optimization

被引:12
作者
Jackson, Peter L. [1 ]
Muckstadt, John A. [1 ]
Li, Yuexing [1 ]
机构
[1] Cornell Univ, Sch Operat Res & Informat Engn, Ithaca, NY 14853 USA
关键词
multiechelon inventory optimization; robust optimization; inventory risk pooling; INVENTORY; APPROXIMATIONS; POLICIES;
D O I
10.1287/mnsc.2017.2969
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider a one-warehouse, N-retailer, multiperiod, stock allocation problem in which holding costs are identical at each location and no stock is received from outside suppliers for the duration of the planning horizon. No shipments are allowed between retailers. The only motive for holding inventory at the central warehouse for allocation in future periods is the so-called risk pooling motive. We apply robust optimization to this problem extending the inventory policy to allow for an adaptive, nonanticipatory shipment policy. We consider two alternatives for the uncertainty set, one in which risk pooling is implicit and another for which risk pooling is explicit. The explicit risk pooling uncertainty set grows by no more than the square of the number of retailers. The general problem can be solved using Benders' decomposition. A special case gives rise to closed-form solutions for both uncertainty set alternatives. The explicit risk pooling uncertainty set leads to a square root law in which the optimal stock to reserve at the central warehouse grows with the square root of the number of retailers. The experimental results confirm the value of the robust optimization approach and provide managerial insights into the operation of such systems.
引用
收藏
页码:794 / 818
页数:25
相关论文
共 23 条
  • [1] [Anonymous], MULTILEVEL PROD INVE
  • [2] [Anonymous], MOS SIAM SERIES OPTI
  • [3] Heuristic methods for centralized control of one-warehouse, n-retailer inventory systems
    Axsäter, Sven
    Marklund, Johan
    Silver, Edward A.
    [J]. 2002, INFORMS Inst.for Operations Res.and the Management Sciences (04):
  • [4] Axsäter S, 2003, HDBK OPER R, V11, P525
  • [5] Robust Queueing Theory
    Bandi, Chaithanya
    Bertsimas, Dimitris
    Youssef, Nataly
    [J]. OPERATIONS RESEARCH, 2015, 63 (03) : 676 - 700
  • [6] Adjustable robust solutions of uncertain linear programs
    Ben-Tal, A
    Goryashko, A
    Guslitzer, E
    Nemirovski, A
    [J]. MATHEMATICAL PROGRAMMING, 2004, 99 (02) : 351 - 376
  • [7] A robust optimization approach to inventory theory
    Bertsimas, D
    Thiele, A
    [J]. OPERATIONS RESEARCH, 2006, 54 (01) : 150 - 168
  • [8] The price of robustness
    Bertsimas, D
    Sim, M
    [J]. OPERATIONS RESEARCH, 2004, 52 (01) : 35 - 53
  • [9] Inventory Pooling Under Heavy-Tailed Demand
    Bimpikis, Kostas
    Markakis, Mihalis G.
    [J]. MANAGEMENT SCIENCE, 2016, 62 (06) : 1800 - 1813
  • [10] A new method for robustness in rolling horizon planning
    Bredstrom, D.
    Flisberg, P.
    Ronnqvist, M.
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 143 (01) : 41 - 52