IDEAS home Printed from https://ideas.repec.org/a/inm/ormsom/v20y2018i3p517-530.html
   My bibliography  Save this article

Automated Teller Machine Replenishment Policies with Submodular Costs

Author

Listed:
  • Yu Zhang

    (University of North Carolina at Chapel Hill, Chapel Hill, North Carolina 27599)

  • Vidyadhar Kulkarni

    (University of North Carolina at Chapel Hill, Chapel Hill, North Carolina 27599)

Abstract

We develop an automated teller machine (ATM) replenishment policy for a bank that operates multiple ATMs. The aim is to minimize the cost of replenishments and stockouts, taking into account the economies of scale involved in replenishing multiple ATMs simultaneously. When the replenishment is outsourced to an outside vendor, the replenishment cost is typically additive. However, when it is done by in-house operations, the replenishment cost is a submodular function of the set of ATMs being replenished. The additive replenishment cost function yields a tractable and separable inventory management problem. However, the submodular cost function creates a much harder problem. We construct a Markov decision process model and study the structure of the optimal strategy that minimizes the long-run average cost. Since the optimal policy is analytically and computationally intractable for the case of a large number of ATMs, we study a heuristic policy (called the index policy) in the case of submodular replenishment costs. We find that the index policy performs close to the optimal policy (when it can be computed) and performs much better than the benchmark (namely, an ( s , M ) policy) in general. We demonstrate similar findings in a real-world data set with 139 ATMs and 20 months of historical demand data. Finally, we recommend that the bank managers use the index policy to design a replenishment schedule.

