基于改进蚁群算法的完全无向图Hamilton回路求解研究  

Research on Hamilton Loop Solution of Complete Undirected Graph Based on Improved Ant Colony Algorithm

作　　者：刘智明 张闯 LIU Zhiming;ZHANG Chuang(Zhengzhou Institute of Science and Technology,information engineering college,Zhengzhou Henan 450000,China)

机构地区：[1]郑州科技学院信息工程学院,河南郑州450001

出　　处：《信息与电脑》2023年第15期123-125,共3页Information & Computer

摘　　要：针对当前完全无向图Hamilton回路求解过程中存在求解用时较长且波动较大的问题,文章提出基于改进蚁群算法的完全无向图Hamilton回路求解方法。描述完全无向图Hamilton回路问题,得到Hamilton回路关联矩阵。使用ANT-C模型优化蚁群算法,分析目标回路的时间复杂性与空间复杂性,为蚁群算法的应用提供基础,实现完全无向图Hamilton回路求解。实验结果表明,该方法可提升求解速率、缩短求解用时,降低求解速率波动,保证求解结果的准确性。In order to solve the problem of long time and large fluctuation in the current process of solving completely undirected graph Hamilton circuit,an improved Ant colony optimization algorithms based method for solving completely undirected graph Hamilton circuit is proposed.Describe the Hamiltonian circuit problem of completely undirected graphs and obtain the Hamiltonian circuit correlation matrix.Use the ANT-C model to optimize the Ant colony optimization algorithms,analyze the time complexity and space complexity ofthetarget circuit,provideabasisfortheapplication of Ant colonyoptimization algorithms,and realize thesolution of completely undirected Hamiltonian circuit.The experimental results show that this method can improve the solving speed,shorten the solving time,reduce the fluctuation of the solving rate,and ensure the accuracy of the solving results.

关 键 词：哈密尔顿回路 回路关联矩阵 改进蚁群算法 完全无向图 

分 类 号：TP399[自动化与计算机技术—计算机应用技术]