IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v22y2022i5d10.1007_s12351-022-00705-1.html
   My bibliography  Save this article

Design of the cost allocation rule for joint replenishment to an overseas warehouse with a piecewise linear holding cost rate

Author

Listed:
  • Xuefei Shi

    (Southeast University)

  • Haiyan Wang

    (Southeast University)

Abstract

To obtain higher profits, a third-party overseas warehouse increases the delivery frequency of goods by setting a holding cost rate that increases with the holding time. To reduce the cost incurred from using the third-party overseas warehouse, small cross-border e-commerce retailers form a coalition to jointly replenish the overseas warehouse. Based on cooperative game theory, this paper designs a cost allocation rule to allocate the total cost of a cooperative coalition. The cost allocation rule is proved to be in the core of the corresponding cooperative game, indicating that it satisfies individual rationality and coalition rationality. An $$(1+\epsilon )$$ ( 1 + ϵ ) -approximate algorithm is presented to search for the optimal replenishment cycle under joint replenishment. Numerical experiments show that joint replenishment can help small cross-border e-commerce retailers to reduce costs, shorten replenishment cycles, and expedite commodity turnover. Having a greater number of retailers involved in joint replenishment would help to save more costs. The average saving cost rate after cooperation can be 58% when the fixed costs are very high.

