2025/01/24 by Pascal Linden, Linden, Pascal, Nathalie Paul +5
Decision Sciences · #FOS: Computer and information sciences #Machine Learning (cs.LG) #Stock Market Forecasting Methods
paper · pdf · doi:10.48550/arxiv.2501.14394
openalex publication_date 2025/01/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In retail warehouses, returned products are typically placed in an intermediate storage until a decision regarding further shipment to stores is made. The longer products are held in storage, the higher the inefficiency and costs of the returns management process, since enough storage area has to be provided and maintained while the products are not placed for sale. To reduce the average product storage time, we consider an alternative solution where reallocation decisions for products can be made instantly upon their arrival in the warehouse allowing only a limited number of products to still be stored simultaneously. We transfer the problem to an online multiple knapsack problem and propose a novel reinforcement learning approach to pack the items (products) into the knapsacks (stores) such that the overall value (expected revenue) is maximized. Empirical evaluations on simulated data demonstrate that, compared to the usual offline decision procedure, our approach comes with a performance gap of only 3% while significantly reducing the average storage time of a product by 96%.