mlsanityData to 7 Oct 2026

A Comparative Study of Bayesian Contextual Bandits for Real-Time Warehouse Sorter Optimization

arXiv 2606.23977 ↗First posted 22 Jun 2026cs.LG cs.SY eess.SYcited by 0

Not on the map. Why?

Abstract (arXiv)

Efficient sorter diversion control of automated material handling systems (MHS) is critical for optimizing operational efficiency in large-scale warehouse environments. In this study, we use an inbound receiving sorter at a high-volume e-commerce warehouse as our primary use case, where the sorter diversion system relies on cost functions with static weight configurations that fail to adapt to highly dynamic system contexts, such as volume mode, congestion level, equipment physical status, and upstream/downstream dependencies. To address this real-time sorter diversion optimization challenge, we conducted a comparative study of three candidate hybrid machine learning frameworks: Linear Regression with Gradient Descent Optimization (LR+GDO), XGBoost with Bayesian Optimization (XGB+BO), and Bayesian Contextual Bandits (BCB). Model training and evaluation were enabled by leveraging a high-fidelity physics-aware emulator to overcome the cold-start problem and allow a safe transition from offline to online learning. We performed comprehensive evaluations including reward model predictive accuracy, contextual sensitivity, action distribution, and projected reward uplift. Our results demonstrate that while tree-based reward models offer slightly better predictive power, the BCB framework achieved overall higher performance with 2.03% reward uplift over the heuristic baseline. Furthermore, BCB exhibits several superior characteristics, such as its decisive time-optimal policy backed by Bang-Bang control theory, continuous online learning capability, strategic balance between exploration and exploitation, and significantly shorter inference latency. These results demonstrate the potential of the BCB framework for real-time control optimization in large-scale warehouse environments, motivating further investigation toward operational deployment.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 1 of its 13 references that are in the map. First posted on arXiv 22 Jun 2026.

Builds on

1 of 13 references.

References · 1

  1. 2024Context in Public Health for Underserved Communities: A Bayesian Approach to Online Restless Banditscited by 5

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Learning to Staff: Offline Reinforcement Learning and Fine-Tuned LLMs for Warehouse Staffing Optimization
  2. 2025Learning to Solve the Min-Max Mixed-Shelves Picker-Routing Problem via Hierarchical and Parallel Decoding
  3. 2025HD-CB: The First Exploration of Hyperdimensional Computing for Contextual Bandits Problems
  4. 2023Reward Learning as Doubly Nonparametric Bandits: Optimal Design and Scaling Laws
  5. 2021Adapting to Misspecification in Contextual Bandits with Offline Regression Oracles
  6. 2024DISCO: An End-to-End Bandit Framework for Personalised Discount Allocation
  7. 2023Oracle-Efficient Pessimism: Offline Policy Optimization in Contextual Bandits
  8. 2024Multi-Agent Decision Transformers for Dynamic Dispatching in Material Handling Systems Leveraging Enterprise Big Data