节点文献
改进的蚁群算法在求解旅行Agent问题中的应用
Application of Improved Ant Colony Optimization Algorithm to Solve Traveling Agent Problem
【摘要】 蚁群算法作为一种新的生物进化算法,具有并行、正反馈和启发式搜索等特点,但它与其它进化算法同样存在易于陷入局部最小点等缺陷。为了克服这些缺陷,介绍了一种改进的蚁群算法来求解旅行Agent问题,解决移动Agent为完成用户指定任务,在不同主机间移动时的迁移策略问题。实验结果表明了算法的可行性。
【Abstract】 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.
【关键词】 蚁群算法;
迁移策略;
旅行Agent问题;
【Key words】 ant colony algorithm; migration strategy; traveling agent problem;
【Key words】 ant colony algorithm; migration strategy; traveling agent problem;
- 【文献出处】 计算机技术与发展 ,Computer Technology and Development , 编辑部邮箱 ,2006年07期
- 【分类号】TP301.6
- 【被引频次】9
- 【下载频次】102