An Improved Hybrid Discrete Particle Swarm Optimization Algorithm to Solve the TSP Problem

摘要

Through investigating the issue of solving the TSP problem by discrete particle swarm optimization algorithm, this study finds a new discrete particle swarm optimization algorithm (NDPSO), which is easy to combine with other algorithm and has fast convergence and high accuracy, by introducing the thought of the greedy algorithm and GA algorithm and refining the discrete particle swarm optimization algorithm. And then the study expands NDPSO by Simulated Annealing algorithm and proposes a hybrid discrete particle swarm optimization algorithm (HDPSO). At last, the experiments prove that these two algorithms both have good convergence, but the HDPSO has a better capacity to find the best solution.