Sipariş gruplama, toplayıcı rotalama, depolama yeri atama ve çizelgeleme problemlerinin birlikte çözümü

This thesis addresses the optimization of key warehouse order picking operations, focusing on Order Batching Problem, Picker Routing Problem, Location Assignment Problem, and Scheduling Problem. First, we introduce the Joint Order Batching and Routing Policy Selection Problem which involves forming batches and selecting routing policies under a given storage policy. The aim is to minimize total travel distance. We solve this problem optimally using two exact methods; column-and-cut generation and branch-price-and-cut. Second, we extend the analysis to the Joint Order Batching, Batch Sequencing, and Picker Routing Problem with Deadlines, solved using an exact column-and-cut generation method and a heuristic variant of it. Computational experiments on benchmark instances demonstrate that our exact approach outperforms existing methods in both solution quality and computation time for small and medium cases, while the heuristic variant achieves superior results for large instances. The findings provide valuable managerial insights into the benefits of integrating batching, routing, storage assignment, and scheduling decisions in warehouse optimization.