Optimization Model Based on Reachability Guarantee for Emergency Facility Location and Link Reinforcement
Bibliographic record
Abstract
The reasonable location of emergency facilities plays an important role in both predisaster service and postdisaster relief. Moreover, damage to the transportation network often affects the accessibility of demand points, which can seriously hamper timely rescue operations. Reasonable location of emergency facilities and reinforcement of fragile roads are two important strategies to improve the reachability of demand points. In this paper, we proposed a biobjective optimization model to determine locations of emergency facilities and links to be reinforced given a limited budget. Each demand point is allocated a primary facility and a backup facility, the former can provides normal service, and the latter is prepared for postdisaster relief. One goal of the model is to minimize the operating cost of normal services, and another goal is to maximize the reachability guarantee of demand points. The novelty and contribution of this paper are that we defined the reachability by introducing damage tolerance instead of link failure probability. Based on this, we defined the reachability guarantee to deal with the worst scenario of disasters. By embedding the max-flow problem of the reachability guarantee into the emergency facility location problem, the locations of emergency facilities and links to be reinforced can be determined simultaneously. The methodology is applied to a simplified Sioux Falls transportation network. Results such as the trade-off curve of two goals, budget efficiency, and the effect of reinforcement demonstrated the effectiveness of the model.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| 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".