Allocating cost of service to customers in inventory routing

Operations Research

Volumn 61, Issue 1, 2013, Pages 112-125

  Özener, Okan Örsan ^a   Ergun, Özlem ^b   Savelsbergh, Martin ^c  

^a OZYEGIN UNIVERSITY   (Turkey)

^b Georgia Institute of Technology   (United States)

^c UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

Cost allocation; Cost to serve; Inventory routing problem; Vendor managed inventory

Indexed keywords

COST ALLOCATION; COST ALLOCATION PROBLEM; COST-TO-SERVE; DESIGN MECHANISMS; DISTRIBUTION COSTS; INVENTORY ROUTING; INVENTORY ROUTING PROBLEMS; VENDOR MANAGED INVENTORY;

COST ACCOUNTING; COSTS;

SALES;

EID: 84876133515     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1120.1130     Document Type: Article

References (16)

1. Bertazzi L, Savelsbergh M, Speranza MG (2008) Inventory routing. Golden B, Raghavan S, Wasil E, eds. The Vehicle Routing Problem: Latest Advances and New Challenges (Springer Science C Business Media, LLC, New York), 49-72.
2. Borm P, Hamers H, Hendrickx R (2001) Operations research games: A survey. TOP 9(2):139-199.
3. Campbell AM, Clarke L, Kleywegt A, Savelsbergh MWP (1998) The inventory routing problem. Crainic T, Laporte G, eds. Fleet Management and Logistics (Kluwer Academic Publishers, Boston).
4. Cordeau J-F, Laporte G, Savelsbergh MWP, Vigo D (2007) Short-haul routing. Laporte G, Barnhart C, eds. Transportation. Handbooks in Operations Research and Management Science (North-Holland, Amsterdam).
5. Engevall S, Gothe-Lundgren M, Varbrand P (1998) The traveling salesman game: An application of cost allocation in a gas and oil company. Ann. Oper. Res. 82(0):203-218.
6. Engevall S, Gothe-Lundgren M, Varbrand P (2004) The heterogeneous vehicle-routing game. Transportation Sci. 38(1):71-85.
7. Faigle U, Fekete SP, Hochstattler W, Kern W (1998) On approximately fair cost allocation in Euclidean TSP games. OR Spektrum 20(1): 29-37.
8. Goemans MX, Skutella M (2004) Cooperative facility location games. J. Algorithms 50(2):194-214.
9. Gothe-Lundgren M, Jornsten K, Varbrand P (1996) On the nucleolus of the basic vehicle routing game. Math. Programming 72(1):83-100.
10. Kuipers J (1993) A note on the 5-person traveling salesman game. Math. Methods Oper. Res. 38(2):131-139.
11. Pal M, Tardos E (2003) Group strategyproof mechanisms via primal-dual algorithms. Proc. 44th Annual ACM Sympos. Theory Comput. (ACM, New York).
12. Potters JAM, Curiel IJ, Tijs SH (1992) Traveling salesman games. Math. Programming 53(1):199-211.
13. Shapley LS (1953) A value for n-person games. Contributions to the Theory of Games, II. Kuhn HW, Tucker AW, eds. Annals of Mathematics Studies, Vol. 28 (Princeton University Press, Princeton, NJ), 307-317.
14. Song J-H, Savelsbergh M (2007) Performance measurement for inventory routing. Transportation Sci. 41(1):44-54.
15. Tamir A (1989) On the core of a traveling salesman cost allocation game. Oper. Res. Lett. 8(1):31-34.
16. Young HP, ed. (1985) Cost Allocation: Methods, Principles, Applications (North-Holland, Amsterdam)