摘要
阐述了蚁群算法的基本原理,根据求解TSP问题的蚁群系统模型及转移概率公式,修改了蚁群算法模型,给出了适用于0/1背包问题的模型.通过实验测试改进的算法,结果表明,改进算法的收敛速度得到提高.
In this paper, the primary principle of ant algorithm and the model of ant colony system based on the Traveling Salesman Problem are illustrated, as well as the transfer formula. In order to handle the 0/1 Knapsack Problem, the model of ant algorithm is revised. By using the computer to test the modified algorithm, the results prove that convergence speed of the modified algorithm is very high.
出处
《大庆石油学院学报》
CAS
北大核心
2005年第3期59-62,125,共5页
Journal of Daqing Petroleum Institute
关键词
蚁群算法
信息素
背包问题
禁忌表
标识表
ant algorithm
pheromone
knapsack problem
tabu table
flag table
