A Review of Population-Based Metaheuristics for Large-Scale Black-Box Global Optimization - Part II

40Citations
Citations of this article
48Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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, decomposition methods and hybridization methods, such as memetic algorithms and local search. In this part, we focus on sampling and variation operators, approximation and surrogate modeling, initialization methods, and parallelization. We also cover a range of problem areas in relation to large-scale global optimization, such as multiobjective optimization, constraint handling, overlapping components, the component imbalance issue and benchmarks, and applications. The article also includes a discussion on pitfalls and challenges of the current research and identifies several potential areas of future research.

Cite

CITATION STYLE

APA

Omidvar, M. N., Li, X., & Yao, X. (2022, October 1). A Review of Population-Based Metaheuristics for Large-Scale Black-Box Global Optimization - Part II. IEEE Transactions on Evolutionary Computation. Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1109/TEVC.2021.3130835

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free