Ant Colony Algorithm Based on Path Planning for Mobile Agent Migration

Analysis of 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 in need long 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 caused by the system into a local minimum stagnation phenomenon may be; Finally, through simulation experiments verify the validity of the proposed algorithm.