Optimal commodity distribution for a vehicle with fixed capacity under vendor managed inventory

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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 trade-off, 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. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Xu, X., Cai, X., Liu, C., & To, C. (2007). Optimal commodity distribution for a vehicle with fixed capacity under vendor managed inventory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4614 LNCS, pp. 329–339). Springer Verlag. https://doi.org/10.1007/978-3-540-74450-4_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free