Discrete particle swarm optimization for TSP based on neighborhood

作者：Fan Huilian^*

来源：Journal of Computational Information Systems, 2010, 6(10): 3407-3414.

• Adaptive noise
• Continuous optimization problems
• Convergent speed
• Crossover
• Discrete particle swarm optimization
• Discrete variables
• High dimensional data
• Kinetic equations
• Optimal solutions
• Particle Swam Optimization
• Particle swarm
• Particle swarm optimization algorithm
• Reverse
• Search performance

Particle swarm optimization (PSO) is a kind of evolutionary algorithm to find optimal solutions for continuous optimization problems. Updating kinetic equations for particle swarm optimization algorithm are improved to solve traveling salesman problem (TSP) based on problem characteristics and discrete variable. Those strategies which are named heuristic factor, reversion mutant and adaptive noise factor, are designed and combined into a new hybrid discrete particle swam optimization algorithms. Experiments on low and high-dimensional data in TSPLIB show that, comparing with other hybrid discrete particle swarm (DPSO), the proposed algorithm can improve the search performance significantly no matter in convergent speed or precision.

• 出版日期2010
• 单位长江师范学院