A constraint-programming approach for the storage space allocation problem in a distribution center

Simple item page
dc.coverageDOI: 10.1111/itor.70003
dc.creatorTelha, Claudio
dc.creatorGonzález-Ramírez, Rosa G.
dc.date2025
dc.date.accessioned46027,76093
dc.date.available46027,76093
dc.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>eng
dc.identifierhttps://investigadores.uandes.cl/en/publications/6f9b03d9-7ff0-42a6-9f20-c441408dec6b
dc.languageeng
dc.rightsinfo:eu-repo/semantics/openAccess
dc.sourcevol.32 (2025) nr.6 p.3474-3496
dc.subjectconstraint programming
dc.subjectorder picking
dc.subjectslotting
dc.subjectstorage space allocation
dc.subjectwarehousing
dc.titleA constraint-programming approach for the storage space allocation problem in a distribution centereng
dc.typeArticleeng
dc.typeArtículospa
Files
Collections
Investigación Facultad de Ingeniería y Ciencias Aplicadas