Hybrid Particle Swarm Optimization Algorithm for Solving Complex TSP
Zhu Yingyin · Light Industry Machinery · 2015
A hybrid particle swarm optimization algorithm for solving TSP was proposed in this paper. The particle swarm optimization was combined with genetic algorithm because it was premature convergence and easily fell into local optimum solution for solving combinatorial optimization. The crossover and mutation operation in genetic algorithm was introduced into the particle swarm optimization. Increased the diversity of swarm by crossover and mutation between individual extremum and global extremum,avoided particles falling into local optimum and improved the local search ability of algorithm. The experiments show that the hybrid particle swarm optimization is effective to solve the TSP.