, Volume 20, Issue 2, pp 397–410 | Cite as

Cost allocation in inventory transportation systems

  • M. G. Fiestras-Janeiro
  • I. García-Jurado
  • A. MecaEmail author
  • M. A. Mosquera
Original Paper


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.


Inventory transportation systems Cooperative games Core Cost allocation rule 

Mathematics Subject Classification (2000)

91A12 91A80 90B05 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Anily S, Haviv M (2007) The cost allocation problem for the first order interaction joint replenishment model. Oper Res 55:292–302 CrossRefGoogle Scholar
  2. Dror M, Hartman BC (2007) Shipment consolidation: who pays for it and how much? Manag Sci 53:78–87 CrossRefGoogle Scholar
  3. 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
  4. Hart S, Mas-Colell A (1989) Potential, value and consistency. Econometrica 57:589–614 CrossRefGoogle Scholar
  5. Meca A, García-Jurado I, Borm P (2003) Cooperation and competition in inventory games. Math Methods Oper Res 57:481–493 Google Scholar
  6. Meca A, Timmer J, García-Jurado I, Borm P (2004) Inventory games. Eur J Oper Res 156:127–139 CrossRefGoogle Scholar
  7. Moretti S, Patrone F (2008) Transversality of the Shapley value. Top 16:1–41 CrossRefGoogle Scholar
  8. Mosquera MA, Fiestras-Janeiro G, García-Jurado I (2008) A note on coalitional manipulation and centralized inventory management. Ann Oper Res 158:183–188 CrossRefGoogle Scholar
  9. Ülkü MA (2009) Comparison of typical shipment consolidation programs: structural results. Manag Sci Eng 3:27–33 Google Scholar
  10. Zhang J (2009) Cost allocation for joint replenisment models. Oper Res 57:146–156 CrossRefGoogle Scholar
  11. Zipkin P (2000) Foundations of inventory management. McGraw Hill, New York Google Scholar

Copyright information

© Sociedad de Estadística e Investigación Operativa 2011

Authors and Affiliations

  • M. G. Fiestras-Janeiro
    • 1
  • I. García-Jurado
    • 2
  • A. Meca
    • 3
    Email author
  • M. A. Mosquera
    • 4
  1. 1.Department of Statistics and Operations Research, Faculty of EconomicsVigo UniversityVigoSpain
  2. 2.Department of Mathematics, Faculty of Computer ScienceCoruña UniversityCoruñaSpain
  3. 3.Center of Operations ResearchMiguel Hernández UniversityElcheSpain
  4. 4.Department of Statistics and Operations Research, Faculty of Business Administration and TourismVigo UniversityOurenseSpain

Personalised recommendations