IDEAS home Printed from https://ideas.repec.org/a/eme/mscrap/mscra-06-2026-0107.html

Koopman-enhanced offline reinforcement learning for robust multi-echelon inventory control under demand distribution shift

Author

Listed:
  • Bailing Zhang

Abstract

PurposeMulti-echelon inventory optimization (MEIO) under demand distribution shift remains an open challenge in supply chain management. Classical rule-based policies are effective when calibrated online but cannot exploit historical data structure. This paper investigates whether a Koopman operator world model, applied as a structured latent dynamics model within an offline reinforcement learning (RL) framework, can improve the out-of-distribution (OOD) robustness of learned inventory policies and reduce temporal difference (TD)-target variance during training.Design/methodology/approachWe propose Koopman-enhanced Multi-Echelon Inventory Optimization (K-MEIO), a two-stage framework combining a Deep Koopman World Model (DKWM) with Implicit Q-Learning (IQL). The DKWM learns a finite-dimensional linear embedding of the multi-echelon inventory dynamics, enabling analytically tractable TD targets with 12.4% lower variance than direct next-state encoding. The Koopman-enhanced Implicit Q-Learning policy is trained entirely on simulated offline transitions calibrated from University of California, Irvine Online Retail and Rossmann Store Sales demand statistics. Ablation experiments across five expectile values, three training seeds, and three OOD stress scenarios are reported, together with full cost breakdowns.FindingsUnder standard evaluation, K-MEIO achieves service level 0.995 with zero capacity violations. Across three training seeds, K-MEIO achieves OOD robustness ratio 0.861 ± 0.039 under a 3× promotional demand spike and 0.882 ± 0.058 under a permanent demand mean shift, compared to 0.762 ± 0.153 and 0.842 ± 0.093 for vanilla IQL. K-MEIO shows consistently lower seed-to-seed variance, suggesting more stable training dynamics. A historically calibrated base-stock policy (Hist-BSP) outperforms all offline methods in both standard and stress evaluations. Cost breakdown confirms that K-MEIO's degradation under stress is driven entirely by stockout cost, not excess inventory.Research limitations/implicationsThe offline dataset consists of simulated transitions calibrated using real retail demand statistics, not actual historical inventory records. The Koopman spectral radius constraint is a regularization device and does not constitute a formal stability guarantee for the true inventory system. The 12.4% variance reduction produces modest but consistent OOD robustness gains across seeds.Practical implicationsIn supply chain contexts where promotional demand spikes or demand mean shifts are common and online policy recalibration is impractical, K-MEIO offers more stable policy behavior than vanilla IQL (seed std. ±0.039 vs. ± 0.153 in S1). A historically calibrated BSP remains a competitive offline benchmark and should be the primary comparison point.Originality/valueThis paper provides the first systematic evaluation of Koopman-structured TD targets for offline inventory RL under demand distribution shift, with direct measurement of TD-target variance reduction, a multi-seed robustness analysis, and a fair historically calibrated BSP baseline. The corrected mechanistic explanation clarifies that the Koopman advantage operates at training time through variance reduction, not at evaluation time through OOD encoding.

Suggested Citation

  • Bailing Zhang, 2026. "Koopman-enhanced offline reinforcement learning for robust multi-echelon inventory control under demand distribution shift," Modern Supply Chain Research and Applications, Emerald Group Publishing Limited, pages 1-12, October.
  • Handle: RePEc:eme:mscrap:mscra-06-2026-0107
    DOI: 10.1108/MSCRA-06-2026-0107
    as

    Download full text from publisher

    File URL: https://www.emerald.com/mscra/article/doi/10.1108/MSCRA-06-2026-0107/1404008/Koopman-enhanced-offline-reinforcement-learning
    Download Restriction: no

    File URL: https://www.emerald.com/mscra/article-pdf/doi/10.1108/MSCRA-06-2026-0107/11925597/mscra-06-2026-0107en.pdf
    Download Restriction: no

    File URL: https://libkey.io/10.1108/MSCRA-06-2026-0107?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eme:mscrap:mscra-06-2026-0107. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Emerald Support (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.