CAJ | 학술논문

为了解决传统蚁群算法解决TSP问题时收敛速度慢、易陷入局部最优的问题，提出了一种名为FENA2O的改进蚁群算法。通过寻找并更新精英蚂蚁行走路径来提高收敛速度，通过规定蚂蚁数量来降低陷入局部最优的可能，配合2- Opt算法进一步优化所得路径。实验结果表明，算法改进后的收敛速度得到了较大提高，并能够有效解决局部最优。
위료해결전통의군산법해결TSP문제시수렴속도만、역함입국부최우적문제，제출료일충명위FENA2O적개진의군산법。통과심조병경신정영마의행주로경래제고수렴속도，통과규정마의수량래강저함입국부최우적가능，배합2- Opt산법진일보우화소득로경。실험결과표명，산법개진후적수렴속도득도료교대제고，병능구유효해결국부최우。
To soIve probIem that the traditionaI ant coIony aIgorithm converged sIowIy and its standstiI search came up easiIy when soIving the TSP. A noveI aIgorithm for improved ant coIony aIgorithm caI ed Find EIites in N Ants with 2-Optimization (FENA2O) was proposed. Increasing convergence speed by finding and updating information in the paths of eIite ants. Reducing the possibiIity of obtaining IocaI optimization by set ing the number of ants. And then a further optimization was made to the obtained route by using 2-Opt aIgorithm. The experimentaI resuIts showed that the convergence speed of the improved aIgorithm had been rapidIy deveIoped and IocaI optimization couId be soIved ef ectiveIy.