[HTML][HTML] An insight into bio-inspired and evolutionary algorithms for global optimization: review, analysis, and lessons learnt over a decade of competitions

D Molina, A LaTorre, F Herrera - Cognitive Computation, 2018 - Springer
Over the recent years, continuous optimization has significantly evolved to become the
mature research field it is nowadays. Through this process, evolutionary algorithms had an …

Bio-inspired computation: Where we stand and what's next

J Del Ser, E Osaba, D Molina, XS Yang… - Swarm and Evolutionary …, 2019 - Elsevier
In recent years, the research community has witnessed an explosion of literature dealing
with the mimicking of behavioral patterns and social phenomena observed in nature towards …

A new metaphor-less simple algorithm based on Rao algorithms: a Fully Informed Search Algorithm (FISA)

M Ghasemi, A Rahimnejad, E Akbari, RV Rao… - PeerJ Computer …, 2023 - peerj.com
Many important engineering optimization problems require a strong and simple optimization
algorithm to achieve the best solutions. In 2020, Rao introduced three non-parametric …

Surrogate-guided differential evolution algorithm for high dimensional expensive problems

X Cai, L Gao, X Li, H Qiu - Swarm and Evolutionary Computation, 2019 - Elsevier
Engineering optimization problems usually involve computationally expensive simulations
and massive design variables. Solving these problems in an efficient manner is still a big …

[HTML][HTML] Trial-based dominance for comparing both the speed and accuracy of stochastic optimizers with standard non-parametric tests

KV Price, A Kumar, PN Suganthan - Swarm and Evolutionary Computation, 2023 - Elsevier
Non-parametric tests can determine the better of two stochastic optimization algorithms
when benchmarking results are ordinal—like the final fitness values of multiple trials—but for …

MVMO for bound constrained single-objective computationally expensive numerical optimization

JL Rueda, I Erlich - 2015 IEEE Congress on Evolutionary …, 2015 - ieeexplore.ieee.org
Mean-Variance Mapping Optimization (MVMO) is a recent addition to the heuristic
optimization field. The main traits of its evolutionary mechanism reside in the adoption of a …

Scalable GP with hyperparameters sharing based on transfer learning for solving expensive optimization problems

C Hu, S Zeng, C Li - Applied Soft Computing, 2023 - Elsevier
Surrogates are essential in surrogate-assisted evolutionary algorithms (SAEAs) for solving
expensive optimization problems. Gaussian processes (GPs) are often used as surrogates …

How does the number of objective function evaluations impact our understanding of metaheuristics behavior?

A Kazikova, M Pluhacek, R Senkerik - IEEE Access, 2021 - ieeexplore.ieee.org
Comparing various metaheuristics based on an equal number of objective function
evaluations has become standard practice. Many contemporary publications use a specific …

An on-line variable-fidelity surrogate-assisted harmony search algorithm with multi-level screening strategy for expensive engineering design optimization

J Yi, L Gao, X Li, CA Shoemaker, C Lu - Knowledge-based systems, 2019 - Elsevier
This paper presents an on-line variable-fidelity surrogate-assisted harmony search
algorithm (VFS-HS) for expensive engineering design optimization problems. VFS-HS …

A Q-learning driven competitive surrogate assisted evolutionary optimizer with multiple oriented mutation operators for expensive problems

Q Zhu, H Yu, L Kang, J Zeng - Information Sciences, 2024 - Elsevier
Surrogate-assisted evolutionary algorithms (SAEAs) prevail in the solution of
computationally expensive optimization problems. However, with the growth of problem …