CAJ | 학술논문

利用蚁群算法来求解TAP问题是解决移动Agent迁移策略的一种有效途径.旅行Agent问题是复杂的组合优化问题,蚁群算法作为一种新的生物进化算法,具有并行、正反馈和启发式搜索等特点,适合求解NP难问题.在蚁群算法的基础上,提出分泌多种信息素的改进蚁群算法来求解旅行Agent问题,动态反应了节点服务能力和网络负载的变化,使迁移更具有灵活性.实验结果表明了该文算法的可行性.
이용의군산법래구해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 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.