View in EDS HTML Full Text PDF Full Text

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

Saved in:
Bibliographic Details
Title: A constraint‐programming approach for the storage space allocation problem in a distribution center.
Authors: Telha, Claudio1 (AUTHOR) catelha@miuandes.cl, González‐Ramírez, Rosa G.1 (AUTHOR) rgonzalez@uandes.cl
Source: International Transactions in Operational Research. Nov2025, Vol. 32 Issue 6, p3474-3496. 23p.
Subjects: Constraint programming, Assignment problems (Programming), Integer programming, Consumers, Product costing, Warehouses
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. [ABSTRACT FROM AUTHOR]
Copyright of International Transactions in Operational Research is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 185816921
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A constraint‐programming approach for the storage space allocation problem in a distribution center.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Telha%2C+Claudio%22">Telha, Claudio</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> catelha@miuandes.cl</i><br /><searchLink fieldCode="AR" term="%22González‐Ramírez%2C+Rosa+G%2E%22">González‐Ramírez, Rosa G.</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> rgonzalez@uandes.cl</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Transactions+in+Operational+Research%22">International Transactions in Operational Research</searchLink>. Nov2025, Vol. 32 Issue 6, p3474-3496. 23p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Constraint+programming%22">Constraint programming</searchLink><br /><searchLink fieldCode="DE" term="%22Assignment+problems+%28Programming%29%22">Assignment problems (Programming)</searchLink><br /><searchLink fieldCode="DE" term="%22Integer+programming%22">Integer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Consumers%22">Consumers</searchLink><br /><searchLink fieldCode="DE" term="%22Product+costing%22">Product costing</searchLink><br /><searchLink fieldCode="DE" term="%22Warehouses%22">Warehouses</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of International Transactions in Operational Research is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=185816921
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1111/itor.70003
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 23
        StartPage: 3474
    Subjects:
      – SubjectFull: Constraint programming
        Type: general
      – SubjectFull: Assignment problems (Programming)
        Type: general
      – SubjectFull: Integer programming
        Type: general
      – SubjectFull: Consumers
        Type: general
      – SubjectFull: Product costing
        Type: general
      – SubjectFull: Warehouses
        Type: general
    Titles:
      – TitleFull: A constraint‐programming approach for the storage space allocation problem in a distribution center.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Telha, Claudio
      – PersonEntity:
          Name:
            NameFull: González‐Ramírez, Rosa G.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 11
              Text: Nov2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 09696016
          Numbering:
            – Type: volume
              Value: 32
            – Type: issue
              Value: 6
          Titles:
            – TitleFull: International Transactions in Operational Research
              Type: main
ResultId 1