Adaptive fuzzy particle swarm optimization for global optimization of multimodal functions. (English) Zbl 1242.68288

Summary: This paper proposes an adaptive fuzzy PSO (AFPSO) algorithm, based on the standard particle swarm optimization (SPSO) algorithm. The proposed AFPSO utilizes fuzzy set theory to adjust PSO acceleration coefficients adaptively, and is thereby able to improve the accuracy and efficiency of searches. Incorporating this algorithm with quadratic interpolation and crossover operator further enhances the global searching capability to form a new variant, called AFPSO-QI. We compared the proposed AFPSO and its variant AFPSO-QI with SPSO, quadratic interpolation PSO (QIPSO), unified PSO (UPSO), fully informed particle swarm (FIPS), dynamic multi-swarm PSO (DMSPSO), and comprehensive learning PSO (CLPSO) across sixteen benchmark functions. The proposed algorithms performed well when applied to minimization problems for most of the multimodal functions considered.


68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68T05 Learning and adaptive systems in artificial intelligence
90C59 Approximation methods and heuristics in mathematical programming


CEC 05
Full Text: DOI


[2] Du, W.; Li, B., Multi-strategy ensemble particle swarm optimization for dynamic optimization, Information Sciences, 178, 15, 3096-3109 (2008) · Zbl 1283.90047
[3] Hsieh, S. T.; Sun, T. Y.; Liu, C. C.; Tsai, S. J., Efficient population utilization strategy for particle swarm optimizer, IEEE Transactions on Systems, Man, and Cybernetics, Part B, 39, 2, 444-456 (2009)
[4] Iwasaki, N.; Yasuda, K.; Ueno, G., Dynamic parameter tuning of particle swarm optimization, IEEJ Transactions on Electrical and Electronic Engineering, 1, 353-363 (2006)
[6] Kennedy, J.; Eberhart, R.; Shi, Y., Swarm Intelligence (2001), Morgan Kaufmann: Morgan Kaufmann California
[7] Liang, J. J.; Qin, A. K.; Suganthan, P. N.; Baskar, S., Comprehensive learning particle swarm optimizer for global optimization of multimodal functions, IEEE Transactions on Evolutionary Computation, 10, 3, 281-296 (2006)
[10] Mendes, R.; Kennedy, J.; Neves, J., The fully informed particle swarm: simpler, maybe better, IEEE Transactions on Evolutionary Computation, 8, 3, 204-210 (2004)
[17] Parsopoulos, K. E.; Vrahatis, M. N., On the computation of all global minimizers through particle swarm optimization, IEEE Transactions on Evolutionary Computation, 8, 3, 211-224 (2004)
[19] Salomon, R., Reevaluating genetic algorithm performance under coordinate rotation of benchmark functions, BioSystems, 39, 3, 263-278 (1996)
[22] Wang, Y.; Yang, Y., Particle swarm optimization with preference order ranking for multi-objective optimization, Information Sciences, 179, 12, 1944-1959 (2009)
[23] Yao, X.; Liu, Y.; Lin, G., Evolutionary programming made faster, IEEE Transactions on Evolutionary Computation, 3, 2, 82-102 (1999)
[24] Zhang, G.; Jiang, J.; Su, Z.; Qi, M.; Fang, H., Searching for overlapping coalitions in multiple virtual organizations, Information Sciences, 180, 17, 3140-3156 (2010)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.