Multi-objective reference point based enriched swarm optimization with an application to blood supply chain under natural disaster
Bibliographic record
Abstract
The application and analysis of effective blood supply chain network under natural disaster imposed many critical challenges which addressed through an optimization of multiple objectives functions. In this article, relies on reference point algorithm, a user-preference based enriched swarm optimization algorithm is proposed where, inner reference points were produced depending on the perturbed reference point. For each inner reference point, weakly/ɛ-properly Pareto optimal solution was generated using augmented achievement function. All the generated solutions (points) are presented as potential positions for particles in the particle swarm optimization PSO. The proposed algorithm has been reinforced with a novel chaotic contraction operator to retain the feasibility of the particles. To prove the validity of our algorithm, the obtained results are compared with true Pareto optimal front and three of the most salient evolutionary algorithms using inverted generational distance metric IGD. In addition it was implement to detect the most cost and time efficient blood supply chain to provide the required blood types demand on the blood transfusion center in emergence situation, where, it is required to solve this real life application with predefined supply time and predefined supply cost, which is considered as reference point to get the nearby Pareto optimal solution. By the experimental outcomes, we proved that the proposed algorithm is capable to find the set of Paetro optimal solutions nearby the predefined reference points.
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 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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".