Suggested Citation

  • Xuefei Shi & Haiyan Wang, 2022. "Design of the cost allocation rule for joint replenishment to an overseas warehouse with a piecewise linear holding cost rate," Operational Research, Springer, vol. 22(5), pages 4905-4929, November.
  • Handle: RePEc:spr:operea:v:22:y:2022:i:5:d:10.1007_s12351-022-00705-1
    DOI: 10.1007/s12351-022-00705-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-022-00705-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s12351-022-00705-1?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Danny Segev, 2014. "An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 432-444, May.
    2. Jiawei Zhang, 2009. "Cost Allocation for Joint Replenishment Models," Operations Research, INFORMS, vol. 57(1), pages 146-156, February.
    3. Moon, I.K. & Cha, B.C., 2006. "The joint replenishment problem with resource restriction," European Journal of Operational Research, Elsevier, vol. 173(1), pages 190-198, August.
    4. 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.
    5. Shiman Ding & Philip M. Kaminsky, 2020. "Centralized and Decentralized Warehouse Logistics Collaboration," Manufacturing & Service Operations Management, INFORMS, vol. 22(4), pages 812-831, July.
    6. Dror, Moshe & Hartman, Bruce C. & Chang, Wei, 2012. "The cost allocation issue in joint replenishment," International Journal of Production Economics, Elsevier, vol. 135(1), pages 242-254.
    7. Robin Roundy, 1985. "98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems," Management Science, INFORMS, vol. 31(11), pages 1416-1430, November.
    8. Awi Federgruen & Min Wang, 2015. "Inventory Models with Shelf-Age and Delay-Dependent Inventory Costs," Operations Research, INFORMS, vol. 63(3), pages 701-715, June.
    9. Moshe Dror & Bruce C. Hartman, 2007. "Shipment Consolidation: Who Pays for It and How Much?," Management Science, INFORMS, vol. 53(1), pages 78-87, January.
    10. Ji Seong Noh & Jong Soo Kim & Biswajit Sarkar, 2019. "Stochastic joint replenishment problem with quantity discounts and minimum order constraints," Operational Research, Springer, vol. 19(1), pages 151-178, March.
    11. Cui, Ligang & Deng, Jie & Liu, Rui & Xu, Dongyang & Zhang, Yajun & Xu, Maozeng, 2020. "A stochastic multi-item replenishment and delivery problem with lead-time reduction initiatives and the solving methodologies," Applied Mathematics and Computation, Elsevier, vol. 374(C).
    12. Simai He & Jay Sethuraman & Xuan Wang & Jiawei Zhang, 2017. "A NonCooperative Approach to Cost Allocation in Joint Replenishment," Operations Research, INFORMS, vol. 65(6), pages 1562-1573, December.
    13. Porras, Eric & Dekker, Rommert, 2006. "An efficient optimal solution method for the joint replenishment problem with minimum order quantities," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1595-1615, November.
    14. Hezarkhani, Behzad & Slikker, Marco & Van Woensel, Tom, 2018. "Collaborative replenishment in the presence of intermediaries," European Journal of Operational Research, Elsevier, vol. 266(1), pages 135-146.
    15. Marcello Braglia & Davide Castellano & Marco Frosolini, 2016. "Joint-replenishment problem under stochastic demands with backorders-lost sales mixtures, controllable lead times, and investment to reduce the major ordering cost," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(8), pages 1108-1120, August.
    16. Young Hyeon Yang & Jong Soo Kim, 2020. "An adaptive joint replenishment policy for items with non-stationary demands," Operational Research, Springer, vol. 20(3), pages 1665-1684, September.
    17. Shoshana Anily & Moshe Haviv, 2007. "The Cost Allocation Problem for the First Order Interaction Joint Replenishment Model," Operations Research, INFORMS, vol. 55(2), pages 292-302, April.
    18. Retsef Levi & Robin Roundy & David Shmoys & Maxim Sviridenko, 2008. "A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem," Management Science, INFORMS, vol. 54(4), pages 763-776, April.
    19. Maher Agi & Hardik Soni, 2019. "Joint pricing and inventory decisions for perishable products with age-, stock-, and price-dependent demand rate," Post-Print hal-02014642, HAL.
    20. Tamar Cohen-Hillel & Liron Yedidsion, 2018. "The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1269-1289, November.
    21. Carlos Otero-Palencia & René Amaya–Mier & Ruben Yie-Pinedo, 2019. "A stochastic joint replenishment problem considering transportation and warehouse constraints with gainsharing by Shapley Value allocation," International Journal of Production Research, Taylor & Francis Journals, vol. 57(10), pages 3036-3059, May.
    22. Hoque, M.A., 2006. "An optimal solution technique for the joint replenishment problem with storage and transport capacities and budget constraints," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1033-1042, December.
    23. Ben Jouida, Sihem & Krichen, Saoussen & Klibi, Walid, 2017. "Coalition-formation problem for sourcing contract design in supply networks," European Journal of Operational Research, Elsevier, vol. 257(2), pages 539-558.
    24. Ongkunaruk, P. & Wahab, M.I.M. & Chen, Y., 2016. "A genetic algorithm for a joint replenishment problem with resource and shipment constraints and defective items," International Journal of Production Economics, Elsevier, vol. 175(C), pages 142-152.
    25. Chung, Chia-Shin & Hum, Sin-Hoon & Kirca, Omer, 1996. "The coordinated replenishment dynamic lot-sizing problem with quantity discounts," European Journal of Operational Research, Elsevier, vol. 94(1), pages 122-133, 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. Carvajal, Jimmy & Castaño, Fabian & Sarache, William & Costa, Yasel, 2020. "Heuristic approaches for a two-echelon constrained joint replenishment and delivery problem," International Journal of Production Economics, Elsevier, vol. 220(C).
    2. Simai He & Jay Sethuraman & Xuan Wang & Jiawei Zhang, 2017. "A NonCooperative Approach to Cost Allocation in Joint Replenishment," Operations Research, INFORMS, vol. 65(6), pages 1562-1573, December.
    3. Shiyu Liu & Ou Liu & Xiaoming Jiang, 2023. "An Efficient Algorithm for the Joint Replenishment Problem with Quantity Discounts, Minimum Order Quantity and Transport Capacity Constraints," Mathematics, MDPI, vol. 11(4), pages 1-18, February.
    4. 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.
    5. Körpeoğlu, Evren & Şen, Alper & Güler, Kemal, 2013. "Non-cooperative joint replenishment under asymmetric information," European Journal of Operational Research, Elsevier, vol. 227(3), pages 434-443.
    6. Tamar Cohen-Hillel & Liron Yedidsion, 2018. "The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1269-1289, November.
    7. Behzad Hezarkhani & Greys Sošić, 2019. "Who’s Afraid of Strategic Behavior? Mechanisms for Group Purchasing," Production and Operations Management, Production and Operations Management Society, vol. 28(4), pages 933-954, April.
    8. Jean-Philippe Gayon & Guillaume Massonnet & Christophe Rapine & Gautier Stauffer, 2017. "Fast Approximation Algorithms for the One-Warehouse Multi-Retailer Problem Under General Cost Structures and Capacity Constraints," Mathematics of Operations Research, INFORMS, vol. 42(3), pages 854-875, August.
    9. Güler, Kemal & Körpeoğlu, Evren & Şen, Alper, 2017. "Design and analysis of mechanisms for decentralized joint replenishment," European Journal of Operational Research, Elsevier, vol. 259(3), pages 992-1002.
    10. Wang, Min & Zhao, Lindu & Herty, Michael, 2019. "Joint replenishment and carbon trading in fresh food supply chains," European Journal of Operational Research, Elsevier, vol. 277(2), pages 561-573.
    11. Muriel, Ana & Chugh, Tammana & Prokle, Michael, 2022. "Efficient algorithms for the joint replenishment problem with minimum order quantities," European Journal of Operational Research, Elsevier, vol. 300(1), pages 137-150.
    12. M Dror & B C Hartman, 2011. "Survey of cooperative inventory games and extensions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 565-580, April.
    13. Amaya, Ciro Alberto & Carvajal, Jimmy & Castaño, Fabian, 2013. "A heuristic framework based on linear programming to solve the constrained joint replenishment problem (C-JRP)," International Journal of Production Economics, Elsevier, vol. 144(1), pages 243-247.
    14. Evren Körpeoğlu & Alper Şen & Kemal Güler, 2012. "A private contributions game for joint replenishment," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 75(1), pages 67-82, February.
    15. Nguyen, Christine & Dessouky, Maged & Toriello, Alejandro, 2014. "Consolidation strategies for the delivery of perishable products," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 108-121.
    16. Gautier Stauffer, 2018. "Approximation algorithms for k-echelon extensions of the one warehouse multi-retailer problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 88(3), pages 445-473, December.
    17. Cui, Ligang & Deng, Jie & Liu, Rui & Xu, Dongyang & Zhang, Yajun & Xu, Maozeng, 2020. "A stochastic multi-item replenishment and delivery problem with lead-time reduction initiatives and the solving methodologies," Applied Mathematics and Computation, Elsevier, vol. 374(C).
    18. Mostafa Parsa & Ali Shahandeh Nookabadi & Zümbül Atan & Yaser Malekian, 2022. "An optimal inventory policy for a multi-echelon closed-loop supply chain of postconsumer recycled content products," Operational Research, Springer, vol. 22(3), pages 1887-1938, July.
    19. Fiestras-Janeiro, M.G. & García-Jurado, I. & Meca, A. & Mosquera, M.A., 2011. "Cooperative game theory and inventory management," European Journal of Operational Research, Elsevier, vol. 210(3), pages 459-466, May.
    20. Hezarkhani, Behzad & Slikker, Marco & Van Woensel, Tom, 2018. "Collaborative replenishment in the presence of intermediaries," European Journal of Operational Research, Elsevier, vol. 266(1), pages 135-146.

    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:spr:operea:v:22:y:2022:i:5:d:10.1007_s12351-022-00705-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.