Abstract
This paper focuses on optimizing the static order batching problem (OBP) with multiple pickers. This problem involves optimal assignment of a set of customer orders to batches, given capacity constraints, in order to minimize the total distance travelled. The order picking strategy considered is cluster picking. We assume that each picker is assigned one batch and all pickers begin the pick tour simultaneously. The aim is to minimize the total distance travelled by all pickers, which is calculated based on the S-shape routing strategy. A mathematical model is developed to solve the OBP for small-scale instances. For larger instances, a simplified version of an order batching heuristic proposed by DHL Supply Chain is utilized and experimented with for different-sized problems. Both approaches are compared to the conventional first come first serve (FCFS) method of order batching.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
