Answers are grounded in this paper and cite their sources.
This paper presents a real-world-inspired case study addressing a picking routing problem in a clothing warehouse with a non-conventional layout. In the company under study, picker performance is evaluated based on the number of batches completed within a working period, which constitutes a key performance indicator (KPI). Accordingly, the objective of this research is to minimize the total completion time-defined as the sum of the completion times of all pickers-since reducing this metric enables more orders to be processed within the same time horizon, thereby improving overall worker efficiency. Completion times are computed assuming a constant travel velocity and a fixed picking rate per unit of product. An A*-based approach is proposed to efficiently compute travel distances, and a mathematical formulation, three constructive heuristics, and an Iterated Greedy (IG) metaheuristic are developed and compared with the warehouse’s current system logic. The results are evaluated through a comprehensive statistical analysis, showing that the nearest-bin heuristic and the IG algorithm initialized with it significantly enhance order-picking efficiency. The study provides practical insights for warehouses with non-conventional layouts and contributes to more efficient intralogistics operations.
No takes yet. Share an insight, caveat, or question.
Hatami et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: