改进粒子群算法求解TSP问题

Solving TSP problem, with particle swarm optimization, iteration of the particles, the speed could not simply adopt continuous algorithm to calculate. By constructing insertion element, to define insertion sequence, speed algorithm was established. To prevent algorithm falls into local optimum, and to increase the speed of searching optimization, combined with the local optimization operator and the heuristic mutation operator were given. In the end, Simulation testing was designed. The experimental results showed the effectiveness of the algorithm.