An Integrated Road Construction and Resource Planning Approach to the Evacuation of Victims From Single Source to Multiple Destinations
Bibliographic record
Abstract
This paper presents our study on the emergency resource-planning problem, particularly on the development of a new approach to resource planning through contraflow techniques with consideration of the repair of damaged infrastructures. The contraflow technique is aimed at reversing traffic flows in one or more inbound lanes of a divided highway for the outbound direction. As opposed to the current literature, our approach has the following salient points: (1) simultaneous consideration of contraflow and repair of repair of roads; (2) classification of victims in terms of their problems and urgency in sending them to a safe place or place to be treated; and (3) consideration of multiple destinations for victims. A simulated experiment is also described by comparing our approach with some variations of our approach. The experimental results show that our approach can lead to a reduction in evacuation time by more than 50%, as opposed to the original resource operation on the damaged transportation network, and by about 20%, as opposed to the approach with resource replanning (only) on the damaged network. In addition, the multiobjective optimization algorithm to solve our model can be generalized to other network resource-planning problems under infrastructure damage.
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.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 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".