Abstract
Under vendor managed inventory (VMI), vendors have the obligation to maintain the retail stores they serve with sufficient inventory levels. In this paper, specifically, we consider an oil tanker which visits and replenishes multiple retail stations daily. However, due to the fixed capacity of vehicle, at each station the vendor faces such a tradeoff, replenishing the current station to a higher level or reserving more capacity for the left stations that may take more profits in future. We address this problem by two mathematical models, corresponding to situations with deterministic and stochastic station demand respectively. A greedy algorithm is developed and proved optimal for the case with deterministic demand. For the case with stochastic demand, we find the optimal replenishment policy by dynamic programming, which selects the median among three critical numbers. Numerical examples are also presented, which shed light on managerial insights partially.
Research supported by Natural Science Foundation of China (70671054) and the Research Grant Council of Hong Kong under Project no. CUHK442/05.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anton, J.K., Nori, V.S., Martin, S.: The Stochastic Inventory Routing Problem with Direct Deliveries. Transportation Science 36(1), 94–118 (2002)
Barnes, S.D., Bassok, Y.: Direct Shipping and the Dynamic Single-depot/Multi-retailer Inventory System. Elsevier Science 101(3), 509–518 (1997)
Bassok, Y.: Dynamic Allocations for Multi-Product Distribution. Transportation Science 29(3), 256–266 (1995)
Bell, W.J., Dalberto, L.M., Fisher, M.L., Greenfield, A.J., Jaikumar, J., Kedia, P., Mack, R.G., Prutzman, P.J.: Improving the distribution of industrial gases with on-line computerized routing and scheduling optimizer. Interfaces 13(1), 4–23 (1983)
Beltrami, E., Bodin, L.: Networks and Vehicle Routing for Municipal Waste Collection. Networks 4, 65–94 (1974)
Champell, A., Clarke, L., Anton, K., Martin, S.: The Vehicle Routing Problem, ch. 12 (2002)
Christiansen, M., Nygreen, B.: A Method for Solving Ship Routing Problems with Inventory Constraints. Ann. Oper. Res. 81, 357–378 (1998a)
Christiansen, M.: Modelling Path Flows for a Combined Ship Routing and Inventory Management Problem. Ann. Oper. Res. 82, 391–412 (1998b)
Christiansen, M.: Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem. Transportation Science 33(1), 3–16 (1999)
Berman, O., Larson, R.C.: Deliveries in Inventory/Routing Problem Using Stochastic Dynamic Programming. Transportation Science 35(2), 192–213 (2001)
Singer, M., Donoso, P., Jara, S.: Fleet Configuration Subject to stochastic demand: An Application in The Distribution of Liquefied Petroleum Gas. Journal of The Operational Research Society 53, 961–971 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, X., Cai, X., Liu, C., To, C. (2007). Optimal Commodity Distribution for a Vehicle with Fixed Capacity Under Vendor Managed Inventory. In: Chen, B., Paterson, M., Zhang, G. (eds) Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. ESCAPE 2007. Lecture Notes in Computer Science, vol 4614. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74450-4_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-74450-4_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74449-8
Online ISBN: 978-3-540-74450-4
eBook Packages: Computer ScienceComputer Science (R0)