A constraint-programming approach for the storage space allocation problem in a distribution center
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
<p>In the storage location assignment problem under a picker-to-parts system (SLAP-FP), we assign warehouse space to products based on customer orders. The distance we have to travel to pick up customer orders and the frequency of restocking in the warehouse depend on the location of the products and their allocated space. The goal of SLAP-FP is to minimize the costs of restocking the products and picking the orders. This study introduces a novel constraint programming formulation to solve the SLAP-FP. The model uses logical rules and rational expressions to describe the problem concisely. Numerical results with standard solvers show that the proposed model significantly outperforms the previously known integer programming approach. Specifically, the constraint programming model is especially good at finding better solutions in large instances with many different products.</p>
Keywords
constraint programming, order picking, slotting, storage space allocation, warehousing