Cost allocation in inventory transportation systems
- 353 Downloads
In this paper, we deal with the cost allocation problem arising in an inventory transportation system with a single item and multiple agents that place joint orders using an EOQ policy. In our problem, the fixed-order cost of each agent is the sum of a first component (common to all agents) plus a second component which depends on the distance from the agent to the supplier. We assume that agents are located on a line route, in the sense that if any subgroup of agents places a joint order, its fixed cost is the sum of the first component plus the second component of the agent in the group at maximal distance from the supplier. For these inventory transportation systems, we introduce and characterize a rule which allows us to allocate the costs generated by the joint order. This rule has the same flavor as the Shapley value, but requires less computational effort. We show that our rule has good properties from the point of view of stability.
KeywordsInventory transportation systems Cooperative games Core Cost allocation rule
Mathematics Subject Classification (2000)91A12 91A80 90B05
Unable to display preview. Download preview PDF.
- González-Díaz J, García-Jurado I, Fiestras-Janeiro G (2010) An introductory course on mathematical game theory. American Mathematical Society, Providence Google Scholar
- Meca A, García-Jurado I, Borm P (2003) Cooperation and competition in inventory games. Math Methods Oper Res 57:481–493 Google Scholar
- Ülkü MA (2009) Comparison of typical shipment consolidation programs: structural results. Manag Sci Eng 3:27–33 Google Scholar
- Zipkin P (2000) Foundations of inventory management. McGraw Hill, New York Google Scholar