212 / 2018-07-05 14:46:54

Multi-objective evacuation routing in underground networks

Mine safety; path optimization; bounded rationality; modified Dijkstra algorithm; multi-objective optimization

矿山安全科学理论与应急救援 > 矿山安全科学理论

Aiming at the multi-objective optimization problem of route selection in underground emergency evacuation under real time effect of disaster extension, the model for route selection is proposed, in which the travel condition of time and safety on each arc of the underground tunnel network will be changing continuously due to the spread of disaster, and the objective is to minimize safety probability, travel time and complexity of the selected route. Based on theories of bounded rationality and properties of the constructed auxiliary functions, an interval-searched algorithm is designed to solve the multi-objective time-dependent shortest path problem presented in the model. The feasibility of the algorithm has been proved, and the compilation method has been given. Computational results show the effectiveness and feasibility of the model and algorithm presented in this paper.