Integrating storage location and order picking problems in warehouse planning

Authors: Silva, AllysonCoelho, Leandro C.Darvish, MaryamRenaud, Jacques
Abstract: Storage location and order picking are two interdependent problems arising in warehouse planning traditionally solved independently. We introduce and model the integrated storage location and order picking problem and four special cases with imposed routing policies (return, S-shape, midpoint and largest gap). Experiments show that these models are difficult to solve, even for small warehouses and few orders. Therefore, we present a General Variable Neighborhood Search metaheuristic, which is observed to be very efficient for those small instances. For larger warehouses and more pickings, we show that our metaheuristic significantly improves solutions generated by common storage policies.
Document Type: Article de recherche
Issue Date: 2 July 2020
Open Access Date: 2 July 2023
Document version: AM
Creative Commons Licence: https://creativecommons.org/licenses/by-nc-nd/4.0
Permalink: http://hdl.handle.net/20.500.11794/68959
This document was published in: Transportation research. Part E, Logistics and transportation review, Vol. 140 (2020)
https://doi.org/10.1016/j.tre.2020.102003
Pergamon
Alternative version: 10.1016/j.tre.2020.102003
Collection:Articles publiés dans des revues avec comité de lecture

Files in this item:
Description SizeFormat 
SLOPP_Corpus.pdf
687.92 kBAdobe PDF    Request a copy
All documents in CorpusUL are protected by Copyright Act of Canada.