ACCELERATED CONVERGENCE EVOLUTIONARY ALGORITHMS
DOI:
https://doi.org/10.20319/stra.2026.8190Keywords:
Evolutionary Algorithms, Optimization, Convergence, Population Movement StrategyAbstract
Evolutionary Algorithms are search methods inspired by the concepts of adaptation and survival of the fittest. Their operation can require large samples to provide a good solution, which hinders their application when evaluations are limited. As such this study presents a methodology to accelerate the EA convergence by moving its population based on the positions of the population. Tests against competing algorithms show the proposed approach has performed well.
References
[Brest and Sepesy Mau˘cec, 2025] Brest, J. and Sepesy Mau˘cec, M. (2025).
Comparative study of modern differential evolution algorithms: Perspec-
tives on mechanisms and performance. Mathematics, 13(10).
[De Jong, 2016] De Jong, K. A. (2016). Evolutionary Computation:A Uni-
fied Approach. MIT Press, Cambridge, Massachusetts.
[Huang et al., 2023] Huang, X., Wang, Z., Li, C., and Zhang, M. (2023). A
low-complexity evolutionary algorithm for wind farm layout optimization.
Energy Reports, 9:5752–5761.
[Ivkovic et al., 2016] Ivkovic, N., Jakobovic, D., and Golub, M. (2016).
Measuring performance of optimization algorithms in evolutionary com-
putation. International Journal of Machine Learning and Computing,
(3):167–171.
[Michalewicz and Fogel, 2004] Michalewicz, Z. and Fogel, D. B. (2004). How
to Solve It: Modern Heuristics. Springer, Berlin; New York.
[Plump et al., 2021] Plump, C., Berger, B. J., and Drechsler, R. (2021).
Improving evolutionary algorithms by enhancing an approximative fitness
function through prediction intervals. In Proceedings of the 2021 IEEE
Conference on Evolutionary Computation (CEC 2021), pages 127–135,
Krakow, Poland. IEEE.
[Plump et al., 2021] Plump, C., Berger, B. J., and Drechsler, R. (2021).
Improving evolutionary algorithms by enhancing an approximative fitness
function through prediction intervals. In Proceedings of the 2021 IEEE
Conference on Evolutionary Computation (CEC 2021), pages 127–135,
Krakow, Poland. IEEE.
[Suganthan et al., 2005] Suganthan, P. N., Hansen, N., Liang, J. J., Deb,
K., Chen, Y. P., Auger, A., and Tiwari, S. (2005). Problem definitions
and evaluation criteria for the CEC 2005 special session on real-parameter
optimization. Technical Report KanGAL 2005005, NUS, Singapore and
IIT Kanpur,India.
[Tenne, 2020] Tenne, Y. (2020). Online ensemble selection in expensive op-
timization problems. International Journal of Control, Automation, and
Systems, 18:955–965.
[Tenne, 2021] Tenne, Y. (2021). Evaluations of an algorithm for large multi-
variate optimization. Journal of Physics–Conference Series, 2068. Article
(online).
[Tenne, 2022] Tenne, Y. (2022). An analysis of the RBF hyperparameter
impact on surrogate-assisted evolutionary optimization. Scientific Pro-
gramming, 22. Article ID 5175941, Online.
[Tenne and Goh, 2010] Tenne, Y. and Goh, C. K., editors (2010). Com-
putational Intelligence in Expensive Optimization Problems, volume 2 of
Evolutionary Learning and Optimization. Springer, Berlin.
[Vandekerckhove, 2024] Vandekerckhove, J. (2024). A general simulated an-
nealing algorithm. Technical report, KU Leuven.
[Wang et al., 2020] Wang, L., Janssem, P., and Ji, G. (2020). SSIEA: a hy-
brid evolutionary algorithm for supporting conceptual architectural de-
sign. Artificial Intelligence for Engineering Design, Analysis and Manu-
facturing, 34(4):458–476.
[Wang et al., 2022] Wang, Y., Zhang, T., Chang, Y., Wang, X., Liang, B.,
and Bo, Y. (2022). A surrogate-assisted controller for expensive evolu-
tionary reinforcement learning. Information Sciences, 616:539–557.
[Yamashita et al., 2022] Yamashita, T., Kino, H., Tsuda, K., Miyake, T.,
and Oguchi, T. (2022). Hybrid algorithm of bayesian optimization and
evolutionary algorithm in crystal structure prediction. Science and Tech-
nology of Advanced Materials: Methods, 2(1):67–74.
[Ye and Shen, 2019] Ye, h. and Shen, B. (2019). An improved constrained
multi-objective optimization evolutionary algorithm for carbon fibre
drawing process. Systems Science and Control Engineering, 7(1):133–145.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Copyright of Published Articles
Author(s) retain the article copyright and publishing rights without any restrictions.
All published work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
