126 The Research on Path Planning for Mobile Agent Migration Based on Ant Colony Algorithm

This paper first analyzes the travel agent questions (Travelling Agent Problem, TAP), and that it is a class of complex combinatorial optimization problems, mobile agent migration path planning is the most classic problems; Second, for ant colony algorithm to solve such problems requires a longer search time and ease into a local minimum shortcomings, the introduction of genetic algorithms and ant colony algorithm for global and local updating rules to improve, greatly reducing the travel agent ant colony algorithm to solve problems in the local minimum and cause the system to the possibility of stagnation; Finally, through simulation experiments verify the validity of the proposed algorithm.