Cargando…
Ramping up a heuristic procedure for storage location assignment problem with precedence constraints
The retail industry is becoming increasingly competitive; as a result, companies are seeking to reduce inefficiencies in their supply chains. One way of increasing the efficiency of operations inside a warehouse is by better allocating products in the available spaces. In this paper, we propose a ne...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8210510/ https://www.ncbi.nlm.nih.gov/pubmed/34155445 http://dx.doi.org/10.1007/s10696-021-09423-w |
_version_ | 1783709326972551168 |
---|---|
author | Trindade, Maria A. M. Sousa, Paulo S. A. Moreira, Maria R. A. |
author_facet | Trindade, Maria A. M. Sousa, Paulo S. A. Moreira, Maria R. A. |
author_sort | Trindade, Maria A. M. |
collection | PubMed |
description | The retail industry is becoming increasingly competitive; as a result, companies are seeking to reduce inefficiencies in their supply chains. One way of increasing the efficiency of operations inside a warehouse is by better allocating products in the available spaces. In this paper, we propose a new heuristic approach to solving the storage location assignment problem (SLAP) considering precedence constraints, in multi-aisle, multi-product picking warehouses. A two-phase heuristic procedure is developed: the products are clustered and assigned to the available spaces. We tested the procedure in the non-perishables warehouse of a real-world Portuguese retail chain, which supplies 191 stores per day. The results show that the new assignment of products allows for an improvement of up to 15% on the distance travelled by the pickers, which implies savings of approximately 477 km per month. This problem is a special case of SLAP since we are dealing with large percentages of non-uniform products. This procedure incorporates four relevant criteria for the allocation decision: the products’ similarity, demand and weight, and the distance travelled by the picker. By using a two-phase heuristic method, this study offers companies and academics an alternative and more effective solution for SLAP than the usual methods based on the creation of density zones. |
format | Online Article Text |
id | pubmed-8210510 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2021 |
publisher | Springer US |
record_format | MEDLINE/PubMed |
spelling | pubmed-82105102021-06-17 Ramping up a heuristic procedure for storage location assignment problem with precedence constraints Trindade, Maria A. M. Sousa, Paulo S. A. Moreira, Maria R. A. Flex Serv Manuf J Article The retail industry is becoming increasingly competitive; as a result, companies are seeking to reduce inefficiencies in their supply chains. One way of increasing the efficiency of operations inside a warehouse is by better allocating products in the available spaces. In this paper, we propose a new heuristic approach to solving the storage location assignment problem (SLAP) considering precedence constraints, in multi-aisle, multi-product picking warehouses. A two-phase heuristic procedure is developed: the products are clustered and assigned to the available spaces. We tested the procedure in the non-perishables warehouse of a real-world Portuguese retail chain, which supplies 191 stores per day. The results show that the new assignment of products allows for an improvement of up to 15% on the distance travelled by the pickers, which implies savings of approximately 477 km per month. This problem is a special case of SLAP since we are dealing with large percentages of non-uniform products. This procedure incorporates four relevant criteria for the allocation decision: the products’ similarity, demand and weight, and the distance travelled by the picker. By using a two-phase heuristic method, this study offers companies and academics an alternative and more effective solution for SLAP than the usual methods based on the creation of density zones. Springer US 2021-06-17 2022 /pmc/articles/PMC8210510/ /pubmed/34155445 http://dx.doi.org/10.1007/s10696-021-09423-w Text en © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 This article is made available via the PMC Open Access Subset for unrestricted research re-use and secondary analysis in any form or by any means with acknowledgement of the original source. These permissions are granted for the duration of the World Health Organization (WHO) declaration of COVID-19 as a global pandemic. |
spellingShingle | Article Trindade, Maria A. M. Sousa, Paulo S. A. Moreira, Maria R. A. Ramping up a heuristic procedure for storage location assignment problem with precedence constraints |
title | Ramping up a heuristic procedure for storage location assignment problem with precedence constraints |
title_full | Ramping up a heuristic procedure for storage location assignment problem with precedence constraints |
title_fullStr | Ramping up a heuristic procedure for storage location assignment problem with precedence constraints |
title_full_unstemmed | Ramping up a heuristic procedure for storage location assignment problem with precedence constraints |
title_short | Ramping up a heuristic procedure for storage location assignment problem with precedence constraints |
title_sort | ramping up a heuristic procedure for storage location assignment problem with precedence constraints |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8210510/ https://www.ncbi.nlm.nih.gov/pubmed/34155445 http://dx.doi.org/10.1007/s10696-021-09423-w |
work_keys_str_mv | AT trindademariaam rampingupaheuristicprocedureforstoragelocationassignmentproblemwithprecedenceconstraints AT sousapaulosa rampingupaheuristicprocedureforstoragelocationassignmentproblemwithprecedenceconstraints AT moreiramariara rampingupaheuristicprocedureforstoragelocationassignmentproblemwithprecedenceconstraints |