摘要
在基本蚁群算法的基础上,提出了一类改进的蚂蚁算法,并证明了当算法迭代次数n充分大时,对于任意小ε>0,算法至少一次找到最优解的概率P*(n)≥1-ε,当n→∞时,P*(n)→1.数值实验表明,改进的算法在取得满意搜索结果的同时,能减少算法的计算量.
Based on ant colony algorithm, an improved ant colony algorithm was presented, and it was proved that for a sufficiently large number of iterations n and arbitrarily infinitesimal constant ε〉0, the probability of finding an optimal solution for at least once is P^＊（n）≥1-ε and that this probability tends to 1 for n→∞. The experimental results showed that the improved ACS can reduce computation labor and is effective.
出处
《兰州理工大学学报》
CAS
北大核心
2006年第2期82-85,共4页
Journal of Lanzhou University of Technology
关键词
蚁群算法
信息素
旅行商问题
背包问题
ant colony algorithm
pheromone
traveling salesman problem
knapsack problem
