Abstract

Efficiency in supply chains is critically affected by the performance of operations within warehouses. For this reason, the activities related to the disposition and management of inventories are crucial. This work addresses the multi-level storage locations assignment problem for SKU pallets, considering divisible locations in the first level to improve the picking operation and reduce the travel times associated with the routes of the cranes. A mathematical programming model is developed considering the objective of minimizing the total travel distance, and in the background, maximizing the use of storage capacity. To solve this complex problem, we consider its decomposition into four subproblems, which are solved sequentially. To evaluate the performance of the model, two analysis scenarios based on different storage strategies are proposed to evaluate both the entry and exit distance of pallets, as well as the cost associated with the movements.