Abstract
Besides classical issues such as scheduling and traveling salesman, optimization problems can be found in several research areas: process industries, agriculture, electric power systems, and medical engineering. In those scenarios, the focus is to find the best possible solutions to a computational problem. To do this search, estimating an objective function’s minimum or maximum points is necessary. Depending on the function, assigning a specific algorithm to obtain the best solutions for all optimization problems is difficult. One option to solve this is to select dynamically a set of algorithms based on particle swarm optimization (PSO) according to the types of problems. In many cases, PSO approaches have a simpler implementation than genetic algorithms. However, they do not store the optimal solutions during the evolution of the particles. This fragility can cause the loss of good generations during the evolution of the particles. To solve this weakness, the article presents a PSO approach based on a sliding memory that stores these generations and applies them in the dynamic selection of algorithms, making a choice even more efficient. We compare the proposal with other particle swarm techniques using the CEC2017 benchmark of 29 optimization problems to evaluate that. Numerical results show that the memory-based approach performs best in approximately \(90\%\) of the problems, and the runtime is about \(23\%\) smaller on average than other optimizers used in the tests.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Shami, T.M., et al.: Particle swarm optimization: a comprehensive survey. IEEE Access 10, 10031–10061 (2022)
Rahkar Farshi, T., et al.: A hybrid firefly and particle swarm optimization algorithm applied to multilevel image thresholding. Multimedia Syst. 27, 125–142 (2021)
Bany Taha, M., Talhi, C., Ould-Slimane, H., Alrabaee, S.: TD-PSO: task distribution approach based on particle swarm optimization for vehicular ad hoc network. Trans. Emerg. Telecommun. Technol. 33(3), e3860 (2022)
Sharma, S., et al.: FIS and hybrid ABC-PSO based optimal capacitor placement and sizing for radial distribution networks. Ambient I. H. Comp. 11, 901–916 (2020)
Azegami, H.: Shape Optimization Problems, 1st edn. Springer, Cham (2020). https://doi.org/10.1007/978-981-15-7618-8
Khouni, S., et al.: Nizar optimization algorithm: a novel metaheuristic algorithm for global optimization and engineering applications. J. Supercomput. 80, 3229–3281 (2024)
Zhang, Q., et al.: Chaos-induced and mutation-driven schemes boosting salp chains-inspired optimizers. IEEE Access 7, 31243–31261 (2019)
Moniz, N., Monteiro, H.: No free lunch in imbalanced learning. Knowl.-Based Syst. 227, 107222 (2021)
Hong, L., Yu, X., Wang, B., Woodward, J., Ozcan, E.: An improved ensemble particle swarm optimizer using niching behavior and covariance matrix adapted retreat phase. Swarm Evol. Comput. 78, 101278 (2023)
Putnins, M., Androulakis, I.P.: Self-selection of evolutionary strategies: adaptive versus non-adaptive forces. Heliyon 7(5), e06997 (2021)
Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the 6th International Symposium on Micro Machine and Human Science (1995)
Wang, N., Liu, J., Lu, J., Zeng, X., Zhao, X.: Low-delay layout planning based on improved particle swarm optimization algorithm in 5G optical fronthaul network. Opt. Fiber Technol. 67, 102736 (2021)
Ji, X., Zhang, Y., Gong, D., Sun, X., Guo, Y.: Multisurrogate-assisted multitasking particle swarm optimization for expensive multimodal problems. IEEE Trans. Cybern. 53(4), 2516–2530 (2023)
Mousumi, B.: Scenario-based fuel-constrained heat and power scheduling of a remote microgrid. Energy 277, 127722 (2023)
Van Huynh, T., et al.: Sequential most probable point update combining Gaussian process and comprehensive learning PSO for structural reliability-based design optimization. Reliab. Eng. Syst. Saf. 235, 109164 (2023)
Libin, H., Xinmeng, Y., Ben, W., John, W., Ender, Ö.: Particle swarm optimizer, niching behavior, covariance matrix adapted retreat, ensemble strategy. Swarm Evol. Comput. 78, 101278 (2023)
Iacca, G., Neri, F., Caraffini, F., Suganthan, P.N.: A differential evolution framework with ensemble of parameters and strategies and pool of local search algorithms. In: Esparcia-Alcázar, A.I., Mora, A.M. (eds.) EvoApplications 2014. LNCS, vol. 8602, pp. 615–626. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-45523-4_50
Miloš, M., Bojan, M., Nicoletta, S.: Wavelets and stochastic theory: past and future. Chaos, Solitons Fractals 173, 113724 (2023)
Liu, L., et al.: A survey of evolutionary algorithms. In: Artificial Intelligence and Internet of Things Engineering (ICBAIE), pp. 22–27 (2023)
Salgotra, R., Singh, S., Singh, U., Kundu, K., Gandomi, A.: An adaptive version of differential evolution for solving CEC2014, CEC 2017 and CEC 2022 test suites. In: Proceedings of the 2022 IEEE Symposium Series on Computational Intelligence, pp. 1644–1649 (2022)
Eiben, A., Smith, J.: Introduction to Evolutionary Computing, 2nd edn. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-44874-8
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Nunes da Silva, L., Carvalho da Cunha, D., Barreto, R.V.S., Timoteo, R.D.A. (2024). Proposal of a Memory-Based Ensemble Particle Swarm Optimizer. In: Tan, Y., Shi, Y. (eds) Advances in Swarm Intelligence. ICSI 2024. Lecture Notes in Computer Science, vol 14788. Springer, Singapore. https://doi.org/10.1007/978-981-97-7181-3_2
Download citation
DOI: https://doi.org/10.1007/978-981-97-7181-3_2
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-7180-6
Online ISBN: 978-981-97-7181-3
eBook Packages: Computer ScienceComputer Science (R0)