Exact route-length formulas and a storage location assignment heuristic for picker-to-parts warehouses

摘要

Order picking is one of the most time-critical processes in warehouses. We focus on the combined effects of routing methods and storage location assignment on process performance. We present exact formulas for the average route length under any storage location assignment for four common routing methods. Properties of optimal solutions are derived that strongly reduce the solution space. Furthermore, we provide a dynamic programming approach that determines storage location assignments, using the route length formulas and optimality properties. Experiments underline the importance of the introduced proeduces by revealing storage assignment patterns that have not been described in literature before. (C) 2017 Elsevier Ltd. All rights reserved.