基于Cornish-Fisher展开法的最优可靠路径搜索算法  

Optimal Reliable Path Search Optimization Based on Cornish-Fisher Expansion Method

作　　者：牛曦辰 NIU Xichen(School of Science,Chang’an University,Xi’an 710064,China)

机构地区：[1]长安大学,理学院,陕西西安710064

出　　处：《微型电脑应用》2024年第11期302-306,共5页Microcomputer Applications

摘　　要：最优可靠路径问题广泛应用于交通运输、地理信息科学等领域。基于Cornish-Fisher展开法建立一种最优可靠路径算法,提出基于改进蚁群算法的最优可靠路径选择算法。在更新信息素浓度时,加入混沌映射,并在状态转移概率中加入损失函数,避免算法陷入局部最优解;不断调整挥发因子,加快算法的收敛速度。实验结果表明,基于Cornish-Fisher展开法得到的最优可靠路径通行时间与分布模型相比更精确和稳定,且改进的蚁群算法收敛速度更快、寻优能力更强。The optimal reliable path problem has a wide application range in the field of transportation and geographic information.This paper establishes an optimal reliable path model based on the Cornish-Fisher expansion method and propose an optimization based on improved ant colony optimization.When updating the pheromone concentration.This paper adds Tent chaotic mapping,and loss function is added to the state transition probability to prevent the optimization from falling into a local optimal solution.This paper continuously adjusts the volatility factor to speed up the convergence speed of the optimization.The research results show that the transit time of the optimal reliable path obtained based on the Cornish-Fisher expansion method is more accurate and stable.The improved ant colony optimization has faster convergence speed and stronger optimization ability.

关 键 词：最优可靠路径 Cornish-Fisher展开法 蚁群算法 Tent混沌映射 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]