Path Selection And Allocation Algorithm Based On Queuing Evacuation Scene

Aimed at evacuation through queuing,this paper studied route selection and crowd distribution algorithm.Improving evacuation efficiency through scientific and effective management is of great research significance as the research result can help reduce or avoid casualties caused by delayed or inefficient evacuation as much as possible when incidents occur.The method of evacuation through queuing can create orderly evacuation;therefore,this method can be applied to crowded places which are easy to be managed.Even in places where people are hard to be evacuated through queuing,officers can control human flows of each exit to prevent the decrease in exit access efficiency due to overcrowdedness,if scenarios are basically consistent with the assumption in this paper,the algorithm of this paper can be applied.The first part is to establish the crowd evacuation model.In an evacuation-through-queuing scenario,people's movements are restricted by lines,features of evacuation-through-queuing scenarios must be taken into consideration during model building.In this paper,assume that all people queuing for evacuation,except for leaders of the lines,do not leave halfway and all move to the position of the person in front of them within a time unit.Based on the assume,this paper adopts a network model consisting of a series of dots and lines for model building.The second part is to design the evacuation route selection and crowd distribution algorithm in the evacuation model.The design idea is to perform mathematical modeling for evacuation models,simplify them,and design an algorithm through mathematical models.To begin with,the paper performed mathematical modeling for route selection in single-exit scenarios with a single evacuation group by referring to the mathematical model of the minimum cost and largest human flows,analyzed the target function of the model,simplified the function on the condition of ensuring the quality through inequality calculation,and found that the simplified model can be solved using the number of enumeration lines of the improved augmenting path algorithm with the minimum cost and largest flows.Inaddition,this paper also devised the algorithm that finds evacuation routes that do not overlap each other from the network of human flows.The paper also provides solutions to evacuation issues in multi-exit scenarios with multiple evacuation groups based on the algorithm for single-exit scenarios with a single evacuation group.the paper selected the academic report hall in the basement of No.1 building of an institution as the environment for simulating the evacuation experiment and verified the algorithm.By comparing the solution with the shortest route and that with the shortest waiting time,the algorithm described in this paper has obvious advantages.