EconPapers    
Economics at your fingertips  
 

The order picking problem under a scattered storage policy

Farzaneh Rajabighamchi, Stan van Hoesel and Christof Defryn
Additional contact information
Farzaneh Rajabighamchi: Data Analytics and Digitalisation, RS: GSBE other - not theme-related research
Stan van Hoesel: RS: GSBE other - not theme-related research, RS: FSE DACS Mathematics Centre Maastricht, QE Operations research
Christof Defryn: RS: GSBE other - not theme-related research, RS: FSE DACS Mathematics Centre Maastricht, QE Operations research

No 6, Research Memorandum from Maastricht University, Graduate School of Business and Economics (GSBE)

Abstract: When warehouses are operated according to a scattered storage policy, each Stock Keeping Unit(SKU) is stored at multiple locations inside the warehouse. Such a configuration allows for improved picking efficiency, as now an SKU can be picked from the location that is most compatible with the other SKU’s in the picking batch. Seizing these benefits, however, comes at the cost of additional decisions to be made while planning the picking operations. Next to determining the sequence in which SKU’s will be retrieved from the warehouse, the location at which each SKU needs to be extracted has to be chosen by the planner. In this paper, we model the order picking problem under a scattered storage policy as a Generalized Travelling Salesperson Problem (GTSP). In this problem, the vertices of the underlying graph are partitioned into clusters from which exactly one vertex should be visited in each cluster. In our order picking application, each cluster contains all product locations of a single SKU on the order list. The aim is to design a pick tour that visits all product locations of the SKU’s on the pick list (i.e., visit each cluster exactly once) and minimizes the total travel distance. We present an ILP formulation of the problem and a variable neighbourhood heuristic, embedded in a guided local search framework. The performance of both methods is tested extensively by means of computational experiments on benchmark instances from the literature.

Date: 2023-05-16
New Economics Papers: this item is included in nep-des
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://cris.maastrichtuniversity.nl/ws/files/136608446/RM23006.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:unm:umagsb:2023006

DOI: 10.26481/umagsb.2023006

Access Statistics for this paper

More papers in Research Memorandum from Maastricht University, Graduate School of Business and Economics (GSBE) Contact information at EDIRC.
Bibliographic data for series maintained by Andrea Willems () and Leonne Portz ().

 
Page updated 2025-04-20
Handle: RePEc:unm:umagsb:2023006