计算机工程与应用2009，Vol.45Issue(32)：83-85,3.DOI:10.3778/j.issn.1002-8331.2009.32.026
改进蚁群算法求解旅行Agent问题
Improved ant colony algorithm for traveling Agent problem
苏克军 1熊选东 1杨斌1
作者信息
- 1. 解放军信息工程大学,电子技术学院,郑州,450004
- 折叠
摘要
Abstract
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 nondeterministic 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 resultsthat agent's migration is more agile.The experimental result shows that the algorithm is effective.关键词
移动Agent/蚁群算法/迁移策略Key words
mobile Agent/ant colony algorithm/migration strategy分类
信息技术与安全科学引用本文复制引用
苏克军,熊选东,杨斌..改进蚁群算法求解旅行Agent问题[J].计算机工程与应用,2009,45(32):83-85,3.
