Study On Optimization Of On-site Personnel Emergency Evacuation Route For Nuclear Accident

With the rapid development of economy and the enhancement of military strength,new energy and technology are emerging and widely used.The use of nuclear power has begun to increase,and at the same time,the security risks are increasing.Nuclear power plant,reactor and other nuclear facilities have the possibility of nuclear accidents in the process of production and operation.With the increase of nuclear power workers,the emergency evacuation in the field is an important part of the nuclear safety.Therefore,it is of great significance to optimize the emergency evacuation routes for nuclear accident personnel.Based on the nuclear safety problems in China's nuclear power development,this paper tries to find out the measures taken to deal with nuclear accidents at home and abroad and to read the research results of domestic and foreign scholars in the evacuation of emergency personnel.Based on decision theory and optimization theory,we optimize the emergency evacuation routes for nuclear accident personnel.The evacuation of personnel in the field should ensure that all the non emergency personnel are evacuated under the most safe condition.Through the understanding of the characteristics of nuclear facilities,nuclear accidents,nuclear emergency,and the emergency evacuation process of personnel accident in the field,the optimization objective of this paper is put forward: optimization of site selection,personnel collection and vehicle routing optimization.Because of the relationship between the two optimizations,a two-layer programming model is built.The upper level model considers the shortest evacuation time and the minimum dose of the gathering point.The lower level model is the shortest evacuation time,the shortest dose of the personnel from the location to the aggregation point,and the evacuation vehicle driving from the gathering point.The exit route of the field.In view of the algorithm of the model design model,the multi-objective programming problem with the shortest time and the minimum dose is transformed into a single objective programming with the shortest time as the objective function,and the requirement of security is transformed into a constraint condition,that is,the total effective dose received during the evacuation of the personnel is lower than the reference standard.The value can be.Genetic algorithm is used to solve the location problem of aggregation points.The A* algorithm is used to find the optimal path of personnel collection and vehicle evacuation.The location of gathering points will affect the selection of evacuation routes.Meanwhile,the different location of roads will also affect the location of aggregation points.Therefore,we combine genetic algorithm with A* algorithm to select the optimal location plan and evacuation route continuously.According to the solution algorithm,the double-layer model is simulated and analyzed.Through the calculation,14 nodes are selected as an emergency evacuation gathering point.Under the conditions of security personnel,1728 non emergency evacuees on the 100 nodes in the field are evacuated to the field in 50 minutes.The location of the gathering points and the design of evacuation routes ensure the safety of emergency evacuation.Through the simulation analysis of the constructed double-layer model,it verifies the feasibility of the model to optimize the emergency evacuation route for the field personnel.At the same time,we analyze the robustness of the evacuation network by cascading failure model,and calculate several emergency evacuation routes combined with the shortest path theory of k-.The models and solving methods built in this paper also provide references for the determination of the accumulation point and the planning of emergency path in the design and construction phase of nuclear facilities.