SCIENCE@home

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

Claudio Telha,R. G. González‐Ramírez

Published 2025 in International Transactions in Operational Research

ABSTRACT

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.

PUBLICATION RECORD

  • Publication year

    2025

  • Venue

    International Transactions in Operational Research

  • Publication date

    2025-02-24

  • Fields of study

    Business, Engineering, Computer Science

  • Identifiers
    DOI 10.1111/itor.70003
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-42 of 42 references · Page 1 of 1

CITED BY