期刊文献+

基于二分法和控制信息素量的改进蚁群算法 被引量:3

Improved ant colony optimization based on dichotomy and pheromone control
下载PDF
导出
摘要 为弥补蚁群算法易陷入局部最优、收敛速度较慢等不足,提出一种基于二分法和控制信息素量的改进蚁群算法。在每次迭代结束时,利用二分法放弃行走路程较远的半数蚁群的信息素,使收敛速度得到提高;利用3-opt局部优化方法提高解的精度;通过控制信息素量动态调整蚁群选择路径的概率,避免算法早熟;将改进的算法应用于旅行商问题。实验结果表明,该算法在寻优能力、可靠性、收敛速度以及稳定性方面均表现出明显的优越性。 With the purpose of improving the insufficient ant colony optimization algorithm,including easiness to sink into local optimization and low convergence speed,an improved algorithm based on dichotomy and controlling the amount of pheromone was proposed.The dichotomy was introduced into the iterative process,and the ant pheromone on the inferior path in the last half of each iteration was discarded to accelerate the convergence speed of the algorithm.The 3-opt local optimization was used to improve the accuracy of the solution.The path selection probability of ants was dynamically adjusted by controlling pheromone quantity to avoid premature algorithm.The improved method was applied to the traveling salesman problem.Experimental results show that the proposed method has significant superiorities in optimization ability,reliability,convergence speed and stability.
作者 王文丰 余澜婷 刘哲 牛成钢 许幸满 韩龙哲 WANG Wen-feng;YU Lan-ting;LIU Zhe;NIU Cheng-gang;XU Xing-man;HAN Long-zhe(School of Information Engineering,Nanchang Institute of Technology,Nanchang 330099,China;Jiangxi Province Key Lab of Water Information Cooperative Sensing and Intelligent Processing,Nanchang Institute of Technology,Nanchang 330099,China)
出处 《计算机工程与设计》 北大核心 2023年第3期784-790,共7页 Computer Engineering and Design
基金 国家自然科学基金项目(61962036、61561035) 江西省科技落地计划基金项目(KJLD13095)。
关键词 二分法 信息素量 k-opt局部优化 旅行商问题 蚁群算法 最短路径 遍历 群智能算法 dichotomy pheromone k-opt local optimization travelling salesman problem ant colony optimization shortest path traverse swarm intelligence algorithm
  • 相关文献

参考文献13

二级参考文献109

共引文献209

同被引文献35

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部