Hybrid Discrete Particle Swarm Optimizer Algorithm for Traveling Salesman Problem
PSO has been widely used in continuous optimization problems, but in discrete domain the research and application is very little. By redefining the position and speed of particles and related operations, the discrete particle swarm algorithm can be constructed. Due to the weak capacity of local search of PSO and be easy to constringe the local optimum, it is combined with simulated annealing and the hybrid discrete PSO is constructed using the characteristics that simulated annealing can accept some ungraded solution under the control of certain probability,finally the algorithm is applied to solving the traveling salesman problem successfully. The simulation results show that the hybrid discrete PSO can get better optimization effect, which validates the effectiveness of the method.
Cai Suo Zhang
H. L. Wu et al., "Hybrid Discrete Particle Swarm Optimizer Algorithm for Traveling Salesman Problem", Advanced Materials Research, Vols. 433-440, pp. 4526-4529, 2012