Papers › Minimization of mean-CVaR evacuation time of a crowd using rescue guides: a...
Minimization of mean-CVaR evacuation time of a crowd using rescue guides: a scenario-based approach
Anton von Schantz, Harri Ehtamo, Simo Hostikka
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In case of a threat in a public space, the crowd in it should be moved to a shelter or evacuated without delays. Risk management and evacuation planning in public spaces should also take into account uncertainties in the traffic patterns of crowd flow. One way to account for the uncertainties is to make use of safety staff, or guides, that lead the crowd out of the building according to an evacuation plan. Nevertheless, solving the minimum time evacuation plan is a computationally demanding problem. In this paper, we model the evacuating crowd and guides as a multi-agent system with the social force model. To represent uncertainty, we construct probabilistic scenarios. The evacuation plan should work well both on average and also for the worst-performing scenarios. Thus, we formulate the problem as a bi-objective scenario optimization problem, where the mean and conditional value-at-risk (CVaR) of the evacuation time are objectives. A solution procedure combining numerical simulation and genetic algorithm is presented. We apply it to the evacuation of a fictional passenger terminal. In the mean-optimal solution, guides are assigned to lead the crowd to the nearest exits, whereas in the CVaR-optimal solution the focus is on solving the physical congestion occurring in the worst-case scenario. With one guide positioned behind each agent group near each exit, a plan that minimizes both objectives is obtained.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections