Automated Stacker Cranes: A Two-Step Storage Reallocation Process for Enhanced Service Efficiency
Bibliographic record
Abstract
Automated storage and retrieval systems (AS/RS) play a key role in improving the performance of automated manufacturing systems, warehouses, and distribution centers. In the modern manufacturing industry, the term (AS/RS) refers to various methods under computer control for storing and retrieving loads automatically from defined storage locations. Using an (AS/RS) is not considered a value-added activity. Therefore, the longer (AS/RS) travels, the more expensive the warehousing process becomes. This paper presents an algorithm for minimizing total travel distance/time between input/output (I/O) stations. The proposed algorithm is used to manage the storage and retrieval orders on warehouse shelves in class-based storage on the storage racks. It contains two steps: the first step is to evacuate some storage compartments (locations) near the I/O station; in the second step, some tote bins are reallocated to compartments closer to the I/O station. Among the features of this algorithm are mechanisms that determine the number of reallocated tote bins, which tote bins to reallocate, and in which direction (toward the I/O station or away from it). A simulation model using R software developed specifically for this purpose was used to validate the suggested method. Based on the results, the new method can reduce the service time per order by about 10% to 20%, depending on parameters like the number of orders and the height of the storage rack.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".