A novel particle swarm optimization-based grey model for the prediction of warehouse performance
Bibliographic record
Abstract
Abstract Warehouses constitute a key component of supply chain networks. An improvement to the operational efficiency and the productivity of warehouses is crucial for supply chain practitioners and industrial managers. Overall warehouse efficiency largely depends on synergic performance. The managers preemptively estimate the overall warehouse performance (OWP), which requires an accurate prediction of a warehouse’s key performance indicators (KPIs). This research aims to predict the KPIs of a ready-made garment (RMG) warehouse in Bangladesh with a low forecasting error in order to precisely measure OWP. Incorporating advice from experts, conducting a literature review, and accepting the limitations of data availability, this study identifies 13 KPIs. The traditional grey method (GM)—the GM (1, 1) model—is established to estimate the grey data with limited historical information but not absolute. To reduce the limitations of GM (1, 1), this paper introduces a novel particle swarm optimization (PSO)-based grey model—PSOGM (1, 1)—to predict the warehouse’s KPIs with less forecasting error. This study also uses the genetic algorithm (GA)-based grey model—GAGM (1, 1)—the discrete grey model—DGM (1, 1)—to assess the performance of the proposed model in terms of the mean absolute percentage error and other assessment metrics. The proposed model outperforms the existing grey models in projecting OWP through the forecasting of KPIs over a 5-month period. To find out the optimal parameters of the PSO and GA algorithms before combining them with the grey model, this study adopts the Taguchi design method. Finally, this study aims to help warehouse professionals make quick OWP estimations in advance to take control measures regarding warehouse productivity and efficiency.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".