Adaptive warehouse storage location assignment with considerations to order-picking efficiency and worker safety

10Citations
Citations of this article
84Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Smart warehouses require software-based decision-making tools to manage the receiving, storing, and picking of products. A major challenge in achieving efficient operations is deciding where to store products associated with incoming orders. The storage location assignment problem (SLAP) is more complex in large-size warehouses due to several functional objectives and numerous possible shelving solutions. This paper introduces an artificial intelligence algorithm that seeks to find an acceptable solution to SLAP with presented linear and nonlinear objective functions. The near-optimal technique exploits basin-hopping and simulated-annealing algorithms to find a solution when considering four functional objectives including worker safety, which has not been optimized using similar approaches. The algorithm is experimentally evaluated, and results demonstrate that reasonablely achieved solutions are comparable to those obtained by well-known existing solvers. Furthermore, the problem could be solved with non-linear objectives which is beyond the commercial solvers’ like SCIP capability.

Cite

CITATION STYLE

APA

Zarinchang, A., Lee, K., Avazpour, I., Yang, J., Zhang, D., & Knopf, G. K. (2024). Adaptive warehouse storage location assignment with considerations to order-picking efficiency and worker safety. Journal of Industrial and Production Engineering, 41(1), 40–59. https://doi.org/10.1080/21681015.2023.2263009

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free