Evacuating People with Mobility‐Challenges in a Short‐Notice Disaster
研究了短时灾难中如何疏散行动不便人员，将其建模为组合优化问题，并用蚁群算法求解，对应急管理者和政策制定者有参考价值。
ABSTRACT In past disasters, arrangements have been made to evacuate people without their own transportation, requiring them to gather at select locations to be evacuated. Unfortunately, this type of plan does not help those people who are unable to move themselves to the designated meeting locations. In the United States, according to the Post‐Katrina Emergency Management Reform Act of 2006, state or local governments have the responsibility to coordinate evacuation plans for all populations. These include those with disabilities. However, few, if any, have plans in place for those who are mobility‐challenged. The problem of evacuating mobility‐challenged people from their individual locations in a short‐notice disaster is a challenging combinatorial optimization problem. In order to develop the model and select a solution approach, we surveyed related literature. Based on our review, we formulate the problem and develop an Ant Colony Optimization (ACO) algorithm to solve it. We then test two different versions of the ACO algorithm on five stylized datasets with several different parameter settings.