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

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

0.00 Avg rating0 Votes
Article ID: iaor201111924
Volume: 218
Issue: 8
Start Page Number: 4365
End Page Number: 4383
Publication Date: Dec 2011
Journal: Applied Mathematics and Computation
Authors: , ,
Keywords: optimization: simulated annealing, heuristics
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.