A Parallel Divide-and-Conquer based Evolutionary Algorithm for Large-scale Optimization
arXiv:1812.02500 · doi:10.1109/ACCESS.2019.2938765
Abstract
Large-scale optimization problems that involve thousands of decision variables have extensively arisen from various industrial areas. As a powerful optimization tool for many real-world applications, evolutionary algorithms (EAs) fail to solve the emerging large-scale problems both effectively and efficiently. In this paper, we propose a novel Divide-and-Conquer (DC) based EA that can not only produce high-quality solution by solving sub-problems separately, but also highly utilizes the power of parallel computing by solving the sub-problems simultaneously. Existing DC-based EAs that were deemed to enjoy the same advantages of the proposed algorithm, are shown to be practically incompatible with the parallel computing scheme, unless some trade-offs are made by compromising the solution quality.
12 pages, 0 figures
Cited by in corpus (6)
- Mitigating Unfairness via Evolutionary Multi-objective Ensemble Learning
- Evolutionary Reinforcement Learning via Cooperative Coevolutionary Negatively Correlated Search
- Parallel Exploration via Negatively Correlated Search
- Multi-Space Evolutionary Search for Large-Scale Optimization
- An Eigenspace Divide-and-Conquer Approach for Large-Scale Optimization
- Accelerating Evolution Through Gene Masking and Distributed Search