Table of Contents
Fetching ...

Optimal Replenishment Policies for Industrial Vending Machines

Karina M. Sindermann, Esma S. Gel, Nesim K. Erkip

TL;DR

The paper addresses replenishment decisions for Industrial Vending Machines (IVMs) under real-time inventory visibility by formulating two policy classes: a state-dependent trigger set policy and a fixed-cycle replenishment policy. It proves a monotonicity property for the trigger set policy, enabling an efficient approximate online framework that scales to hundreds of items, and derives a closed-form optimal cycle length for fixed-cycle replenishment. The authors develop an online policy via an entrance-fee transformation and propose two practical approximations, $\alpha_G$ and $\alpha_{\hat{g}}$, achieving near-optimal performance with substantial computational savings. Using real transaction data, they show fixed-cycle replenishment can cut costs by 61.7–78.6% relative to current practice, while the online framework adds a further 4.1–22.9% improvement, highlighting substantial practical impact for vendor-managed inventory in industrial settings.

Abstract

Industrial Vending Machines (IVMs) automate the dispensing of a variety of supplies like safety equipment and tools at customer sites, providing 24/7 access while tracking inventory in real-time. Industrial distribution companies typically manage the replenishment of IVMs using periodic schedules, which do not take advantage of these advanced real-time monitoring capabilities. We develop two approaches to optimize the long-term average cost of replenishments and stockouts per unit time: a state-dependent optimal control policy that jointly considers all inventory levels (referred to as trigger set policy) and a fixed cycle policy that optimizes replenishment frequency. We prove the monotonicity of the optimal trigger set policy and leverage it to design a computationally efficient approximate online control framework. Unlike existing methods, which typically handle a very limited number of items due to computational constraints, our approach scales to hundreds of items while achieving near-optimal performance. Leveraging transaction data from our industrial partner, we conduct an extensive set of numerical experiments to demonstrate this claim. Our results show that optimal fixed cycle replenishment reduces costs by 61.7 to 78.6% compared to current practice, with our online control framework delivering an additional 4.1 to 22.9% improvement. Our novel theoretical results provide practical tools for effective replenishment management in this modern vendor-managed inventory context.

Optimal Replenishment Policies for Industrial Vending Machines

TL;DR

The paper addresses replenishment decisions for Industrial Vending Machines (IVMs) under real-time inventory visibility by formulating two policy classes: a state-dependent trigger set policy and a fixed-cycle replenishment policy. It proves a monotonicity property for the trigger set policy, enabling an efficient approximate online framework that scales to hundreds of items, and derives a closed-form optimal cycle length for fixed-cycle replenishment. The authors develop an online policy via an entrance-fee transformation and propose two practical approximations, and , achieving near-optimal performance with substantial computational savings. Using real transaction data, they show fixed-cycle replenishment can cut costs by 61.7–78.6% relative to current practice, while the online framework adds a further 4.1–22.9% improvement, highlighting substantial practical impact for vendor-managed inventory in industrial settings.

Abstract

Industrial Vending Machines (IVMs) automate the dispensing of a variety of supplies like safety equipment and tools at customer sites, providing 24/7 access while tracking inventory in real-time. Industrial distribution companies typically manage the replenishment of IVMs using periodic schedules, which do not take advantage of these advanced real-time monitoring capabilities. We develop two approaches to optimize the long-term average cost of replenishments and stockouts per unit time: a state-dependent optimal control policy that jointly considers all inventory levels (referred to as trigger set policy) and a fixed cycle policy that optimizes replenishment frequency. We prove the monotonicity of the optimal trigger set policy and leverage it to design a computationally efficient approximate online control framework. Unlike existing methods, which typically handle a very limited number of items due to computational constraints, our approach scales to hundreds of items while achieving near-optimal performance. Leveraging transaction data from our industrial partner, we conduct an extensive set of numerical experiments to demonstrate this claim. Our results show that optimal fixed cycle replenishment reduces costs by 61.7 to 78.6% compared to current practice, with our online control framework delivering an additional 4.1 to 22.9% improvement. Our novel theoretical results provide practical tools for effective replenishment management in this modern vendor-managed inventory context.

Paper Structure

This paper contains 28 sections, 36 theorems, 77 equations, 4 figures, 6 tables, 1 algorithm.

Key Result

Proposition 1

The following properties hold for an optimal policy: (i) each time the customer site is visited, all items are restocked to their respective order-up-to levels (i.e., $Q_j$ for item $j$), (ii) there is at most one outstanding replenishment order at any time.

Figures (4)

  • Figure 1: Types of Industrial Vending Machines
  • Figure 2: Comparison of the optimal policy and best threshold policy
  • Figure 3: Cost comparison of policies with different fixed costs ($A$) for industrial case study
  • Figure : Incremental Construction of Continue Set

Theorems & Definitions (60)

  • Proposition 1
  • proof
  • Lemma 1
  • Lemma 2
  • Lemma 3
  • Definition 1
  • Theorem 1
  • Corollary 1
  • Theorem 2
  • Lemma 4
  • ...and 50 more