AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (2.3 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

Evolutionary Experience-Driven Particle Swarm Optimization with Dynamic Searching

School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou 341000, China
Khomeini Shahr Branch, Islamic Azad University, Isfahan 86145-311, Iran
Show Author Information

Abstract

Particle swarm optimization (PSO) algorithms have been successfully used for various complex optimization problems. However, balancing the diversity and convergence is still a problem that requires continuous research. Therefore, an evolutionary experience-driven particle swarm optimization with dynamic searching (EEDSPSO) is proposed in this paper. For purpose of extracting the effective information during population evolution, an adaptive framework of evolutionary experience is presented. And based on this framework, an experience-based neighborhood topology adjustment (ENT) is used to control the size of the neighborhood range, thereby effectively keeping the diversity of population. Meanwhile, experience-based elite archive mechanism (EEA) adjusts the weights of elite particles in the late evolutionary stage, thus enhancing the convergence of the algorithm. In addition, a Gaussian crisscross learning strategy (GCL) adopts cross-learning method to further balance the diversity and convergence. Finally, extensive experiments use the CEC2013 and CEC2017. The experiment results show that EEDSPSO outperforms current excellent PSO variants.

References

[1]
J. Kennedy, Swarm intelligence, in Handbook of Nature-Inspired and Innovative Computing, A. Y. Zomaya, ed. New York, NY, USA: Springer, 2006, pp. 187–219.
[2]
R. Eberhart and J. Kennedy, A new optimizer using particle swarm theory, in Proc. Sixth Int. Symp. Micro Machine and Human Science, Nagoya, Japan, 1995, pp. 39–43.
[3]

W. Li, Y. Chen, Q. Cai, C. Wang, Y. Huang, and S. Mahmoodi, Dual-stage hybrid learning particle swarm optimization algorithm for global optimization problems, Complex System Modeling and Simulation, vol. 2, no. 4, pp. 288–306, 2022.

[4]

D. Karaboga and B. Basturk, A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm, J. Glob. Optim., vol. 39, no. 3, pp. 459–471, 2007.

[5]

S. Xiao, H. Wang, W. Wang, Z. Huang, X. Zhou, and M. Xu, Artificial bee colony algorithm based on adaptive neighborhood search and Gaussian perturbation, Appl. Soft Comput., vol. 100, p. 106955, 2021.

[6]

R. Storn and K. Price, Differential evolution—A simple and efficient heuristic for global optimization over continuous spaces, J. Global Optimization, vol. 11, no. 4, pp. 341–359, 1997.

[7]

W. Li, X. Ye, Y. Huang, and S. Mahmoodi, Adaptive dimensional learning with a tolerance framework for the differential evolution algorithm, Complex System Modeling and Simulation, vol. 2, no. 1, pp. 59–77, 2022.

[8]

A. Slowik and H. Kwasnicka, Nature inspired methods and their industry applications—Swarm intelligence algorithms, IEEE Trans. Ind. Inform., vol. 14, no. 3, pp. 1004–1015, 2018.

[9]

T. Kerdphol, K. Fuji, Y. Mitani, M. Watanabe, and Y. Qudaih, Optimization of a battery energy storage system using particle swarm optimization for stand-alone microgrids, Int. J. Electr. Power Energy Syst., vol. 81, pp. 32–39, 2016.

[10]

K. Mahadevan and P. S. Kannan, Comprehensive learning particle swarm optimization for reactive power dispatch, Appl. Soft Comput., vol. 10, no. 2, pp. 641–652, 2010.

[11]

A. N. Hussain, A. A. Abdullah, and O. M. Neda, Modified particle swarm optimization for solution of reactive power dispatch, Res. J. Appl. Sci. Eng. Technol., vol. 15, no. 8, pp. 316–327, 2018.

[12]

X. -B. Wang, Z. -X. Yang, and X. -A. Yan, Novel particle swarm optimization-based variational mode decomposition method for the fault diagnosis of complex rotating machinery, IEEE/ASME Trans. Mechatron., vol. 23, no. 1, pp. 68–79, 2018.

[13]

H. Chen, D. L. Fan, L. Fang, W. Huang, J. Huang, C. Cao, L. Yang, Y. He, and L. Zeng, Particle swarm optimization algorithm with mutation operator for particle filter noise reduction in mechanical fault diagnosis, Int. J. Patt. Recogn. Artif. Intell., vol. 34, no. 10, p. 2058012, 2020.

[14]
Y. -L. Gao, X. -H. An, and J. -M. Liu, A particle swarm optimization algorithm with logarithm decreasing inertia weight and chaos mutation, in Proc. 2008 Int. Conf. Computational Intelligence and Security, Suzhou, China, 2008, pp. 61–65.
[15]
Y. Shi and R. C. Eberhart, Parameter selection in particle swarm optimization, in Proc. 7 th Int. Conf. Evolutionary Programming, San Diego, CA, USA, 1998, pp. 591–600.
[16]

S. -F. Li and C. -Y. Cheng, Particle swarm optimization with fitness adjustment parameters, Comput. Ind. Eng., vol. 113, pp. 831–841, 2017.

[17]

M. Karimi-Nasab, M. Modarres, and S. M. Seyedhoseini, A self-adaptive PSO for joint lot sizing and job shop scheduling with compressible process times, Appl. Soft Comput., vol. 27, pp. 137–147, 2015.

[18]
J. Kennedy and R. Mendes, Population structure and particle swarm performance, in Proc. 2002 Cong. Evolutionary Computation CEC’02 (Cat. No. 02TH8600), Honolulu, HI, USA, 2002, pp. 1671–1676.
[19]
J. Kennedy, Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance, in Proc. 1999 Cong. Evolutionary Computation-CEC99 (Cat. No. 99TH8406), Washington, DC, USA, 1999, pp. 1931–1938.
[20]

Y. Shi, H. Liu, L. Gao, and G. Zhang, Cellular particle swarm optimization, Information Sciences, vol. 181, no. 20, pp. 4460–4493, 2011.

[21]
X. H. Shi, Y. H. Lu, C. G. Zhou, H. P. Lee, W. Z. Lin, and Y. C. Liang, Hybrid evolutionary algorithms based on PSO and GA, in Proc. 2003 Cong. Evolutionary Computation, Canberra, Australia, 2003, pp. 2393–2399.
[22]
B. Yang, Y. Chen, and Z. Zhao, A hybrid evolutionary algorithm by combination of PSO and GA for unconstrained and constrained optimization problems, in Proc. 2007 IEEE Int. Conf. Control and Automation, Guangzhou, China, 2007, pp. 166–170.
[23]

B. Y. Qu, P. N. Suganthan, and S. Das, A distance-based locally informed particle swarm model for multimodal optimization, IEEE Trans. Evol. Comput., vol. 17, no. 3, pp. 387–402, 2013.

[24]

L. Wang, B. Yang, and J. Orchard, Particle swarm optimization using dynamic tournament topology, Appl. Soft Comput., vol. 48, pp. 584–596, 2016.

[25]

W. He, W. Gong, L. Wang, X. Yan, and C. Hu, Fuzzy neighborhood-based differential evolution with orientation for nonlinear equation systems, Knowl. Based Syst., vol. 182, p. 104796, 2019.

[26]

W. Li, B. Sun, Y. Huang, and S. Mahmoodi, Adaptive complex network topology with fitness distance correlation framework for particle swarm optimization, Int. J. Intell. Syst., vol. 37, no. 8, pp. 5217–5247, 2022.

[27]

Y. -H. Zhang, Y. -J. Gong, Y. Gao, H. Wang, and J. Zhang, Parameter-free voronoi neighborhood for evolutionary multimodal optimization, IEEE Trans. Evol. Comput., vol. 24, no. 2, pp. 335–349, 2019.

[28]

W. Li, Y. Sun, Y. Huang, and J. Yi, An adaptive differential evolution algorithm using fitness distance correlation and neighbourhood-based mutation strategy, Connect. Sci., vol. 34, no. 1, pp. 829–856, 2022.

[29]

A. Lin, W. Sun, H. Yu, G. Wu, and H. Tang, Adaptive comprehensive learning particle swarm optimization with cooperative archive, Appl. Soft Comput., vol. 77, pp. 533–546, 2019.

[30]

X. Xia, L. Gui, F. Yu, H. Wu, B. Wei, Y. -L. Zhang, and Z. -H. Zhan, Triple archives particle swarm optimization, IEEE Trans. Cybern., vol. 50, no. 12, pp. 4862–4875, 2019.

[31]

B. Wei, X. Xia, F. Yu, Y. Zhang, X. Xu, H. Wu, L. Gui, and G. He, Multiple adaptive strategies based particle swarm optimization algorithm, Swarm Evol. Comput., vol. 57, p. 100731, 2020.

[32]

L. Pan, Y. Zhao, and L. Li, Neighborhood-based particle swarm optimization with discrete crossover for nonlinear equation systems, Swarm Evol. Comput., vol. 69, p. 101019, 2022.

[33]

X. Tao, X. Li, W. Chen, T. Liang, Y. Li, J. Guo, and L. Qi, Self-adaptive two roles hybrid learning strategies-based particle swarm optimization, Inf. Sci., vol. 578, pp. 457–481, 2021.

[34]

X. Chen, H. Tianfield, and W. Du, Bee-foraging learning particle swarm optimization, Appl. Soft Comput., vol. 102, p. 107134, 2021.

[35]

S. Wang, G. Liu, M. Gao, S. Cao, A. Guo, and J. Wang, Heterogeneous comprehensive learning and dynamic multi-swarm particle swarm optimizer with two mutation operators, Inf. Sci., vol. 540, pp. 175–201, 2020.

[36]

X. Zhang, X. Wang, Q. Kang, and J. Cheng, Differential mutation and novel social learning particle swarm optimization algorithm, Inf. Sci., vol. 480, pp. 109–129, 2019.

[37]

D. Tian and Z. Shi, MPSO: Modified particle swarm optimization and its applications, Swarm Evol. Comput., vol. 41, pp. 49–68, 2018.

[38]

X. Chen, H. Tianfield, C. Mei, W. Du, and G. Liu, Biogeography-based learning particle swarm optimization, Soft Comput., vol. 21, no. 24, pp. 7519–7541, 2017.

[39]

Y. -J. Gong, J. -J. Li, Y. Zhou, Y. Li, H. S. -H. Chung, Y. H. Shi, and J. Zhang, Genetic learning particle swarm optimization, IEEE Trans. Cybern., vol. 46, no. 10, pp. 2277–2290, 2015.

[40]

N. Lynn and P. N. Suganthan, Heterogeneous comprehensive learning particle swarm optimization with enhanced exploration and exploitation, Swarm Evol. Comput., vol. 24, pp. 11–24, 2015.

[41]
O. Olorunda and A. P. Engelbrecht, Measuring exploration/exploitation in particle swarms using swarm diversity, in Proc. 2008 IEEE Cong. Evolutionary Computation (IEEE World Cong. Computational Intelligence), Hong Kong, China, 2008, pp. 1128–1134.
Complex System Modeling and Simulation
Pages 307-326
Cite this article:
Li W, Jing J, Chen Y, et al. Evolutionary Experience-Driven Particle Swarm Optimization with Dynamic Searching. Complex System Modeling and Simulation, 2023, 3(4): 307-326. https://doi.org/10.23919/CSMS.2023.0015

509

Views

74

Downloads

5

Crossref

6

Scopus

Altmetrics

Received: 11 April 2023
Revised: 25 June 2023
Accepted: 05 July 2023
Published: 07 December 2023
© The author(s) 2023.

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).

Return