城市群客运网络疏散路径优化  

Optimization of Urban Agglomeration Transportation Network Evacuation Paths

作　　者：贺博威 李成兵[1] 聂士达 王佳琳 He Bowei;Li Chengbing;Nie Shida;Wang Jialin(School of Transportation,Inner Mongolia University,Hohhot 010070,China)

机构地区：[1]内蒙古大学交通学院,内蒙古呼和浩特010070

出　　处：《系统仿真学报》2024年第12期2937-2944,共8页Journal of System Simulation

基　　金：国家自然科学基金(62063023);内蒙古自然科学基金(2023MS05036);内蒙古自治区高等学校青年科技英才支持计划(NJYT22099)。

摘　　要：针对城市群内部交通网络结构复杂,备选线路多的特点,提出一种改进蚁群算法,用于求解城市群客运网络疏散路径问题。构建了城市群综合客运网络模型,在模型构建中考虑城市范围内虚拟换乘边问题,考虑出行时间成本与换乘时间成本构建权重函数;针对蚁群算法进行优化,构建了一种自适应调整的状态转移规则和基于路径长度优化提高算法运算效率的信息素更新规则。结果表明:改进蚁群算法可以有效提高算法收敛效率,降低疏散路径节点数、降低疏散总费用,具有较强的鲁棒性。Given the complexity of the internal transportation network structure within urban agglomerations and the presence of numerous alternative routes,this paper proposes an enhanced ant colony algorithm to address the evacuation path problem of urban agglomeration transportation networks.A comprehensive urban agglomeration transportation network model is constructed,in which the issue of virtual transfer edges within the urban scope is considered and a weighting function is constructed taking into account the travelling time cost and the transferring time cost.Optimizations are applied to the ant colony algorithm,constructing an adaptive adjustment of state transitions and an information pheromone update rule aiming at accelerating convergence speed.The results show that the improved ant colony algorithm can effectively improve the convergence efficiency,reduce the number of evacuation path nodes,and decrease the total evacuation cost,demonstrating strong robustness.

关 键 词：城市群 网络模型 应急疏散 蚁群算法 路径优化 

分 类 号：U491[交通运输工程—交通运输规划与管理] TP391[交通运输工程—道路与铁道工程]