Research On Emergency Evacuation Planning Based On Urban Transportation Network

When the emergencies occur,how to schedule the large number of evacuees to the safe areas in the shortest possible time is a spotlight at present.The loss of public life and property can be reduced by appropriate evacuation planning routes.This thesis researches on evacuation route planning based on the urban transportation network.Two optimized evacuation algorithms are proposed to effectively evacuate evacuees in the shortest possible time by properly allocating traffic resources.The main work of this article is as follows.(1)A definition of Flow Rate is introduced to describe the relationship between the travel time and the number of evacuees of evacuation routes.A heuristic Max-Flow Rate Priority(MFRP)evacuation algorithm is proposed to generate evacuation route planning for the evacuees based on the concept of FlowRate.(2)By embedding the contraflow-based greedy strategy into MFRP,we design a heuristic Capacity-Constrained Contraflow Adaption(CC-Adap)evacuation algorithm in this thesis.It imposes the contraflow-based reconfiguration on candidate routes with the maximal FlowRate and adaptively reuses historical routes.Experimental results indicate that both MFRP and CC-Adap algorithms provide well-performed evacuation route planning for the emergencies.