改进蚁群算法求解旅行Agent问题  

Improved ant colony algorithm for traveling Agent problem

作　　者：苏克军[1] 熊选东[1] 杨斌[1] 

机构地区：[1]解放军信息工程大学电子技术学院,郑州450004

出　　处：《计算机工程与应用》2009年第32期83-85,共3页Computer Engineering and Applications

摘　　要：利用蚁群算法来求解TAP问题是解决移动Agent迁移策略的一种有效途径。旅行Agent问题是复杂的组合优化问题,蚁群算法作为一种新的生物进化算法,具有并行、正反馈和启发式搜索等特点,适合求解NP难问题。在蚁群算法的基础上,提出分泌多种信息素的改进蚁群算法来求解旅行Agent问题,动态反应了节点服务能力和网络负载的变化,使迁移更具有灵活性。实验结果表明了该文算法的可行性。Using ant colony system to solve the traveling agent problem is an effective approach to resolve mobile agent migration strategy.The traveling agent problem is a complex combinatorial optimization problem.Ant colony algorithm suits to solve non- deterministic polynomial problem,as it is a new evolutionary algorithm,has the characteristics of parallelism,positive feedback and heuristic search.An improved ant colony algorithm on the basis of ant colony system to solve the traveling agent problem is presented.Ants secrete multi-pheromones to reflect the change of host＇s service ability and network load dynamically with the results that agent＇s migration is more agile.The experimental result shows that the algorithm is effective.

关 键 词：移动AGENT 蚁群算法 迁移策略 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]