Agglomerative Aisle Clustering Approach with Multiple Depots to Solve Order Batching, Depot Assignment, and Routing Problem

Authors : Selma Gülyeşil, Zeynep Didem Unutmaz Durmuşoğlu

Pages : 207-235

View : 44 | Download : 28

Publication Date : 2025-08-31

Article Type : Research Paper

Abstract :In this study, a heuristic algorithm named “Agglomerative Aisle Clustering (AAC)” is proposed to solve the order batching, depot assignment, and routing problem in a single-block warehouse with 8 aisles, where multiple depots are present and orders are picked manually. The performance of the proposed algorithm is analyzed from two different perspectives. Firstly, in order to analyze the effect of the proposed heuristic algorithm on the order batching process, it is compared with the method in which the same warehouse layout properties are used but the order batches are constructed according to the First-Come-First-Served (FCFS) strategy. Secondly, in order to analyze the integrated effect of both the presence of multiple depots and the proposed heuristic algorithm, it is compared with the method that forms the order batches according to the FCFS strategy in a single block with 8 aisles warehouse but with one left-most located depot. For the analyses, customer order databases containing 20, 40, and 60 different customer orders are randomly generated, and 30 experiments are conducted for each group. The results demonstrate that the proposed algorithm, aimed at minimizing the total order picking distance, performs 15% better on average across the three order groups.
Keywords : Depo yönetimi, Sipariş gruplama, Depot atama, Çoklu depot

ORIGINAL ARTICLE URL