A Computational Method for Solving the Stochastic Joint Replenishment Problem in High Dimensions

2025-11-14 · Barış Ata, Wouter van Eekelen, Yuan Zhong arxiv

We consider a discrete-time formulation for a class of high-dimensional stochastic joint replenishment problems. First, we approximate the problem by a continuous-time impulse control problem. Exploiting connections among the impulse control problem, backward stochastic differential equations (BSDEs) with jumps, and the stochastic target problem, we develop a novel, simulation-based computational method that relies on deep neural networks to solve the impulse control problem. Based on that solution, we propose an implementable inventory control policy for the original (discrete-time) stochastic joint replenishment problem, and test it against the best available benchmarks in a series of test problems. For the problems studied thus far, our method matches or beats the best benchmark we could find, and it is computationally feasible up to at least 50 dimensions -- that is, 50 stock-keeping units (SKUs).

📄 PDF Abstract BibTeX arXiv:2511.11830

Code (0)

등록된 구현이 없습니다.

OR-Transformer: Scaling Real-Time Decision-Making to 1,000 Items

2026-09-01 · Shuze Daniel Liu, David Simchi-Levi, Claire Chen, Chutong Gao 외 arxiv

Modern supply chain operations can require coordinating replenishment across thousands of heterogeneous items under correlated stochastic demand, heterogeneous lead times, and shared fixed ordering costs, yielding observ…

Reinforcement Learning

A Monotone Approximate Dynamic Programming Approach for the Stochastic Scheduling, Allocation, and Inventory Replenishment Problem: Applications to Drone and Electric Vehicle Battery Swap Stations

2021-05-14 · Amin Asadi, Sarah Nurre Pinkley

There is a growing interest in using electric vehicles (EVs) and drones for many applications. However, battery-oriented issues, including range anxiety and battery degradation, impede adoption. Battery swap stations are…

regression Scheduling

Learning to Search for Vehicle Routing with Multiple Time Windows

2025-05-29 · Kuan Xu, Zhiguang Cao, Chenlong Zheng, Linong Liu

In this study, we propose a reinforcement learning-based adaptive variable neighborhood search (RL-AVNS) method designed for effectively solving the Vehicle Routing Problem with Multiple Time Windows (VRPMTW). Unlike tra…

Computational Efficiency reinforcement-learning Reinforcement Learning

Dual-Agent Deep Reinforcement Learning for Dynamic Pricing and Replenishment

2024-10-28 · Yi Zheng, Zehao Li, Peng Jiang, Yijie Peng

We study the dynamic pricing and replenishment problems under inconsistent decision frequencies. Different from the traditional demand assumption, the discreteness of demand and the parameter within the Poisson distribut…

Deep Reinforcement Learning reinforcement-learning Reinforcement Learning

Online Linear Programming with Replenishment

2026-01-21 · Yuze Chen, Yuan Zhou, Baichuan Mo, Jie Ying 외 arxiv

We study an online linear programming (OLP) model in which inventory is not provided upfront but instead arrives gradually through an exogenous stochastic replenishment process. This replenishment-based formulation captu…