Allocating Cost of Service to Customers in Inventory Routing

被引:50
作者
Ozener, Okan Orsan [1 ]
Ergun, Ozlem [2 ]
Savelsbergh, Martin [3 ]
机构
[1] Ozyegin Univ, Dept Ind Engn, TR-34794 Istanbul, Turkey
[2] Georgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA 30332 USA
[3] Univ Newcastle, Sch Math & Phys Sci, Callaghan, NSW 2308, Australia
基金
美国国家科学基金会;
关键词
Cost allocation; Cost-to-serve; Inventory routing problem; Vendor-managed inventory;
D O I
10.1287/opre.1120.1130
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Vendor-managed inventory (VMI) replenishment is a collaboration between a supplier and its customers, where the supplier is responsible for managing the customers' inventory levels. In the VMI setting we consider, the supplier exploits synergies between customers, e. g., their locations, usage rates, and storage capacities, to reduce distribution costs. Due to the intricate interactions between customers, calculating a fair cost-to-serve for each customer is a daunting task. However, cost-to-serve information is useful when marketing to new customers or when revisiting routing and delivery quantity decisions. We design mechanisms for this cost allocation problem and determine their characteristics both analytically and computationally.
引用
收藏
页码:112 / 125
页数:14
相关论文
共 16 条
  • [1] Bertazzi L, 2008, OPER RES COMPUT SCI, V43, P49, DOI 10.1007/978-0-387-77778-8_3
  • [2] Borm P., 2001, Top, V9, P139, DOI [10.1007/BF02579075, DOI 10.1007/BF02579075]
  • [3] Campbell A, 1998, FLEET MANAGEMENT AND LOGISTICS, P95
  • [4] Cordeau J.F., 2007, HDB OPERATIONS RES M
  • [5] The traveling salesman game: An application of cost allocation in a gas and oil company
    Engevall, S
    Gothe-Lundgren, M
    Varbrand, P
    [J]. ANNALS OF OPERATIONS RESEARCH, 1998, 82 (0) : 453 - 471
  • [6] The heterogeneous vehicle-routing game
    Engevall, S
    Göthe-Lundgren, M
    Värbrand, P
    [J]. TRANSPORTATION SCIENCE, 2004, 38 (01) : 71 - 85
  • [7] On approximately fair cost allocation in Euclidean TSP games
    Faigle U.
    Fekete S.P.
    Hochstättler W.
    Kern W.
    [J]. Operations-Research-Spektrum, 1998, 20 (1) : 29 - 37
  • [8] Goemans MX, 2004, J ALGORITHM, V50, P194, DOI 10.1016/S0196-6774(03)00098-1
  • [9] On the nucleolus of the basic vehicle routing game
    GotheLundgren, M
    Jornsten, K
    Varbrand, P
    [J]. MATHEMATICAL PROGRAMMING, 1996, 72 (01) : 83 - 100
  • [10] Kuipers J., 1993, ZOR, Methods and Models of Operations Research, V38, P131, DOI 10.1007/BF01414209