关键词: 旅行商问题, 蚁群算法, 贪心算法, 变异算子, 参数优化

Abstract: Aiming at the Traveling Salesman Problem (TSP),an improved 2-opt and ant colony hybrid algorithm were improved.The greedy algorithm and mutation operator were introduced to solve the problem of high pheromone concentration on the local optimal solution path as the number of iterations increase,which avoided the imbalance of the influence of pheromone concentration and node distance on the state transition probability in the later stage of the algorithm.Also,the diversity of the path was increased,and new ideas were put forward to solve the problem that the ant colony algorithm converged easily to the local optimal solution.Finally,the differential evolution algorithm was used to optimize the algorithm parameters.

Key words: traveling salesman problem, ant colony algorithm, greedy algorithm, mutation operator, parameter optimization