Ant colony optimization algorithm is a kind of heuristic algorithm, which has been widely applied to solve the problem such as TSP (traveling salesman problem). This paper uses the proximity to construct the optimal s...
详细信息
Ant colony optimization algorithm is a kind of heuristic algorithm, which has been widely applied to solve the problem such as TSP (traveling salesman problem). This paper uses the proximity to construct the optimal search library. Based on the idea, an improved ant colony optimization algorithm is put forward. We also define the new heuristic information and the improved pheromone update rules. Thus an improved ant colony optimization algorithm is put forward that provides a better solution to the combinatorial optimization of MTSP (multiple traveling salesman problem) problem with E-mail traffic constraints.
暂无评论