城市动态灾害环境下多种类多目标路径优化算法  

Multi-category multi-objective path optimization algorithm in urban dynamic disaster environments

作　　者：张盈斐 李航 齐玉亮[3] 王伟明 张海林 胡小兵 ZHANG Yingfei;LI Hang;QI Yuliang;WANG Weiming;ZHANG Hailin;HU Xiaobing(College of Safety Science and Engineering,Civil Aviation University of China,Tianjin 300300,China;Laboratory of System Safety and Intelligent Decisions,Civil Aviation University of China,Tianjin 300300,China;Hebei Province Highway Jingxiong Preparatory Office,Baoding Hebei 071000,China;Jiaoke Transport Consultants Ltd.,Beijing 100191,China)

机构地区：[1]中国民航大学安全科学与工程学院,天津300300 [2]中国民航大学体系安全与智能决策实验室,天津300300 [3]河北省高速公路京雄筹建处,河北保定071000 [4]北京交科公路勘察设计研究院,北京100191

出　　处：《中国安全科学学报》2024年第9期217-224,共8页China Safety Science Journal

基　　金：中央高校基本科研业务费专项资金(3122023034,3122019057);河北省交通运输厅科技项目(JX-202002)。

摘　　要：为提高城市应对动态灾害的响应能力,针对动态灾害环境中应急车辆行驶路线的规划问题,考虑路径安全度为乘法权重,车辆行驶路径长度和通行时间为加法权重,首先,提出一种动态环境下可同时计算乘法与加法权重的多种类多目标路径优化问题(MCMPOP)的求解模型;其次,通过改进涟漪扩散算法(RSA)求解MCMPOP;然后,为验证算法的有效性,通过510组仿真试验,对比MCMPOP下非支配排序遗传算法(NSGA)-Ⅱ与改进RSA的计算时间与解的质量;最后,选取“7·20”郑州特大暴雨事件数据进行实例验证。结果表明:与NSGA-Ⅱ相比,改进的RSA可以求解出完整的Pareto最优路径集合,有效保证算法的计算效率和Pareto最优解的质量;可在应急车辆可接受的安全范围内,筛选出行驶路线长度和时间成本较小的Pareto最优路径,为应急车辆提供更多可靠的行驶路线,提高城市的应急管理能力。To improve urban response capabilities in dealing with dynamic disasters,a MCMPOP was proposed for planning emergency vehicle paths in dynamic disaster environments.This model considered path safety as a multiplicative weight and vehicle path length and travel time as additive weights.Then,MCMPOP was addressed by improving the RSA.To verify the effectiveness of the improved RSA in solving the MCMPOP,510 simulation experiments were conducted comparing the computer time and solution quality of the Non-dominated Sorting Genetic Algorithm(NSGA)-Ⅱ and the improved RSA.Furthermore,"7·20"Zhengzhou rainstorm event was selected as a case study to validate the model.The results show that,compared to the NSGA-Ⅱ,the improved RSA can find a complete set of Pareto optimal paths,effectively ensuring the optimality and computational efficiency of the algorithm.By using RSA to solve MCMPOP,it is possible to successfully select Pareto optimal paths with the shortest travel path lengths and the lowest time costs within the acceptable path safety range for emergency vehicles,providing more reliable routes for emergency vehicles and enhancing the urban emergency management capabilities.

关 键 词：动态灾害环境 多种类多目标路径优化问题(MCMPOP) 涟漪扩散算法(RSA) 路线规划 PARETO前沿 

分 类 号：X951[环境科学与工程—安全科学] O221.6[理学—运筹学与控制论]