IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v65y2018i8p594-618.html
   My bibliography  Save this article

Two‐echelon distribution systems with random demands and storage constraints

Author

Listed:
  • Awi Federgruen
  • C. Daniel Guetta
  • Garud Iyengar

Abstract

We consider a general two‐echelon distribution system consisting of a depot and multiple sales outlets, henceforth referred to as retailers, which face random demands for a given item. The replenishment process consists of two stages: the depot procures the item from an outside supplier, while the retailers' inventories are replenished by shipments from the depot. Both of the replenishment stages are associated with a given facility‐specific leadtime. The depot as well as the retailers faces a limited inventory capacity. Inventories are reviewed and orders are placed on a periodic basis. When a retailer runs out of stock, unmet demand is backlogged. We propose a new approach to the above class of dynamic programming models based on Lagrangian relaxation. Every choice of the vector of Lagrange multipliers generates a lower bound via the solution of a single dynamic program (DP) with a one‐dimensional state‐space. The best such bound is obtained by maximizing over the vector of multipliers. The strategy that is optimal for this (maximal) lower bound DP employs an (s, S) ordering policy (generally, with time‐dependent policy parameters). To arrive at an upper bound and an implementable heuristic, this (s, S) policy is paired with one of several possible allocation policies that allocate the system‐wide inventory across the different facilities. We report on an extensive numerical study with close to 14 000 instances which evaluates the accuracy of the lower bound and the optimality gap of the various heuristic policies. The study reveals that the lower bound and the heuristic strategy that is constructed on its basis perform exceedingly well, almost across the entire parameter spectrum, including instances where demands are rather volatile or the average cycle time between consecutive orders is relatively large. The exception arises when storage at the depot is as expensive as at the retailer level and the retailers have large storage capacities.

