A Real-Time Scalable Heuristic DSS Framework for Capacity-Constrained Retail Allocation under Supply Chain Uncertainty
Abd\"ussamet S\"okel

TL;DR
This paper introduces a real-time, scalable heuristic decision support system for retail inventory allocation under supply chain uncertainty, improving efficiency and coverage in large-scale retail operations.
Contribution
It develops a novel heuristic framework embedded in a DSS that addresses complex, large-scale retail allocation problems under uncertainty, outperforming traditional optimization methods.
Findings
Weighted ship-to-order ratio increased from 54.1% to 67.8%.
Weighted same-day coverage improved from 24.3% to 37.8%.
Store-days with order volumes above limits reduced by 48.6%.
Abstract
The rapid proliferation of omnichannel retail strategies has fundamentally transformed store replenishment operations in uncertain supply chain environments. With retail stores increasingly acting as hybrid fulfillment centers, pooled inventory allocation must absorb uncertain order realizations, constrained receiving capacities, dynamic vehicle limits, multi-tiered product priorities, and planner-controlled outbound warehouse preferences. This study frames this commercial reality as an extended constrained variant of the Multidimensional Knapsack Problem (MKP). Recognizing that exact optimization techniques such as Mixed-Integer Linear Programming (MILP) are computationally prohibitive in large-scale real-time settings, we propose a real-time scalable heuristic embedded in a computationally efficient Decision Support System (DSS) framework based on set-oriented cumulative filtering.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
