{'fraction_non_alphanumeric': 0.015329125338142471, 'fraction_numerical': 0.005410279531109108, 'mean_word_length': 5.607142857142857, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Optimization of emergency evacuation routes in terminal building based on improved Dijkstra-GA algorithm

Aiming at the optimization of emergency evacuation paths for personnel in terminal emergencies, a path optimization method based on minimizing the cumulative danger is proposed. Taking the minimum cumulative danger degree and the minimum total evacuation time as the objective functions, a multi-objective path optimization model for emergency evacuation is established; an improved Dijkstra-GA path optimization algorithm is proposed to solve the problem, and an emergency evacuation path optimization scheme is obtained; an airport terminal is taken as an actual case, using Anylogic software to simulate the obtained scheme, and compared with the results of the traditional Dijkstra algorithm. The simulation results show that the evacuation time of the evacuation scheme solved by the improved Dijkstra-GA algorithm is 378s, which is 229s higher than that of the traditional Dijkstra algorithm. The feasibility of the path optimization scheme based on the improved Dijkstra-GA algorithm is verified.