An integrated multi‐objective model to determine the optimal rescue path and traffic controlled arcs for disaster relief operations under uncertainty environments
Bibliographic record
Abstract
Abstract This study proposes an integrated multi‐objective model to determine the optimal rescue path and traffic controlled arcs for disaster relief operations under uncertainty environments. The model consists of three sub‐models: rescue shortest path model, post‐disaster traffic assignment model, and traffic controlled arcs selection model to minimize four objectives: travel time of rescue path, total detour travel time, number of unconnected trips of non‐victims, and number of police officers required. Since these sub‐models are inter‐related with each other, they are solved simultaneously. This study employs genetic algorithms incorporated with traffic assignment and K‐shortest path methods to determine optimal rescue path and controlled arcs. To cope with uncertain information associated with the damaged network, fuzzy system reliability theory (weakest t‐norm method) is used to measure the access reliability of rescue path. To investigate the validity and applicability of the proposed model, studies on an exemplified case and a field case of Chi‐Chi earthquake in Taiwan are conducted. The performances of three rescue strategies: without traffic control, selective traffic control (i.e. the proposed model) and absolute traffic control are compared. The results show that the proposed model can maintain the efficiency of rescue activity with minimal impact to ordinary trips and number of police officers required.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".