Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 30135
Optimized Algorithm for Particle Swarm Optimization

Authors: Fuzhang Zhao

Abstract:

Particle swarm optimization (PSO) is becoming one of the most important swarm intelligent paradigms for solving global optimization problems. Although some progress has been made to improve PSO algorithms over the last two decades, additional work is still needed to balance parameters to achieve better numerical properties of accuracy, efficiency, and stability. In the optimal PSO algorithm, the optimal weightings of (√ 5 − 1)/2 and (3 − √5)/2 are used for the cognitive factor and the social factor, respectively. By the same token, the same optimal weightings have been applied for intensification searches and diversification searches, respectively. Perturbation and constriction effects are optimally balanced. Simulations of the de Jong, the Rosenbrock, and the Griewank functions show that the optimal PSO algorithm indeed achieves better numerical properties and outperforms the canonical PSO algorithm.

Keywords: Diversification search, intensification search, optimal weighting, particle swarm optimization.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1112117

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1550

References:


[1] J. Kennedy and R. C. Eberhart, “Particle Swarm Optimization,” in Proc. IEEE Int. Conf. Neural Networks, Perth, Australia, Nov. 1995, pp. 1942–1948.
[2] R. C. Eberhart and J. Kennedy, “A New Optimizer Using Particle Swarm Theory,” in Proc. 6th Int. Symp. Micromachine Human Science, Nagoya, Japan, Oct. 1995, pp. 39–43.
[3] J. Kennedy, R. C. Eberhart, and Y. Shi, Swarm Intelligence. San Francisco, CA: Morgan Kaufmann, 2001.
[4] Y. Shi and R. C. Eberhart, “A Modified Particle Swarm Optimizer,” in Proc. IEEE Inter. Conf. Evol. Comput., Anchorage, AK, May 1998, pp. 69–73.
[5] M. Clerc and J. Kennedy, “The Particle Swarm–Explosion, Stability, and Convergence in a Multidimensional Complex Space,” IEEE Trans. Evol. Comput., vol. 6, no. 1, pp. 58–73, Feb. 2002.
[6] R. Poli, J. Kennedy, and T. Blackwell, “Particle swarm optimization–An overview,” Swarm Intell., vol. 1, no. 1, pp. 33–57, Aug. 2007.
[7] K. E. Parsopoulos and M. N. Vrahatis, “Recent Approaches to Global Optimization Problems through Particle Swarm Optimization,” Nat. Comput., vol. 1, no. 2-3, pp. 235–306, Jun. 2002.
[8] A. Banks, J. Vincent, and C. Anyakoha, “A Review of Particle Swarm Optimization. Part I: Background and Development,” Nat. Comput., vol. 6, no. 4, pp. 467–484, Dec. 2007.
[9] A. Banks, J. Vincent, and C. Anyakoha, “A Review of Particle Swarm Optimization. Part II: Hybridisation, Combinatorial, Multicriteria and Constrained Optimization, and Indicative Applications,” Nat. Comput., vol. 7, no. 1, pp. 109–124, Mar. 2008.
[10] Y. Valle, G. K. Venayagamoorthy, S. Mohagheghi, J.-C. Hernandez, and R. G. Harley, “Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems,” IEEE Trans. Evol. Comput., vol. 12, no. 2, pp. 171–195, Apr. 2008.