Models for automated storage and retrieval systems: a literature review
Bibliographic record
Abstract
Automated Storage and Retrieval Systems (AS/RS) are warehousing systems that use mechanised devices to accomplish the repetitive tasks of storing and retrieving parts in racks. Since these systems represent a significant investment and considerable operating costs, their use must be as efficient as possible. AS/RS performance is the result of the interaction of many complex and stochastic subsystems. This reality creates a need for robust and efficient evaluation models. This article complements previous surveys on AS/RS by focusing on the particular research question addressed by each work and the associated assumptions used for the various models designed for evaluating AS/RS. Dynamic models based on simulation dominate the most recent literature; however, static approaches based on travel-time modelling have strongly contributed to the study of AS/RS. This review includes dynamic – simulation-based – models, but considers also steady-state (travel-time-based) models. We believe that this review may be of great help to researchers and industrial users in their search for the best modelling approach for a specific problem.
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.003 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.004 | 0.008 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.003 |
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".