Abstract:

Traveling agent problem is a complex and combinatorial optimization problem, which solves the problem of finding an optimal path when an agent migrates to several hosts. An improved ant colony algorithm is presented. A mutation operator is introduced. The local and global updating rules of pheromone are modified on the basis of ant colony algorithm with which the possibility of halting the ant system becomes much lower than the ever in the time arriving at local minimum. Experiment shows that the mobile agents can accomplish the computing tasks with much higher efficiency and in a shorter time.

Key words: ant colony algorithm, mobile agent, traveling agent problem(TAP), pheromone