4.7 Article

Modified particle swarm optimization algorithm with simulated annealing behavior and its numerical verification

Journal

APPLIED MATHEMATICS AND COMPUTATION
Volume 218, Issue 8, Pages 4365-4383

Publisher

ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2011.10.012

Keywords

Simulated annealing; Particle swarm optimization; Heuristic search; Metropolis process; Elite reserve

Ask authors/readers for more resources

The hybrid algorithm that combined particle swarm optimization with simulated annealing behavior (SA-PSO) is proposed in this paper. The SA-PSO algorithm takes both of the advantages of good solution quality in simulated annealing and fast searching ability in particle swarm optimization. As stochastic optimization algorithms are sensitive to their parameters, proper procedure for parameters selection is introduced in this paper to improve solution quality. To verify the usability and effectiveness of the proposed algorithm, simulations are performed using 20 different mathematical optimization functions with different dimensions. The comparative works have also been conducted among different algorithms under the criteria of quality of the solution, the efficiency of searching for the solution and the convergence characteristics. According to the results, the SA-PSO could have higher efficiency, better quality and faster convergence speed than compared algorithms. (C) 2011 Elsevier Inc. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available