基于混合粒子群算法求解TSP问题

遗传算法是研究TSP问题中最为广泛的一种算法，它具有全局搜索的能力。而粒子群算法收敛速度较快，但容易造成局部最优的情况。本文基于遗传算法的交叉变异设计了混合粒子群算法，通过对TSP问题求解分析，证实该方法提高了标准粒子群的搜索能力，获得了较高的收敛速度和近似最优解。

Hybrid particle swarm optimization algorithm for solving TSP problem

Genetic algorithm is the most widely used one in the research of TSP problem.It has the ability of global search.But the particle swarm algorithm converges quickly,but it is easy to cause the local optimum.The genetic algorithm crossover and mutation based on design hybrid particle swarm optimization algorithm,through the analysis to solve traveling salesman problem(TSP),confirmed that the method improves the search ability of standard particle swarm optimization,higher speed of convergence and approximate optimal solution is obtained.