| dc.description.abstract | This paper tackles optimizing the static order batching problem (OBP) with multiple pickers in a
warehouse environment. The OBP involves assigning customer orders to batches while
considering capacity limitations. The goal is to minimize the total travel distance for pickers who
utilize a cluster-picking strategy. We assume each picker is assigned a single batch, and all pickers
begin their picking route simultaneously. The objective is to minimize the total travel distance for
all pickers, calculated based on an S-shaped routing strategy. For smaller-sized problems, a
mathematical model is developed to solve the OBP. For larger problems, a simplified version of
an order batching heuristic used by Alchemy Asia Warehouse is implemented and tested on
problems of varying sizes. Both approaches are then compared to the traditional first-come, first served (FCFS) method of order batching | en_US |
