Cost allocation in inventory transportation systems
UNIVERSAL IDENTIFIER: http://hdl.handle.net/11093/1048
EDITED VERSION: http://link.springer.com/10.1007/s11750-011-0207-7
UNESCO SUBJECT: 1207.08 Inventarios
DOCUMENT TYPE: article
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.
Files in this item
- 2012_Cost allocation in invent ...