Optimizing Storage Location Assignment (SLA) is essential for improving warehouse operations, reducing operational costs, travel distances and picking times. The effectiveness of the optimization process should be evaluated. This study introduces a novel, generalized objective function tailored to optimize SLA through integration with a Genetic Algorithm. The method incorporates key parameters such as item order frequency, storage grouping, and proximity of items frequently ordered together. Using simulation tools, this research models a picker-to-part system in a warehouse environment characterized by complex storage constraints, varying item demands and family-grouping criteria. The study explores four scenarios with distinct parameter weightings to analyze their impact on SLA. Contrary to other research that focuses on frequency-based assignment, this article presents a novel framework for designing SLA using key parameters. The study proves that it is advantageous to deviate from a frequency-based assignment, as considering other key parameters to determine the layout can lead to more favorable operations. The findings reveal that adjusting the parameter weightings enables effective SLA customization based on warehouse operational characteristics. Scenario-based analyses demonstrated significant reductions in travel distances during order picking tasks, particularly in scenarios prioritizing ordered-together proximity and group storage. Visual layouts and picking route evaluations highlighted the benefits of balancing frequency-based arrangements with grouping strategies. The study validates the utility of a tailored generalized objective function for SLA optimization. Scenario-based evaluations underscore the importance of fine-tuning SLA strategies to align with specific operational demands, paving the way for more efficient order picking and overall warehouse management.

Ardjmand, E., Sanei Bajgiran, O., & Youssef, E. (2019). Using list-based simulated annealing and genetic algorithm for order batching and picker routing in put wall based picking systems. Applied Soft Computing, 75, 106–119. https://doi.org/10.1016/j.asoc.2018.11.019

de Koster, R., Le-Duc, T., & Roodbergen, K. J. (2007). Design and control of warehouse order picking: A literature review. European Journal of Operational Research, 182(2), 481–501. https://doi.org/10.1016/j.ejor.2006.07.009

Dijkstra, A. S., & Roodbergen, K. J. (2017). Exact route-length formulas and a storage location assignment heuristic for picker-to-parts warehouses. Transportation Research Part E: Logistics and Transportation Review, 102, 38–59. https://doi.org/10.1016/j.tre.2017.04.003

Görbe, P., Bódis, T. (2023). Generalized objective function to ensure robust evaluation for evolutionary storage location assignment algorithms. Communications in Computer and Information Science, 1864, 546–559. https://doi.org/10.1007/978-3-031-41774-0_43

He, Y., Wang, A., Su, H., et al. (2019). Particle Swarm Optimization Using Neighborhood‐Based Mutation Operator and Intermediate Disturbance Strategy for Outbound Container Storage Location Assignment Problem. Mathematical Problems in Engineering, 2019(1). Portico. https://doi.org/10.1155/2019/9132315

Kübler, P., Glock, C. H., & Bauernhansl, T. (2020). A new iterative method for solving the joint dynamic storage location assignment, order batching and picker routing problem in manual picker-to-parts warehouses. Computers & Industrial Engineering, 147, 106645. https://doi.org/10.1016/j.cie.2020.106645

Le-Duc *, T., & De Koster, R. (M. )B. M. (2005). Travel distance estimation and storage zone optimization in a 2-block class-based storage strategy warehouse. International Journal of Production Research, 43(17), 3561–3581. https://doi.org/10.1080/00207540500142894

Li, J., Moghaddam, M., & Nof, S. Y. (2016). Dynamic storage assignment with product affinity and ABC classification—a case study. The International Journal of Advanced Manufacturing Technology, 84(9–12), 2179–2194. https://doi.org/10.1007/s00170-015-7806-7

Li, Y., Méndez-Mediavilla, F. A., Temponi, C., et al. (2021). A Heuristic Storage Location Assignment Based on Frequent Itemset Classes to Improve Order Picking Operations. Applied Sciences, 11(4), 1839. https://doi.org/10.3390/app11041839

Liu, M., & Poh, K. L. (2023). E-commerce warehousing: An efficient scattered storage assignment algorithm with bulky locations. Computers & Industrial Engineering, 181, 109236. https://doi.org/10.1016/j.cie.2023.109236

Pawar, N. S., Rao, S. S., & Adil, G. K. (2024). Scattered storage for retail e-commerce fulfillment warehouses with consideration for product turnover. Computers & Industrial Engineering, 197, 110551. https://doi.org/10.1016/j.cie.2024.110551

Peng, G., Wu, Y., Zhang, C., et al. (2021). Integrated optimization of storage location assignment and crane scheduling in an unmanned slab yard. Computers & Industrial Engineering, 161, 107623. https://doi.org/10.1016/j.cie.2021.107623

Quintanilla, S., Pérez, Á., Ballestín, F., et al. (2015). Heuristic algorithms for a storage location assignment problem in a chaotic warehouse. Engineering Optimization, 47(10), 1405–1422. https://doi.org/10.1080/0305215x.2014.969727

Saleet, H. (2020). Smart Solution For Enhancing Storage Location Assignments In WMS Using Genetic Algorithm. International Journal of Engineering Research and Technology, 13(11), 3456. https://doi.org/10.37624/ijert/13.11.2020.3456-3463

Silva, A., Coelho, L. C., Darvish, M., et al. (2020). Integrating storage location and order picking problems in warehouse planning. Transportation Research Part E: Logistics and Transportation Review, 140, 102003. https://doi.org/10.1016/j.tre.2020.102003

Udvardy, K., Görbe, P., Bódis, T., et al. (2024). Conceptual Framework for Adaptive Bacterial Memetic Algorithm Parameterization in Storage Location Assignment Problem. Mathematics, 12(23), 3688. https://doi.org/10.3390/math12233688

van Gils, T., Caris, A., Ramaekers, K., et al. (2019). Designing efficient order picking systems: The effect of real-life features on the relationship among planning problems. Transportation Research Part E: Logistics and Transportation Review, 125, 47–73. https://doi.org/10.1016/j.tre.2019.02.010

van Gils, T., Ramaekers, K., Caris, A., et al. (2018). Designing efficient order picking systems by combining planning problems: State-of-the-art classification and review. European Journal of Operational Research, 267(1), 1–15. https://doi.org/10.1016/j.ejor.2017.09.002

Wang, M., Zhang, R. Q., & Fan, K. (2020). Improving order-picking operation through efficient storage location assignment: A new approach. Computers & Industrial Engineering, 139, 106186. https://doi.org/10.1016/j.cie.2019.106186