MétaCan
Menu
Back to cohort
Record W4401739894 · doi:10.1016/j.cie.2024.110506

Exploring the pre-disaster evacuation network design problem under five traffic equilibrium models

2024· article· en· W4401739894 on OpenAlexaff
Junxiang Xu, Divya Jayakumar Nair, S. Travis Waller

Bibliographic record

VenueComputers & Industrial Engineering · 2024
Typearticle
Languageen
FieldEngineering
TopicEvacuation and Crowd Dynamics
Canadian institutionsTransport Canada
FundersUniversity of New South Wales
KeywordsNetwork planning and designTransport engineeringTraffic networkFlow networkComputer scienceOperations researchEngineeringCivil engineeringMathematical optimizationMathematicsComputer network

Abstract

fetched live from OpenAlex

This paper explores modeling approaches for the pre-disaster Evacuation Network Design Problem (ENDP) considering different flow equilibrium conditions. We combine this problem with the modeling idea of Continuous Network Design Problem (CNDP), which we call Continuous Evacuation Network Design Problem (CENDP) in this paper. We develop five CENDP models, which are under the consideration of User Equilibrium (UE), Stochastic User Equilibrium (SUE), Boundedly Rational User Equilibrium (BRUE), and Non-equilibrium (NONE), among which we develop two types of models based on BRUE. The modeling is mainly to consider the single objective of optimizing the total evacuation time, and then to provide reasonable road expansion solutions under certain budget constraints and different equilibrium conditions. Our main motivation for developing models is to introduce various types of equilibrium conditions into models and design algorithms to solve these problems while mining for key insights. We design the corresponding five heuristic algorithms to solve models and verify the applicability of the models and algorithms by two test networks (Nguyen-Dupuis network and Sioux-Falls network). We demonstrate whether evacuation flow equilibrium need or not need to be considered in the CENDP, the applicability of different equilibrium conditions, and the correlation between the total evacuation time, the network investment cost, and the network congestion degree. Additionally, we conduct model and algorithm tests on 40 instance networks, dividing them into medium-sized networks (20 instances) and large-sized networks (20 instances). Not only do we further validate the insights obtained from the test networks, but we also expand upon them. Specifically, the main findings of this study are as follows: (1) We demonstrate that considering evacuation flow equilibrium in CENDP is essential to reduce total evacuation time, construction costs, and mitigate congestion. (2) While increased investment in road construction can meet evacuation time requirements, it is crucial to make informed decisions, as investment alone does not directly reduce total evacuation time and congestion. (3) Optimizing road evacuation time is more effective than merely increasing road capacity for reducing total evacuation time and mitigating congestion. (4) From the perspectives of total evacuation time, investment cost, and network congestion degree, the CENDP model considering user equilibrium performs better in medium-sized networks, while the CENDP model considering stochastic user equilibrium performs better in large-sized networks. Conversely, the CENDP model that does not consider flow equilibrium performs the worst across all above three metrics. Based on this, we also provide recommendations on which model to choose for different metrics. In summary, this study not only reveals the importance of different flow equilibrium conditions in evacuation network design but also provides valuable strategic recommendations for practical applications to optimize evacuation effectiveness and resource allocation.

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 imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.023
Threshold uncertainty score0.045

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.108
GPT teacher head0.230
Teacher spread0.123 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations2
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueComputers & Industrial EngineeringSame topicEvacuation and Crowd DynamicsFrench-language works237,207