Metaheuristics in large-scale global continues optimization: A survey

S Mahdavi, ME Shiri, S Rahnamayan - Information Sciences, 2015 - Elsevier
Metaheuristic algorithms are extensively recognized as effective approaches for solving high-
dimensional optimization problems. These algorithms provide effective tools with important …

A review of population-based metaheuristics for large-scale black-box global optimization—Part II

MN Omidvar, X Li, X Yao - IEEE Transactions on Evolutionary …, 2021 - ieeexplore.ieee.org
This article is the second part of a two-part survey series on large-scale global optimization.
The first part covered two major algorithmic approaches to large-scale optimization, namely …

Water strider algorithm: A new metaheuristic and applications

A Kaveh, AD Eslamlou - Structures, 2020 - Elsevier
The present paper proposes a novel nature-inspired optimization paradigm, which is called
the Water Strider Algorithm (WSA). The WSA is a population-based optimizer inspired by the …

[HTML][HTML] The irace package: Iterated racing for automatic algorithm configuration

M López-Ibáñez, J Dubois-Lacoste, LP Cáceres… - Operations Research …, 2016 - Elsevier
Modern optimization algorithms typically require the setting of a large number of parameters
to optimize their performance. The immediate goal of automatic algorithm configuration is to …

A dynamic metaheuristic optimization model inspired by biological nervous systems: Neural network algorithm

A Sadollah, H Sayyaadi, A Yadav - Applied Soft Computing, 2018 - Elsevier
In this research, a new metaheuristic optimization algorithm, inspired by biological nervous
systems and artificial neural networks (ANNs) is proposed for solving complex optimization …

Modern meta-heuristics based on nonlinear physics processes: A review of models and design procedures

S Salcedo-Sanz - Physics Reports, 2016 - Elsevier
Meta-heuristic algorithms are problem-solving methods which try to find good-enough
solutions to very hard optimization problems, at a reasonable computation time, where …

Enhanced opposition-based differential evolution for solving high-dimensional continuous optimization problems

H Wang, Z Wu, S Rahnamayan - Soft Computing, 2011 - Springer
This paper presents a novel algorithm based on generalized opposition-based learning
(GOBL) to improve the performance of differential evolution (DE) to solve high-dimensional …

Multi-population differential evolution with balanced ensemble of mutation strategies for large-scale global optimization

MZ Ali, NH Awad, PN Suganthan - Applied Soft Computing, 2015 - Elsevier
Differential evolution (DE) is a simple, yet very effective, population-based search technique.
However, it is challenging to maintain a balance between exploration and exploitation …

PSO-X: A component-based framework for the automatic design of particle swarm optimization algorithms

CL Camacho-Villalón, M Dorigo… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
The particle swarm optimization (PSO) algorithm has been the object of many studies and
modifications for more than 25 years. Ranging from small refinements to the incorporation of …

Analyzing convergence performance of evolutionary algorithms: A statistical approach

J Derrac, S García, S Hui, PN Suganthan, F Herrera - Information Sciences, 2014 - Elsevier
The analysis of the performance of different approaches is a staple concern in the design of
Computational Intelligence experiments. Any proper analysis of evolutionary optimization …