Suggested Citation

  • Awi Federgruen & C. Daniel Guetta & Garud Iyengar, 2018. "Two‐echelon distribution systems with random demands and storage constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(8), pages 594-618, December.
    • Handle: RePEc:wly:navres:v:65:y:2018:i:8:p:594-618
    DOI: 10.1002/nav.21825
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21825
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21825?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Paul H. Zipkin, 1980. "Simple Ranking Methods for Allocation of One Resource," Management Science, INFORMS, vol. 26(1), pages 34-43, January.
    2. Kunnumkal, Sumit & Topaloglu, Huseyin, 2011. "Linear programming based decomposition methods for inventory distribution systems," European Journal of Operational Research, Elsevier, vol. 211(2), pages 282-297, June.
    3. Johan Marklund & Kaj Rosling, 2012. "Lower Bounds and Heuristics for Supply Chain Stock Allocation," Operations Research, INFORMS, vol. 60(1), pages 92-105, February.
    4. Donald L. Iglehart, 1963. "Optimality of (s, S) Policies in the Infinite Horizon Dynamic Inventory Problem," Management Science, INFORMS, vol. 9(2), pages 259-267, January.
    5. Awi Federgruen & Paul Zipkin, 1984. "Approximations of Dynamic, Multilocation Production and Inventory Problems," Management Science, INFORMS, vol. 30(1), pages 69-84, January.
    6. Awi Federgruen & Paul Zipkin, 1984. "Allocation policies and cost approximations for multilocation inventory systems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 31(1), pages 97-129, March.
    7. Awi Federgruen & Paul Zipkin, 1984. "Computational Issues in an Infinite-Horizon, Multiechelon Inventory Model," Operations Research, INFORMS, vol. 32(4), pages 818-836, August.
    8. Ganesh Janakiraman & John A. Muckstadt, 2009. "A Decomposition Approach for a Class of Capacitated Serial Systems," Operations Research, INFORMS, vol. 57(6), pages 1384-1393, December.
    9. Edward Ignall & Arthur F. Veinott, Jr., 1969. "Optimality of Myopic Inventory Policies for Several Substitute Products," Management Science, INFORMS, vol. 15(5), pages 284-304, January.
    10. Yu-Sheng Zheng & A. Federgruen, 1991. "Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy," Operations Research, INFORMS, vol. 39(4), pages 654-665, August.
    11. Xiuli Chao & Sean X. Zhou, 2009. "Optimal Policy for a Multiechelon Inventory System with Batch Ordering and Fixed Replenishment Intervals," Operations Research, INFORMS, vol. 57(2), pages 377-390, April.
    12. Gabriel R. Bitran & Arnoldo C. Hax, 1981. "Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables," Management Science, INFORMS, vol. 27(4), pages 431-441, April.
    13. Guillermo Gallego & Özalp Özer & Paul Zipkin, 2007. "Bounds, Heuristics, and Approximations for Distribution Systems," Operations Research, INFORMS, vol. 55(3), pages 503-517, June.
    14. Awi Federgruen & Henri Groenevelt, 1986. "The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality," Operations Research, INFORMS, vol. 34(6), pages 909-918, December.
    15. Sumit Kunnumkal & Huseyin Topaloglu, 2008. "A duality‐based relaxation and decomposition approach for inventory distribution systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(7), pages 612-631, October.
    16. Peter L. Jackson, 1988. "Stock Allocation in a Two-Echelon Distribution System Or "What to Do Until Your Ship Comes In"," Management Science, INFORMS, vol. 34(7), pages 880-895, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hu, Shu & Yu, Dennis Z. & Fu, Ke, 2023. "Online platforms’ warehouse capacity allocation strategies for multiple products," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Huaxiao Shen & Tian Tian & Han Zhu, 2019. "A Two-Echelon Inventory System with a Minimum Order Quantity Requirement," Sustainability, MDPI, vol. 11(18), pages 1-22, September.
    2. de Kok, Ton & Grob, Christopher & Laumanns, Marco & Minner, Stefan & Rambau, Jörg & Schade, Konrad, 2018. "A typology and literature review on stochastic multi-echelon inventory models," European Journal of Operational Research, Elsevier, vol. 269(3), pages 955-983.
    3. Yossi Aviv & Awi Federgruen, 2001. "Design for Postponement: A Comprehensive Characterization of Its Benefits Under Unknown Demand Distributions," Operations Research, INFORMS, vol. 49(4), pages 578-598, August.
    4. Qinan Wang & Sven Axsäter, 2013. "Fixed‐interval joint‐replenishment policies for distribution systems with multiple retailers and stochastic demand," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(8), pages 637-651, December.
    5. Johan Marklund & Kaj Rosling, 2012. "Lower Bounds and Heuristics for Supply Chain Stock Allocation," Operations Research, INFORMS, vol. 60(1), pages 92-105, February.
    6. Peter L. Jackson & John A. Muckstadt & Yuexing Li, 2019. "Multiperiod Stock Allocation via Robust Optimization," Management Science, INFORMS, vol. 65(2), pages 794-818, February.
    7. Edirisinghe, Chanaka & Atkins, Derek, 2017. "Lower bounding inventory allocations for risk pooling in two-echelon supply chains," International Journal of Production Economics, Elsevier, vol. 187(C), pages 159-167.
    8. Johan Marklund, 2011. "Inventory control in divergent supply chains with time‐based dispatching and shipment consolidation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(1), pages 59-71, February.
    9. Olof Stenius & Ayşe Gönül Karaarslan & Johan Marklund & A. G. de Kok, 2016. "Exact Analysis of Divergent Inventory Systems with Time-Based Shipment Consolidation and Compound Poisson Demand," Operations Research, INFORMS, vol. 64(4), pages 906-921, August.
    10. Mila Nambiar & David Simchi‐Levi & He Wang, 2021. "Dynamic Inventory Allocation with Demand Learning for Seasonal Goods," Production and Operations Management, Production and Operations Management Society, vol. 30(3), pages 750-765, March.
    11. Wang, Qinan & Wan, Guangyu, 2023. "Fixed-interval order-up-to policies and myopic optimal warehouse stock allocation for one-warehouse multiple-retailer systems," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1112-1124.
    12. Alexandar Angelus, 2011. "A Multiechelon Inventory Problem with Secondary Market Sales," Management Science, INFORMS, vol. 57(12), pages 2145-2162, December.
    13. Felipe Caro & Jérémie Gallien, 2010. "Inventory Management of a Fast-Fashion Retail Network," Operations Research, INFORMS, vol. 58(2), pages 257-273, April.
    14. Kunnumkal, Sumit & Topaloglu, Huseyin, 2011. "Linear programming based decomposition methods for inventory distribution systems," European Journal of Operational Research, Elsevier, vol. 211(2), pages 282-297, June.
    15. Iida, Tetsuo, 2001. "The infinite horizon non-stationary stochastic multi-echelon inventory problem and near-myopic policies," European Journal of Operational Research, Elsevier, vol. 134(3), pages 525-539, November.
    16. Ming Hu & Yi Yang, 2014. "Modified Echelon ( r, Q ) Policies with Guaranteed Performance Bounds for Stochastic Serial Inventory Systems," Operations Research, INFORMS, vol. 62(4), pages 812-828, August.
    17. Fangruo Chen & Rungson Samroengraja, 2000. "A Staggered Ordering Policy for One-Warehouse, Multiretailer Systems," Operations Research, INFORMS, vol. 48(2), pages 281-293, April.
    18. Sven Axsäter, 2007. "On the first come–first served rule in multi‐echelon inventory control," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(5), pages 485-491, August.
    19. Woonghee Tim Huh & Ganesh Janakiraman & Mahesh Nagarajan, 2016. "Capacitated Multiechelon Inventory Systems: Policies and Bounds," Manufacturing & Service Operations Management, INFORMS, vol. 18(4), pages 570-584, October.
    20. Zhang, Jianzhong & Xu, Chengxian, 2010. "Inverse optimization for linearly constrained convex separable programming problems," European Journal of Operational Research, Elsevier, vol. 200(3), pages 671-679, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:65:y:2018:i:8:p:594-618. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.