Journals / Bitlis Eren Üniversitesi Fen Bilimleri Dergisi / 2026 / Volume: 14 Issue: 3

Correlated SKU assignment in warehouses using the joint demand probability distribution: a metaheuristic algorithm approach

Bayram Dündar(Bartin Üniversitesi)0000-0002-4053-2605
Pages
—
Publication Date
2025-09-30
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The GA approach under different scenarios shows an improvement of up to 22%.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In warehouse management, picking orders from storage locations quickly and in the shortest time has become even more important with the development of e-commerce.
📊
Key Findings & Data:These correlation values are then integrated into the objective function to optimize storage location decisions.
💡
Conclusion & Impact:The GA approach under different scenarios shows an improvement of up to 22%.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:SKUs assignment problem · demand correlation · genetic algorithm

Abstract

In warehouse management, picking orders from storage locations quickly and in the shortest time has become even more important with the development of e-commerce. Thus, efficiently assigning affined products to storage locations within the warehouses is crucial in reducing operational costs and preserving product quality. In this study, a Mixed-Integer Linear Programming model (MILP) is developed to minimize in-warehouse picking distances. Based on demand data, inter-product relationships are analyzed, and correlation coefficients are estimated for product pairs with a high tendency to be ordered together. These correlation values are then integrated into the objective function to optimize storage location decisions. To obtain faster and near-optimal solutions from the MILP model on large-scale data sets, a genetic algorithm (GA)-based approach has been developed. A set of computational experiments conducted on medium and large-scale instances compares the performance of the proposed GA approach with the Random-Based Correlated Skus Assignment Model (RBC-SAM). The GA approach under different scenarios shows an improvement of up to 22%.

🔖

Cite This Article

Dündar, B. (2025). Correlated SKU assignment in warehouses using the joint demand probability distribution: a metaheuristic algorithm approach. Bitlis Eren Üniversitesi Fen Bilimleri Dergisi, Volume: 14 Issue: 3. https://doi.org/10.17798/bitlisfen.1714876

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (15)

  1. M. Ansari and J. S. Smith, "Gravity clustering: A correlated storage location assignment problem approach," in *Proc. 2020 Winter Simulation Conf. (WSC)*, 2020, pp. 1288–1299.
  2. J. J. Bartholdi and S. T. Hackman, *Warehouse & Distribution Science: Release 0.96*. Atlanta, GA:The Supply Chain and Logistics Institute, 2014. [Online]. Available: https://www.warehouse-science.com
  3. E. Bottani, M. Cecconi, G. Vignali, and R. Montanari, "Optimisation of storage allocation in order picking operations through a genetic algorithm," *Int. J. Logist. Res. Appl.*, vol. 15, no. 2, pp. 127–146, 2012.
  4. M. Gabellini, F. Calabrese, A. Regattieri, D. Loske, and M. Klumpp, "A hybrid approach integrating genetic algorithm and machine learning to solve the order picking batch assignment problem considering learning and fatigue of pickers," *Comput. Ind. Eng.*, vol. 191, p. 110175, 2024
  5. S. Islam and K. Uddin, "Correlated storage assignment approach in warehouses: A systematic literature review," *J. Ind. Eng. Manag.*, vol. 16, no. 2, pp. 294–318, 2023.
  6. B. S. Kim and J. S. Smith, "Slotting methodology using correlated improvement for a zone-based carton picking distribution system," *Comput. Ind. Eng.*, vol. 62, no. 1, pp. 286–295, 2012.
  7. J. Kim, F. Méndez, and J. Jimenez, "Storage location assignment heuristics based on slot selection and frequent itemset grouping for large distribution centers," *IEEE Access*, vol. 8, pp. 189025–189035, 2020.
  8. I. G. Lee, S. H. Chung, and S. W. Yoon, "Two-stage storage assignment to minimize travel time and congestion for warehouse order picking operations," *Comput. Ind. Eng.*, vol. 139, p. 106129, 2020.
  9. J. Li, M. Moghaddam, and S. Y. Nof, "Dynamic storage assignment with product affinity and ABC classification—a case study," *Int. J. Adv. Manuf. Technol.*, vol. 84, pp. 2179–2194, 2016.
  10. M. Mirzaei, N. Zaerpour, and R. B. de Koster, "How to benefit from order data: Correlated dispersed storage assignment in robotic warehouses," *Int. J. Prod. Res.*, vol. 60, no. 2, pp. 549–568, 2022.
  11. M. Squires, X. Tao, S. Elangovan, R. Gururajan, X. Zhou, and U. R. Acharya, "A novel genetic algorithm based system for the scheduling of medical treatments," *Expert Syst. Appl.*, vol. 195, p. 116464, 2022.
  12. W. Wisittipanich and C. Kasemset, "Metaheuristics for warehouse storage location assignment problems," *Chiang Mai Univ. J. Nat. Sci.*, vol. 14, no. 4, pp. 361–377, 2015.
  13. J. Xiao and L. Zheng, "Correlated storage assignment to minimize zone visits for BOM picking," Int. J. Adv. Manuf. Technol.*, vol. 61, pp. 797–807, 2012.
  14. R.-Q. Zhang, M. Wang, and X. Pan, "New model of the storage location assignment problem considering demand correlation pattern," *Comput. Ind. Eng.*, vol. 129, pp. 210–219, 2019.
  15. Dündar, B. (2025). A robust optimization approach to address correlation uncertainty in stock keeping unit assignment in warehouses. Alphanumeric Journal, 13(1), 1-12.