A New Multi-ant Colony Optimization Algorithm

摘要

This paper introduces the basic ant colony algorithm, the model and its problems in the process of solving the TSP. Because the basic ant colony algorithm to search for to a certain extent, all individuals found the same solutions n in exactly, it can not search the solution space in further, it is not conducive to find better solutions. For the shortcomings of the algorithm, we present a new ant colony algorithm, the new multiple-ant colony algorithm for solving problems; it searches the solution space using a different population, in order to avoid local optimum to obtain the global optimum. Simulation results show that the algorithm in solving TSP problems than other algorithms more efficient, have good practical value.