Approximate Dynamic Programming Modeling for a Typical Blood Platelet Bank
Bibliographic record
Abstract
It addresses some of the literature gaps and overcome curse of dimension problem.The model considers eight blood types with stochastic demand, stochastic supply.It uses news vendor model and the current inventory to control the supply uncertainty.It uses linear programing to solve the single-period inventory model optimally.It uses ADP to solve the multi-period model without any downsizing. This paper introduces a workable model for the establishment of an inventory bank holding perishable blood platelets with a short shelf life. The model considers a blood platelet bank with eight blood types, stochastic demand, stochastic supply, and deterministic lead time. The model is formulated using approximate dynamic programming. The model is evaluated in terms of four measures of effectiveness: blood platelet shortage, outdating, inventory level, and reward gained. Moreover, several alternative inventory control policies are analyzed. The order quantity decision is taken using a news-vendor model. In addition, the variation of the O- percentage is studied. This study confirms that the blood platelet bank reward can be maximized by operating at the optimal inventory level, thereby minimizing the number of outdated units as well as shortages. In addition, the suitable O- percentage within the blood platelet bank inventory was studied. As the O- blood type inventory levels increase to 40%, shortages drop from 3.9% to 1.5%. Outdated units drop from 4.6% to 1.8%. Furthermore, when the order quantity is received twice a day, shortages drop to 1.8% and outdated units drop to 2.1%.
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.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 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".