Journals / Alphanumeric Journal / 2026 / Volume: 13 Issue: 1

A robust optimization approach to address correlation uncertainty in stock keeping unit assignment in warehouses

Bayram Dündar(Bartin Üniversitesi)0000-0002-4053-2605
Pages
—
Publication Date
2025-06-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)

While it yielded optimal results within an efficient time frame for small-scale problems, the solution time increased significantly as the problem size expanded.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this study, we address the problem of assigning correlated Stock Keeping Units (SKUs) to storage locations under uncertain SKUs correlation conditions.
📊
Key Findings & Data:The objective is to allocate SKUs within the forward picking area of a warehouse to minimize the total picking distance.
💡
Conclusion & Impact:While it yielded optimal results within an efficient time frame for small-scale problems, the solution time increased significantly as the problem size expanded.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:SKUs assignment problem · robust optimization · demand correlation

Abstract

In this study, we address the problem of assigning correlated Stock Keeping Units (SKUs) to storage locations under uncertain SKUs correlation conditions. The objective is to allocate SKUs within the forward picking area of a warehouse to minimize the total picking distance. To quantify the correlation between SKUs, we employ the joint distribution concept, enabling a more systematic representation of their correlations. The problem is formulated as a Quadratic Assignment Problem (QAP), which becomes computationally intractable at large scales due to its complexity. To mitigate this challenge, the QAP model is linearized, and a robust counterpart is developed to effectively handle uncertainty. The robust model was evaluated through various small-scale scenarios. While it yielded optimal results within an efficient time frame for small-scale problems, the solution time increased significantly as the problem size expanded.

🔖

Cite This Article

Dündar, B. (2025). A robust optimization approach to address correlation uncertainty in stock keeping unit assignment in warehouses. Alphanumeric Journal, Volume: 13 Issue: 1. https://doi.org/10.17093/alphanumeric.1670030

📄 Full Text PDF Viewer

📄

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

References (19)

  1. Ahuja, R. K., Orlin, J. B., & Tiwari, A. (2000). A greedy genetic algorithm for the quadratic assignment problem.Computers &Operations Research,27(10), 917–934.
  2. Bartholdi, J. J., Hackman, S. T., & others. (2008).Warehouse & Distribution Science: Release 0.89. Supply Chain, Logistics InstituteAtlanta.
  3. Bertsimas, D., & Sim, M. (2003). Robust discrete optimization and network flows.Mathematical Programming,98(1), 49–71.Bertsimas, D., & Sim, M. (2004). The price of robustness.Operations Research,52(1), 35–53.
  4. Costello, C., Oveysi, Z., Dundar, B., & McGarvey, R. (2021). Assessment of the effect of urban agriculture on achieving a localizedfood system centered on Chicago, IL using robust optimization.Environmental Science & Technology,55(4), 2684–2694.
  5. Dundar, B., Costello, C., & McGarvey, R. G. (2017). Robust optimization evaluation of reliance on locally produced foods.Environment Systems and Decisions,37, 34–41.
  6. Dundar, B., McGarvey, R. G., & Aguilar, F. X. (2019). A robust optimisation approach for identifying multi-state collaborations toreduce CO2 emissions.Journal of the Operational Research Society,70(4), 601–619.
  7. Dundar, B., McGarvey, R. G., & Aguilar, F. X. (2022). Optimal multi-state partnerships for woody biomass co-firing incorporatinga demand-response function for biomass procurement.Optimization Letters,16(3), 821–844.
  8. Elshafei, A. N. (1977). Hospital layout as a quadratic assignment problem.Journal of the Operational Research Society,28(1),167–179.
  9. Hsu, C.-M., Chen, K.-Y., & Chen, M.-C. (2005). Batching orders in warehouses by minimizing travel distance with genetic algorithms.Computers in Industry,56(2), 169–178.
  10. Islam, S., & Uddin, K. (2023). Correlated storage assignment approach in warehouses: A systematic literature review.Journal ofIndustrial Engineering and Management,16(2), 294–318.
  11. Kim, B. S., & Smith, J. S. (2012). Slotting methodology using correlated improvement for a zone-based carton picking distributionsystem.Computers & Industrial Engineering,62(1), 286–295.
  12. Ma, Z., Wu, G., Ji, B., Wang, L., Luo, Q., & Chen, X. (2022). A novel scattered storage policy considering commodity classification andcorrelation in robotic mobile fulfillment systems.IEEE Transactions on Automation Science and Engineering,20(2), 1020–1033.
  13. Mantel, R. J., Schuur, P. C., & Heragu, S. S. (2007). Order oriented slotting: a new assignment strategy for warehouses.EuropeanJournal of Industrial Engineering,1(3), 301–316.
  14. Olvera Astivia, O. L., Kroc, E., & Zumbo, B. D. (2020). The role of item distributions on reliability estimation: The case of Cronbach’scoefficient alpha.Educational and Psychological Measurement,80(5), 825–846.
  15. Poulos, P., Rigatos, G., Tzafestas, S., & Koukos, A. (2001). A Pareto-optimal genetic algorithm for warehouse multi-objectiveoptimization.Engineering Applications of Artificial Intelligence,14(6), 737–749.
  16. Soyster, A. L. (1973). Convex programming with set-inclusive constraints and applications to inexact linear programming.Operations Research,21(5), 1154–1157.
  17. Tompkins, J. A., White, J. A., Bozer, Y. A., & Tanchoco, J. M. A. (2010).Facilities planning. John Wiley & Sons.
  18. Xiao, J., & Zheng, L. (2012). Correlated storage assignment to minimize zone visits for BOM picking.The International Journal of Advanced Manufacturing Technology,61, 797–807.
  19. Zhou, X. M., Li, Y. D., & Yao, Y. P. (2014). Slotting Optimization Model and Algorithm for Concerning the Correlation in Hybrid Travel Policy. Applied Mechanics and Materials, 694, 90–94.