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

  • Authors:

  • Xiaolin Xu;Xiaoqiang Cai;Chunlin Liu;Chikit To

  • Affiliations:

  • School of Business, Nanjing University, Nanjing, China and Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, HK;Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, N.T., HK;Chikit,,To;Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, N.T., HK

  • Venue:
  • ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

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.