IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v307y2021i1d10.1007_s10479-021-04122-z.html
   My bibliography  Save this article

A new cooperative depot sharing approach for inventory routing problem

Author

Listed:
  • Mehmet Onur Olgun

    (Suleyman Demirel University, Engineering Faculty, Dept. of Industrial Engineering)

  • Erdal Aydemir

    (Suleyman Demirel University, Engineering Faculty, Dept. of Industrial Engineering)

Abstract

This paper addresses cooperative game theory based bi-objective inventory routing problem, where replenishment plans are assumed as a coalition structure. Particularly, a distribution system is a set of customers that may order a single product from unique wholesalers to satisfy their own demands. When the products are carried from one depot to customers, transportation and inventory costs are incurred and some of the customers have insufficient depot capacity to their order levels. Therefore, in this paper, customers are willing to cooperate for cost saving benefits, where the depots are cooperatively used by each other with additional cost. The cooperative inventory game is established. An application is performed in a furniture roving parts company with the Shapley value cost allocation methods. The main objective of the study is to make a new replenishment plan for the demand of the customers, while meet the demands by sharing each other's depots and inventory routing costs. In addition, an improvement of 1.67% is obtained in vehicle utilization. Moreover, the proposed distribution method makes it possible to satisfy all customers demand for their own period. It helps customers who do not satisfy the demand into the warehouse, the three other most free capacitive customers can take the excess orders into their warehouse which are included in the coalition. As a result, a new effective replenishment plan has been obtained that it is economical to bear the additional costs.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:307:y:2021:i:1:d:10.1007_s10479-021-04122-z
    DOI: 10.1007/s10479-021-04122-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-021-04122-z
    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/s10479-021-04122-z?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. Ann Melissa Campbell & Martin W. P. Savelsbergh, 2004. "A Decomposition Approach for the Inventory-Routing Problem," Transportation Science, INFORMS, vol. 38(4), pages 488-502, November.
    2. Zhalechian, M. & Tavakkoli-Moghaddam, R. & Zahiri, B. & Mohammadi, M., 2016. "Sustainable design of a closed-loop location-routing-inventory supply chain network under mixed uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 182-214.
    3. SCHMEIDLER, David, 1969. "The nucleolus of a characteristic function game," LIDAM Reprints CORE 44, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. 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.
    5. Tijs, S.H. & Driessen, T.S.H., 1986. "Game theory and cost allocation problems," Other publications TiSEM 376c24c5-c95d-4d29-96b6-4, Tilburg University, School of Economics and Management.
    6. S. H. Tijs & T. S. H. Driessen, 1986. "Game Theory and Cost Allocation Problems," Management Science, INFORMS, vol. 32(8), pages 1015-1028, August.
    7. Niakan, Farzad & Rahimi, Mohammad, 2015. "A multi-objective healthcare inventory routing problem; a fuzzy possibilistic approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 80(C), pages 74-94.
    8. Richa Agarwal & Özlem Ergun, 2010. "Network Design and Allocation Mechanisms for Carrier Alliances in Liner Shipping," Operations Research, INFORMS, vol. 58(6), pages 1726-1742, December.
    9. Baita, Flavio & Ukovich, Walter & Pesenti, Raffaele & Favaretto, Daniela, 1998. "Dynamic routing-and-inventory problems: a review," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(8), pages 585-598, November.
    10. Walter J. Bell & Louis M. Dalberto & Marshall L. Fisher & Arnold J. Greenfield & R. Jaikumar & Pradeep Kedia & Robert G. Mack & Paul J. Prutzman, 1983. "Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer," Interfaces, INFORMS, vol. 13(6), pages 4-23, December.
    11. Manuel Mateo & El-Houssaine Aghezzaf & Pau Vinyes, 2012. "A combined inventory routing and game theory approach to solve a real-life distribution problem," International Journal of Business Performance and Supply Chain Modelling, Inderscience Enterprises Ltd, vol. 4(1), pages 75-89.
    12. 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.
    13. Claudia Archetti & Luca Bertazzi & Gilbert Laporte & Maria Grazia Speranza, 2007. "A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem," Transportation Science, INFORMS, vol. 41(3), pages 382-391, August.
    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. Mohamed Salim Amri Sakhri & Mounira Tlili & Ouajdi Korbaa, 2022. "A memetic algorithm for the inventory routing problem," Journal of Heuristics, Springer, vol. 28(3), pages 351-375, June.

    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. Gao, Evelyn & Sowlati, Taraneh & Akhtari, Shaghaygh, 2019. "Profit allocation in collaborative bioenergy and biofuel supply chains," Energy, Elsevier, vol. 188(C).
    2. Mirzapour Al-e-hashem, Seyed M.J. & Rekik, Yacine & Mohammadi Hoseinhajlou, Ebrahim, 2019. "A hybrid L-shaped method to solve a bi-objective stochastic transshipment-enabled inventory routing problem," International Journal of Production Economics, Elsevier, vol. 209(C), pages 381-398.
    3. A. Mor & M. G. Speranza, 2020. "Vehicle routing problems over time: a survey," 4OR, Springer, vol. 18(2), pages 129-149, June.
    4. Frisk, M. & Göthe-Lundgren, M. & Jörnsten, K. & Rönnqvist, M., 2010. "Cost allocation in collaborative forest transportation," European Journal of Operational Research, Elsevier, vol. 205(2), pages 448-458, September.
    5. Grigoriev, Alexander & Jung, Verena & Peeters - Rutten, Marianne & Vredeveld, Tjark, 2017. "On the Acceptance of Gain Sharing Methods in Supply Chain Collaboration," Research Memorandum 024, Maastricht University, Graduate School of Business and Economics (GSBE).
    6. Song, Ruidian & Zhao, Lei & Van Woensel, Tom & Fransoo, Jan C., 2019. "Coordinated delivery in urban retail," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 122-148.
    7. Cárdenas-Barrón, Leopoldo Eduardo & González-Velarde, José Luis & Treviño-Garza, Gerardo & Garza-Nuñez, Dagoberto, 2019. "Heuristic algorithm based on reduce and optimize approach for a selective and periodic inventory routing problem in a waste vegetable oil collection environment," International Journal of Production Economics, Elsevier, vol. 211(C), pages 44-59.
    8. Ramaekers, Katrien & Verdonck, Lotte & Caris, An & Meers, Dries & Macharis, Cathy, 2017. "Allocating collaborative costs in multimodal barge networks for freight bundling," Journal of Transport Geography, Elsevier, vol. 65(C), pages 56-69.
    9. DEFRYN, Christof & SÖRENSEN, Kenneth & CORNELISSENS, Trijntje, 2015. "The selective vehicle routing problem in a collaborative environment," Working Papers 2015006, University of Antwerp, Faculty of Business and Economics.
    10. 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.
    11. Markov, Iliya & Bierlaire, Michel & Cordeau, Jean-François & Maknoon, Yousef & Varone, Sacha, 2018. "A unified framework for rich routing problems with stochastic demands," Transportation Research Part B: Methodological, Elsevier, vol. 114(C), pages 213-240.
    12. M. Fiestras-Janeiro & Ignacio García-Jurado & Manuel Mosquera, 2011. "Cooperative games and cost allocation problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(1), pages 1-22, July.
    13. 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.
    14. Lozano, S. & Moreno, P. & Adenso-Díaz, B. & Algaba, E., 2013. "Cooperative game theory approach to allocating benefits of horizontal cooperation," European Journal of Operational Research, Elsevier, vol. 229(2), pages 444-452.
    15. Paweł Hanczar, 2014. "Solving IRP using location based heuristics," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 24(2), pages 81-96.
    16. Liu, Wenqian & Ke, Ginger Y. & Chen, Jian & Zhang, Lianmin, 2020. "Scheduling the distribution of blood products: A vendor-managed inventory routing approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    17. Juan Aparicio & Joaquín Sánchez-Soriano, 2008. "Depreciation games," Annals of Operations Research, Springer, vol. 158(1), pages 205-218, February.
    18. Sıla Çetinkaya & Halit Üster & Gopalakrishnan Easwaran & Burcu Baris Keskin, 2009. "An Integrated Outbound Logistics Model for Frito-Lay: Coordinating Aggregate-Level Production and Distribution Decisions," Interfaces, INFORMS, vol. 39(5), pages 460-475, October.
    19. S. Michel & F. Vanderbeck, 2012. "A Column-Generation Based Tactical Planning Method for Inventory Routing," Operations Research, INFORMS, vol. 60(2), pages 382-397, April.
    20. Salant, David J, 2007. "Formulas for fair, reasonable and non-discriminatory royalty determination," MPRA Paper 8569, University Library of Munich, Germany.

    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:annopr:v:307:y:2021:i:1:d:10.1007_s10479-021-04122-z. 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.