Optimising Warehouse Order Picking: Real Case Application in the Shoe Manufacturing Industry
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Order picking is a critical and labour-intensive warehouse management operation that involves removing items from storage locations to fulfil customer orders. This paper analyses a new order-picking problem based on the real case of a Canadian shoe manufacturer characterised by a warehouse with random storage, where different product types can be assigned to a single storage location. While maximising space utilisation, considering the high number of Stock Keeping Units, this storage approach makes the creation of efficient picking routes challenging, increasing the effort needed to complete picking orders. To address this challenge, we present the Genetic Route Optimisation algorithm for optimising order-picking routes. Our methodology involved testing the proposed algorithm using real-world data derived from the company’s Warehouse Management System. The results demonstrate a reduction in picking distances, highlighting the effectiveness of the Genetic Route Optimisation algorithm in optimising picking routes in a random storage environment. As well as presenting a practical application case, the study highlights the potential of the proposed algorithm to improve operational efficiency in warehouse environments. It also paves the way for future research in warehouse logistics, especially by adapting similar algorithmic strategies to various complex and dynamic warehouse environments, thus advancing the field of warehouse management.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it