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 …

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

MN Omidvar, X Li, X Yao - IEEE Transactions on Evolutionary …, 2021 - ieeexplore.ieee.org
Scalability of optimization algorithms is a major challenge in coping with the ever-growing
size of optimization problems in a wide range of application areas from high-dimensional …

[HTML][HTML] Large-scale evolutionary optimization: A review and comparative study

J Liu, R Sarker, S Elsayed, D Essam… - Swarm and Evolutionary …, 2024 - Elsevier
Large-scale global optimization (LSGO) problems have widely appeared in various real-
world applications. However, their inherent complexity, coupled with the curse of …

[PDF][PDF] Benchmark functions for the CEC 2013 special session and competition on large-scale global optimization

X Li, K Tang, MN Omidvar, Z Yang, K Qin, H China - gene, 2013 - al-roomi.org
This report proposes 15 large-scale benchmark problems as an extension to the existing
CEC'2010 large-scale global optimization benchmark suite. The aim is to better represent a …

SHADE with iterative local search for large-scale global optimization

D Molina, A LaTorre, F Herrera - 2018 IEEE congress on …, 2018 - ieeexplore.ieee.org
Global optimization is a very important topic in research due to its wide applications in many
real-world problems in science and engineering. Among optimization problems …

Investigating surrogate-assisted cooperative coevolution for large-scale global optimization

I De Falco, A Della Cioppa, GA Trunfio - Information Sciences, 2019 - Elsevier
Problems involving large-scale global optimization (LSGO) are becoming more and more
frequent. For this reason, the last few years have seen an increasing number of researchers …

A comparison of global search algorithms for continuous black box optimization

P Pošík, W Huyer, L Pál - Evolutionary computation, 2012 - ieeexplore.ieee.org
Four methods for global numerical black box optimization with origins in the mathematical
programming community are described and experimentally compared with the state of the …

DG2: A faster and more accurate differential grouping for large-scale black-box optimization

MN Omidvar, M Yang, Y Mei, X Li… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Identification of variable interaction is essential for an efficient implementation of a divide-
and-conquer algorithm for large-scale black-box optimization. In this paper, we propose an …

Black-box optimization revisited: Improving algorithm selection wizards through massive benchmarking

L Meunier, H Rakotoarison, PK Wong… - IEEE Transactions …, 2021 - ieeexplore.ieee.org
Existing studies in black-box optimization suffer from low generalizability, caused by a
typically selective choice of problem instances used for training and testing of different …

A competitive divide-and-conquer algorithm for unconstrained large-scale black-box optimization

Y Mei, MN Omidvar, X Li, X Yao - ACM Transactions on Mathematical …, 2016 - dl.acm.org
This article proposes a competitive divide-and-conquer algorithm for solving large-scale
black-box optimization problems for which there are thousands of decision variables and the …