Abstract: The problem of mobile Agent is mainly to solve the problem of planning out an optimal migration path according to the tasks and other restrictions when agents migrate to several hosts.Ant colony algorithm is a new evolutionary algorithm and extremely suitable to solve the mobile agent problem，which has the characteristic of parallelism，positive feedback and heuristic search，but it has shortcomings such as needing much time and easier occurring of stagnation behavior.Complex networks theory is a new kind of theory.It finds that some reality network has new character.In order to describe this new network architecture，it introduces some new characteristics measures，and the “degree” of the node is one of the characteristics measures.On the basis of ant algorithm，this paper adds the parameter of degree into state transfer rules，meanwhile，uses adapt adjust information element hangover coefficient to improve the capability of the arithmetic.The algorithm can solve the mobile agent problem.The results show that mobile agent is able to choose optimal efficiency and the shortest possible time to complete the migration.

Key words: mobile agent, ant colony algorithm, complex networks

摘要： 移动Agent问题主要是解决移动Agent在不同主机间移动时如何根据移动Agent的任务和其他约束条件来规划最优的迁移路线。蚁群算法是一种新的生物进化算法，具有并行、正反馈和启发式搜索等特点，是一种解决旅行Agent问题的有效手段，但同时也存在一些缺点，如运算过程中收敛速度慢，易出现停滞现象等。复杂网络理论是一个新兴的理论，它发现现实的网络具有新的特性，为了刻画这一新的网络结构，引入了新的特征度量，节点的“度”就是其中一个。在蚁群算法的基础上，在状态转移规则等中加入度这一系数，同时自适应调整挥发系数ρ来提高算法的性能。将该算法用于移动Agent问题，模拟计算结果显示移动Agent在移动时能以最优的效率和最短的时间来完成迁移。

关键词: 移动Agent, 蚁群算法, 复杂网络