Suggested Citation

  • Yu Zhang & Vidyadhar Kulkarni, 2018. "Automated Teller Machine Replenishment Policies with Submodular Costs," Manufacturing & Service Operations Management, INFORMS, vol. 20(3), pages 517-530, July.
  • Handle: RePEc:inm:ormsom:v:20:y:2018:i:3:p:517-530
    DOI: 10.1287/msom.2017.0656
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/msom.2017.0656
    Download Restriction: no

    File URL: https://libkey.io/10.1287/msom.2017.0656?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. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions - 1," LIDAM Reprints CORE 334, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Khouja, Moutaz & Goyal, Suresh, 2008. "A review of the joint replenishment problem literature: 1989-2005," European Journal of Operational Research, Elsevier, vol. 186(1), pages 1-16, April.
    3. Edward Ignall, 1969. "Optimal Continuous Review Policies for Two Product Inventory Systems with Joint Setup Costs," Management Science, INFORMS, vol. 15(5), pages 278-283, January.
    4. Herer, Yale T., 1999. "Submodularity and the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 114(3), pages 489-508, May.
    5. 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.
    6. Andrew J. Clark & Herbert Scarf, 2004. "Optimal Policies for a Multi-Echelon Inventory Problem," Management Science, INFORMS, vol. 50(12_supple), pages 1782-1790, December.
    7. Arthur F. Veinott, Jr. & Harvey M. Wagner, 1965. "Computing Optimal (s, S) Inventory Policies," Management Science, INFORMS, vol. 11(5), pages 525-552, March.
    8. A. Federgruen & H. Groenevelt & H. C. Tijms, 1984. "Coordinated Replenishments in a Multi-Item Inventory System with Compound Poisson Demands," Management Science, INFORMS, vol. 30(3), pages 344-357, March.
    9. Yale Herer & Robin Roundy, 1997. "Heuristics for a One-Warehouse Multiretailer Distribution Problem with Performance Bounds," Operations Research, INFORMS, vol. 45(1), pages 102-115, February.
    10. Lawrence D. Burns & Randolph W. Hall & Dennis E. Blumenfeld & Carlos F. Daganzo, 1985. "Distribution Strategies that Minimize Transportation and Inventory Costs," Operations Research, INFORMS, vol. 33(3), pages 469-490, June.
    11. Fisher, M.L. & Nemhauser, G.L. & Wolsey, L.A., 1978. "An analysis of approximations for maximizing submodular set functions," LIDAM Reprints CORE 341, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    12. Goyal, Suresh K. & Satir, Ahmet T., 1989. "Joint replenishment inventory control: Deterministic and stochastic models," European Journal of Operational Research, Elsevier, vol. 38(1), pages 2-13, January.
    13. Awi Federgruen & Paul Zipkin, 1984. "A Combined Vehicle Routing and Inventory Allocation Problem," Operations Research, INFORMS, vol. 32(5), pages 1019-1037, October.
    Full references (including those not matched with items on IDEAS)

    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. Padilla Tinoco, Silvia Valeria & Creemers, Stefan & Boute, Robert N., 2017. "Collaborative shipping under different cost-sharing agreements," European Journal of Operational Research, Elsevier, vol. 263(3), pages 827-837.
    2. Creemers, Stefan & Boute, Robert, 2022. "The joint replenishment problem: Optimal policy and exact evaluation method," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1175-1188.
    3. Stefanny Ramirez & Laurence H. Brandenburg & Dario Bauso, 2023. "Coordinated Replenishment Game and Learning Under Time Dependency and Uncertainty of the Parameters," Dynamic Games and Applications, Springer, vol. 13(1), pages 326-352, March.
    4. Kouki, Chaaben & Babai, M. Zied & Jemai, Zied & Minner, Stefan, 2016. "A coordinated multi-item inventory system for perishables with random lifetime," International Journal of Production Economics, Elsevier, vol. 181(PA), pages 226-237.
    5. Li, Xiaoming, 2010. "Optimal inventory policies in decentralized supply chains," International Journal of Production Economics, Elsevier, vol. 128(1), pages 303-309, November.
    6. Dai, Bo & Chen, Haoxun & Li, Yuan & Zhang, Yidong & Wang, Xiaoqing & Deng, Yuming, 2023. "An alternating direction method of multipliers for optimizing (s, S) policies in a distribution system with joint replenishment volume constraints," Omega, Elsevier, vol. 116(C).
    7. Leandro C. Coelho & Jean-François Cordeau & Gilbert Laporte, 2014. "Thirty Years of Inventory Routing," Transportation Science, INFORMS, vol. 48(1), pages 1-19, February.
    8. Liu, Liming & Yuan, Xue-Ming, 2000. "Coordinated replenishments in inventory systems with correlated demands," European Journal of Operational Research, Elsevier, vol. 123(3), pages 490-503, June.
    9. Saeed Poormoaied, 2022. "Inventory decision in a periodic review inventory model with two complementary products," Annals of Operations Research, Springer, vol. 315(2), pages 1937-1970, August.
    10. Luca Bertazzi, 2008. "Analysis of Direct Shipping Policies in an Inventory-Routing Problem with Discrete Shipping Times," Management Science, INFORMS, vol. 54(4), pages 748-762, April.
    11. Anton J. Kleywegt & Vijay S. Nori & Martin W. P. Savelsbergh, 2004. "Dynamic Programming Approximations for a Stochastic Inventory Routing Problem," Transportation Science, INFORMS, vol. 38(1), pages 42-70, February.
    12. Kiesmüller, G.P., 2010. "Multi-item inventory control with full truckloads: A comparison of aggregate and individual order triggering," European Journal of Operational Research, Elsevier, vol. 200(1), pages 54-62, January.
    13. Hao Yuan & Qi Luo & Cong Shi, 2021. "Marrying Stochastic Gradient Descent with Bandits: Learning Algorithms for Inventory Systems with Fixed Costs," Management Science, INFORMS, vol. 67(10), pages 6089-6115, October.
    14. Timmer, Judith & Chessa, Michela & Boucherie, Richard J., 2013. "Cooperation and game-theoretic cost allocation in stochastic inventory models with continuous review," European Journal of Operational Research, Elsevier, vol. 231(3), pages 567-576.
    15. Mohit Singh & Weijun Xie, 2020. "Approximation Algorithms for D -optimal Design," Mathematics of Operations Research, INFORMS, vol. 45(4), pages 1512-1534, November.
    16. Qi‐Ming He & James H. Bookbinder & Qishu Cai, 2020. "Optimal policies for stochastic clearing systems with time‐dependent delay penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(7), pages 487-502, October.
    17. Ortiz-Astorquiza, Camilo & Contreras, Ivan & Laporte, Gilbert, 2018. "Multi-level facility location problems," European Journal of Operational Research, Elsevier, vol. 267(3), pages 791-805.
    18. Dam, Tien Thanh & Ta, Thuy Anh & Mai, Tien, 2022. "Submodularity and local search approaches for maximum capture problems under generalized extreme value models," European Journal of Operational Research, Elsevier, vol. 300(3), pages 953-965.
    19. Sivakumar, B., 2008. "Two-commodity inventory system with retrial demand," European Journal of Operational Research, Elsevier, vol. 187(1), pages 70-83, May.
    20. Bo Dai & Fenfen Li, 2021. "Joint Inventory Replenishment Planning of an E-Commerce Distribution System with Distribution Centers at Producers’ Locations," Logistics, MDPI, vol. 5(3), pages 1-14, July.

    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:inm:ormsom:v:20:y:2018:i:3:p:517-530. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.