A scenario-based possibilistic-stochastic programming approach to address resilient humanitarian logistics considering travel time and resilience levels of facilities
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
There is a great deal of interest in addressing humanitarian logistics due to the need for emergency services in the case of disaster. Controlling both operational and disruption uncertainties in the emergency management is one of challenging topics lately to propose a robust plan for humanitarian logistics. Designing a robust and resilient humanitarian relief chain networks under both operational and disruptive risks can ensure the delivery of the essential supplies to beneficiaries. In this paper, a humanitarian logistic network design with multiple central warehouses and local distribution centres in an integrated manner is addressed by a novel scenario-based possibilistic-stochastic programming approach. The main real-life application of the proposed methodology is to consider the transportation network's routes after an earthquake to provide a plan against uncertainty in whole levels of supply chain along with its availability. To this end, a real case study of Mazandaran province in the north of Iran is provided to validate our methodology as well as a comprehensive discussion and managerial insights are concluded from the results.
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.
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.004 |
| 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.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 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 it