Solution to Traveling Agent Problem Based on Improved Ant Colony Algorithm

Traveling agent problem solves the problem of planning out an optimal migration path when agents migrate to several hosts, which is a complex combinatorial optimization problem. In this paper, an improved ant colony algorithm is presented. A mutation operator is introduced and the local and global updating rules of pheromone are modified on the basis of ant colony algorithm. The algorithm greatly decreases the possibility of falling into stagnation due to arriving at local minimum. The results show that mobile agent can accomplish the computing task with higher efficiency and shorter time.