摘要
蚁群算法作为一种新的生物进化算法,具有并行、正反馈和启发式搜索等特点,但它与其它进化算法同样存在易于陷入局部最小点等缺陷。为了克服这些缺陷,介绍了一种改进的蚁群算法来求解旅行Agent问题,解决移动Agent为完成用户指定任务,在不同主机间移动时的迁移策略问题。实验结果表明了算法的可行性。
Ant colony algorithm is a new evolutionary algorithm, has the characteristic of parallelism, positive feedback, heuristic search, but it has the limitation of stagnation like other evolutionary algorithms. To avoid the limitation, an improved ant colony optimization algorithm is introduced to solve the traveling agent problem,which is responsible for planning out an optimal migration strategy when agents migrate to several hosts for accomplishing its task. The experimental result shows that the algorithm is effective.
出处
《计算机技术与发展》
2006年第7期233-235,共3页
Computer Technology and Development
关键词
蚁群算法
迁移策略
旅行AGENT问题
ant colony algorithm
migration strategy
traveling agent problem
