生日攻击研究下的蚁群算法优化  

Ant Colony Algorithm Optimization Based on Birthday Attack Research

作　　者：郑凯[1] ZHENG Kai(Lanzhou University of Technology,Lanzhou Gansu 730000,China)

机构地区：[1]兰州理工大学,甘肃兰州730000

出　　处：《信息与电脑》2021年第23期90-94,共5页Information & Computer

摘　　要：针对传统蚁群算法受启发因子影响大、随机性弱、收敛速度慢以及易产出局部最优解等问题,提出了基于生日攻击思想的优化蚁群算法。生日攻击源于密码学中的哈希函数碰撞,在生日攻击的思想下,将传统算法的整个迭代过程分割为多个子过程,统计每个子过程产出的最优路径,选择所有子过程中的最小值作为最优路径,并将其最终结果与传统蚁群算法和其他优化蚁群算法的产出结果进行定量分析。模拟结果说明,生日攻击思想下的优化蚁群算法最优路径的收敛效率较传统蚁群算法和其他优化算法有明显提升,最优路径产出的精确性与可信度得到提升,同时产出全局最优解的概率提高。Aiming at the problems of traditional ant colony algorithm which is heavily influenced by heuristic factors, weak randomness, slow convergence speed and easy to produce local optimal solutions, an optimized ant colony algorithm based on birthday attack idea is proposed. The birthday attack originates from the collision of hash functions in cryptography. Under the idea of birthday attack, the entire iterative process of the traditional algorithm is divided into multiple sub-processes, the optimal path produced by each sub-process is counted, and all sub-processes are selected. The minimum value is taken as the optimal path, and the final result is quantitatively analyzed with the output results of traditional ant colony algorithm and other optimized ant colony algorithm. The simulation results show that the optimal path convergence efficiency of the optimized ant colony algorithm under the birthday attack idea is significantly improved compared with the traditional ant colony algorithm and other optimization algorithms. The accuracy and credibility of the optimal path output is improved, and the output is also improved. The probability of the global optimal solution increases.

关 键 词：生日问题 优化蚁群算法 最优路径 收敛效率 

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