摘要
蚂蚁算法是一种解决组合优化问题的有效算法,该算法已得到日益深入的研究,并逐渐得到应用.但蚂蚁算法的一个不足是,算法参数的设置凭借经验,没有充足的依据.本文对蚂蚁算法中各参数与算法收敛之间的关系进行了深入研究和分析,给出了参数与迭代次数之间的函数关系.应用此函数来确定蚂蚁算法参数,求解经典TSP Benchmark问题,运算结果比参数分段法更优.
Ant Algorithm is an effect way to solve the problem of combination optimization, it also has been researched deeply and used widely. But the deficiency of Ant Algorithm is that the parameters are set by experience without sufficient evidence. In this paper, it is analyzed that convergence of Ant Algorithm is affected by the value of parameters. The relationship between the parameters and iterative count is proposed. A classical TSP Benchmark is solved..
出处
《小型微型计算机系统》
CSCD
北大核心
2007年第11期1985-1987,共3页
Journal of Chinese Computer Systems
关键词
蚂蚁算法
算法参数
TSP
ant algorithm
parameters of algorithm
TSP
