Hybrid Particle Swarm Optimization Algorithm Merging Simulated Annealing and Mountain-Climb Searching
2014 ◽
Vol 651-653
◽
pp. 2159-2163
Keyword(s):
To solve the problem of standard particle swarm optimization (PSO) easy turn to premature convergence and poor ability in local search, this paper present a hybrid particle swarm optimization algorithm merging simulated annealing (SA) and mountain-climb. During the running time, the algorithm use the pso to find the global optimal position quickly, take advantage of the Gaussian mutation and mountain-climb strategy to enhance local search ability, and combine with SA to strengthen the population diversity to enable particles to escape from local minima. Test results on several typical test functions show that this new algorithm has a significant improve in searching ability and effectively overcome the premature convergence problem.
2012 ◽
Vol 3
◽
pp. 1-14
◽
2018 ◽
Vol 34
(2)
◽
pp. 955-964
◽
2016 ◽
Vol 3
(12)
◽
pp. 96-105