IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v61y2013i1p112-125.html
   My bibliography  Save this article

Allocating Cost of Service to Customers in Inventory Routing

Author

Listed:
  • Okan Örsan Özener

    (Department of Industrial Engineering, Ozyegin University, Istanbul 34794, Turkey)

  • Özlem Ergun

    (H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332)

  • Martin Savelsbergh

    (School of Mathematical and Physical Sciences, University of Newcastle, Callaghan NSW 2308, Australia)

Abstract

Vendor-managed inventory (VMI) replenishment is a collaboration between a supplier and its customers, where the supplier is responsible for managing the customers' inventory levels. In the VMI setting we consider, the supplier exploits synergies between customers, e.g., their locations, usage rates, and storage capacities, to reduce distribution costs. Due to the intricate interactions between customers, calculating a fair cost-to-serve for each customer is a daunting task. However, cost-to-serve information is useful when marketing to new customers or when revisiting routing and delivery quantity decisions. We design mechanisms for this cost allocation problem and determine their characteristics both analytically and computationally.

Suggested Citation

  • Okan Örsan Özener & Özlem Ergun & Martin Savelsbergh, 2013. "Allocating Cost of Service to Customers in Inventory Routing," Operations Research, INFORMS, vol. 61(1), pages 112-125, February.
    • Handle: RePEc:inm:oropre:v:61:y:2013:i:1:p:112-125
    DOI: 10.1287/opre.1120.1130
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1120.1130
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1120.1130?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. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    2. Stefan Engevall & Maud Göthe-Lundgren & Peter Värbrand, 1998. "The traveling salesman game: An application ofcost allocation in a gas and oil company," Annals of Operations Research, Springer, vol. 82(0), pages 203-218, August.
    3. Borm, P.E.M. & Hamers, H.J.M. & Hendrickx, R.L.P., 2001. "Operations research games : A survey," Other publications TiSEM 755a430b-592f-400b-ba18-9, Tilburg University, School of Economics and Management.
    4. Jin-Hwa Song & Martin Savelsbergh, 2007. "Performance Measurement for Inventory Routing," Transportation Science, INFORMS, vol. 41(1), pages 44-54, February.
    5. Potters, J.A.M. & Curiel, I. & Tijs, S.H., 1992. "Traveling salesman games," Other publications TiSEM 0dd4cf3d-25fa-4179-80f6-6, Tilburg University, School of Economics and Management.
    6. Borm, P.E.M. & Hamers, H.J.M. & Hendrickx, R.L.P., 2001. "Operations Research Games : A Survey," Other publications TiSEM 04f265e0-8043-4d4f-bf27-2, Tilburg University, School of Economics and Management.
    7. Stefan Engevall & Maud Göthe-Lundgren & Peter Värbrand, 2004. "The Heterogeneous Vehicle-Routing Game," Transportation Science, INFORMS, vol. 38(1), pages 71-85, February.
    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. Ichiro Nishizaki & Tomohiro Hayashida & Shinya Sekizaki & Kenta Tanaka, 2023. "Averaged dual solution for linear production games and its characterization," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(2), pages 523-555, June.
    2. Mehmet Onur Olgun & Erdal Aydemir, 2021. "A new cooperative depot sharing approach for inventory routing problem," Annals of Operations Research, Springer, vol. 307(1), pages 417-441, December.
    3. Miroslav Prokić, 2023. "The applicability of Cooperative Game Theory in Rail Freight Corridors Framework," Shaping Post-COVID World – Challenges for Economic Theory and Policy, in: Aleksandra Praščević & Miomir Jakšić & Mihail Arandarenko & Dejan Trifunović & Milutin Ješić (ed.),Shaping Post-COVID World – Challenges for Economic Theory and Policy, chapter 14, pages 305-320, Faculty of Economics and Business, University of Belgrade.
    4. Chen, Yan & Huang, Zhenhua & Ai, Hongshan & Guo, Xingkun & Luo, Fan, 2021. "The Impact of GIS/GPS Network Information Systems on the Logistics Distribution Cost of Tobacco Enterprises," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    5. Yves Crama & Mahmood Rezaei & Martin Savelsbergh & Tom Van Woensel, 2018. "Stochastic Inventory Routing for Perishable Products," Transportation Science, INFORMS, vol. 52(3), pages 526-546, June.
    6. Martin Savelsbergh & Tom Van Woensel, 2016. "50th Anniversary Invited Article—City Logistics: Challenges and Opportunities," Transportation Science, INFORMS, vol. 50(2), pages 579-590, May.
    7. Ali Ekici & Okan Örsan Özener & Gültekin Kuyzu, 2015. "Cyclic Delivery Schedules for an Inventory Routing Problem," Transportation Science, INFORMS, vol. 49(4), pages 817-829, November.
    8. Yanjun Shi & Na Lin & Qiaomei Han & Tongliang Zhang & Weiming Shen, 2020. "A Method for Transportation Planning and Profit Sharing in Collaborative Multi-Carrier Vehicle Routing," Mathematics, MDPI, vol. 8(10), pages 1-23, October.
    9. Dan C. Popescu & Philip Kilby, 2020. "Approximation of the Shapley value for the Euclidean travelling salesman game," Annals of Operations Research, Springer, vol. 289(2), pages 341-362, June.
    10. Ichiro Nishizaki & Tomohiro Hayashida & Shinya Sekizaki & Kojiro Furumi, 2023. "A two-stage linear production planning model with partial cooperation under stochastic demands," Annals of Operations Research, Springer, vol. 320(1), pages 293-324, January.
    11. Gansterer, Margaretha & Hartl, Richard F., 2018. "Collaborative vehicle routing: A survey," European Journal of Operational Research, Elsevier, vol. 268(1), pages 1-12.
    12. repec:beo:swcetp:23-14 is not listed on IDEAS
    13. Arroyo, Federico, 2024. "Cost Allocation in Vehicle Routing Problems with Time Windows," Junior Management Science (JUMS), Junior Management Science e. V., vol. 9(1), pages 1241-1268.
    14. Cheng, Lihong & Guo, Xiaolong & Li, Xiaoxiao & Yu, Yugang, 2022. "Data-driven ordering and transshipment decisions for online retailers and logistics service providers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    15. Lai, Minghui & Cai, Xiaoqiang & Li, Xiang, 2017. "Mechanism design for collaborative production-distribution planning with shipment consolidation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 137-159.
    16. Aleksandra Praščević & Miomir Jakšić & Mihail Arandarenko & Dejan Trifunović & Milutin Ješić (ed.), 2023. "Shaping Post-COVID World – Challenges for Economic Theory and Policy," Shaping Post-COVID World – Challenges for Economic Theory and Policy, Faculty of Economics and Business, University of Belgrade, number 23, October –.
    17. Jessica Rodríguez‐Pereira & Burcu Balcik & Marie‐Ève Rancourt & Gilbert Laporte, 2021. "A Cost‐Sharing Mechanism for Multi‐Country Partnerships in Disaster Preparedness," Production and Operations Management, Production and Operations Management Society, vol. 30(12), pages 4541-4565, December.

    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. A. Kimms & I. Kozeletskyi, 2016. "Shapley value-based cost allocation in the cooperative traveling salesman problem under rolling horizon planning," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(4), pages 371-392, December.
    2. Hamers, H.J.M. & Miquel, S. & Norde, H.W., 2011. "Monotonic Stable Solutions for Minimum Coloring Games," Other publications TiSEM efae8d09-83e6-4fe4-9623-e, Tilburg University, School of Economics and Management.
    3. Hamers, H.J.M. & Miquel, S. & Norde, H.W., 2011. "Monotonic Stable Solutions for Minimum Coloring Games," Discussion Paper 2011-016, Tilburg University, Center for Economic Research.
    4. Çiftçi, BarIs & Borm, Peter & Hamers, Herbert, 2010. "Highway games on weakly cyclic graphs," European Journal of Operational Research, Elsevier, vol. 204(1), pages 117-124, July.
    5. repec:wsi:jeapmx:v:20:y:2018:i:04:n:s021919891850007x is not listed on IDEAS
    6. Okan Örsan Özener & Özlem Ergun, 2008. "Allocating Costs in a Collaborative Transportation Procurement Network," Transportation Science, INFORMS, vol. 42(2), pages 146-165, May.
    7. Sanchez-Soriano, Joaquin, 2006. "Pairwise solutions and the core of transportation situations," European Journal of Operational Research, Elsevier, vol. 175(1), pages 101-110, November.
    8. Estévez-Fernández, Arantza, 2012. "A game theoretical approach to sharing penalties and rewards in projects," European Journal of Operational Research, Elsevier, vol. 216(3), pages 647-657.
    9. Giulia Cesari & Roberto Lucchetti & Stefano Moretti, 2017. "Generalized additive games," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(4), pages 919-939, November.
    10. van Beek, Andries & Malmberg, Benjamin & Borm, Peter & Quant, Marieke & Schouten, Jop, 2021. "Cooperation and Competition in Linear Production and Sequencing Processes," Other publications TiSEM fd7a301b-7ef3-4142-835d-a, Tilburg University, School of Economics and Management.
    11. Thijssen, J.J.J., 2003. "Investment under uncertainty, market evolution and coalition spillovers in a game theoretic perspective," Other publications TiSEM 672073a6-492e-4621-8d4a-0, Tilburg University, School of Economics and Management.
    12. Grundel, S. & Borm, P.E.M. & Hamers, H.J.M., 2011. "A Compromise Stable Extension of Bankruptcy Games : Multipurpose Resource Allocation," Other publications TiSEM b1926d6b-22f4-4f28-84a2-9, Tilburg University, School of Economics and Management.
    13. Barış Bülent Kırlar & Serap Ergün & Sırma Zeynep Alparslan Gök & Gerhard-Wilhelm Weber, 2018. "A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects," Annals of Operations Research, Springer, vol. 260(1), pages 217-231, January.
    14. Alparslan-Gok, S.Z. & Miquel, S. & Tijs, S.H., 2008. "Cooperation under Interval Uncertainty," Other publications TiSEM 9a01bd57-964d-4e71-8508-7, Tilburg University, School of Economics and Management.
    15. Reijnierse, Hans & Borm, Peter & Quant, Marieke & Meertens, Marc, 2010. "Processing games with restricted capacities," European Journal of Operational Research, Elsevier, vol. 202(3), pages 773-780, May.
    16. Lorenzo Castelli & Raffaele Pesenti & Andrea Ranieri, 2009. "Allocating Air Traffic Flow Management Slots," Working Papers 191, Department of Applied Mathematics, Università Ca' Foscari Venezia.
    17. Flip Klijn & Marco Slikker, 2004. "Distribution Center Consolidation Games," UFAE and IAE Working Papers 602.04, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
    18. Algaba, Encarnación & Béal, Sylvain & Fragnelli, Vito & Llorca, Natividad & Sánchez-Soriano, Joaquin, 2019. "Relationship between labeled network games and other cooperative games arising from attributes situations," Economics Letters, Elsevier, vol. 185(C).
    19. Fernandez, F. R. & Hinojosa, M. A. & Puerto, J., 2004. "Set-valued TU-games," European Journal of Operational Research, Elsevier, vol. 159(1), pages 181-195, November.
    20. Soesja Grundel & Peter Borm & Herbert Hamers, 2013. "Resource allocation games: a compromise stable extension of bankruptcy games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(2), pages 149-169, October.
    21. Munich, Léa, 2024. "Schedule situations and their cooperative game theoretic representations," European Journal of Operational Research, Elsevier, vol. 316(2), pages 767-778.

    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:oropre:v:61:y:2013:i:1:p:112-125. 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.