摘要
本文参考了蚂蚁算法的建模方面初期文献,以及相关的部分原始实验数据,总结了蚂蚁算法的建模和收敛性方面的一些重要特性,探讨了一些重要的建模因素对于算法收敛到最优解的影响,特别是对于,ρ,α在算法中的影响作了一些初步的分析和总结,对于同类算法的深入研究和变种算法的实际应用都具有关键的指导意义。
This paper has reference to some early literature on theory model of ACO and some conrelative experimental data, summarize the important property of the model and the convergence of the model, research on some important facters that can influence the arithmetic convergence to mininum cost paths speeically. This paper gives the discussion of parameter of ρ,α. The disscussion results will help the theory research and the practical application.
关键词
蚁群算法
组合优化
最短路径
收敛性
ant colony optimization
combinatorial optimization
minimum cos paths, convergence
