A fuzzy optimization approach to strategic organ transplantation network design problem: A real case study
Bibliographic record
Abstract
Designing an efficient supply chain for organ transplant networks which is intimately related to humans’ life plays a primary role in improving the network’s performance. This research is focused on proposing a new multi-period location-allocation modeling approach to make appropriate strategic decisions for designing organ transplant networks under supply and budget uncertainties. To serve this purpose, a bi-objective possibilistic programming model is formulated the aim of which is to maximize network responsiveness and minimize the total cost. A fuzzy goal programming approach is adopted to solve multiple objective function models and control their deviations from the corresponding aspiration levels. As an important contribution of this study, the chance of success of transplantation processes is taken into consideration by proposing appropriate utility functions according to transportation criteria. Moreover, for the purpose of coping with the inherent uncertainty of the input parameters, a possibilistic programming model based on Me measure converted to three optimistic, realistic and pessimistic models is developed. Three new formulations have also been developed to tackle equality chance constraints. Finally, the optimal solutions of the developed models are analyzed through conducting a real case study in Iran. According to the results, for the considered organ transplant network, the possibilistic programming model based on the realistic measure is better than the optimistic and pessimistic measure in most confidence levels.
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.002 | 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.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.003 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 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".