www.uhasselt.be
DSpace

Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/22615

Title: Improving Order Picking Efficiency by Analyzing Combinations of Storage, Batching, Zoning, and Routing Policies
Authors: Van Gils, Teun
Braekers, Kris
Ramaekers, Katrien
Depaire, Benoît
Caris, An
Issue Date: 2016
Publisher: Springer International Publishing
Citation: Paias, Ana; Ruthmair, Mario; Voß, Stefan (Ed.). Computational Logistics; 7th International Conference, ICCL 2016, Lisbon, Portugal, September 7-9, 2016, Proceedings, Springer International Publishing,p. 427-442
Series/Report: Lecture Notes in Computer Science
Abstract: In order to differentiate from competitors in terms of customer service, warehouses accept late orders while providing delivery in a quick and timely way. This trend leads to a reduced time to pick an order. The objective of this research is to simulate and evaluate the interaction between several storage, batching, zone picking and routing policies in order to reduce the order picker travel distance. The value of integrating these four operation policy decisions is proven by a real-life case study. A full factorial ANOVA provides insight into the interactions between storage, batching, zoning, and routing policies. The results of the study clearly indicate that warehouses can achieve significant benefits by considering storage, batching, zone picking, and routing policies simultaneously. Awareness of the influence of an individual policy decision on the overall warehouse performance is required to manage warehouse operations, resulting in enhanced customer service.
URI: http://hdl.handle.net/1942/22615
DOI: 10.1007/978-3-319-44896-1_28
ISBN: 9783319448954
ISSN: 0302-9743
Category: C1
Type: Proceedings Paper
Validation: vabb, 2018
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Peer-reviewed author version - Paper1.07 MBAdobe PDF
Published version2.24 MBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.