Hybrid Particle Swarm-Based-Simulated Annealing Optimization Techniques

Particle swarm optimization (PSO) algorithms recently invented as intelligent optimizers with several highly desirable attributes. In this paper, two new hybrid particle swam optimization schemes are proposed. The proposed hybrid algorithms are based on using the particle swarm optimization techniques in conjunction with the simulated annealing (SA) approach. By simulating three different test functions, it is shown how the proposed hybrid algorithms offer the capability of converging toward the global minimum or maximum points. More importantly, the simulation results indicate that the proposed hybrid particle swarm-based simulated annealing approaches have much superior convergence characteristics than the previously developed PSO methods