LSHADE-SPA memetic framework for solving large-scale optimization problems

Anas A. Hadi

doi:10.1007/s40747-018-0086-8

LSHADE-SPA memetic framework for solving large-scale optimization problems

2018-12-04

75

OA

AI

DOI：10.1007/s40747-018-0086-8

原文链接

查看原文

摘要

En 中文

During the last decade, large-scale global optimization has been one of the active research fields. Optimization algorithms are affected by the curse of dimensionality associated with this kind of complex problems. To solve this problem, a new memetic framework for solving large-scale global optimization problems is proposed in this paper. In the proposed framework, success history-based differential evolution with linear population size reduction and semi-parameter adaptation (LSHADE-SPA) is used for global exploration, while a modified version of multiple trajectory search is used for local exploitation. The framework introduced in this paper is further enhanced by the concept of divide and conquer, where the dimensions are randomly divided into groups, and each group is solved separately. The proposed framework is evaluated using IEEE CEC2010 and the IEEE CEC2013 benchmarks designed for large-scale global optimization. The comparison results between our framework and other state-of-the-art algorithms indicate that our proposed framework is competitive in solving large-scale global optimization problems.

Keyword:

Evolutionary computation

Global optimization

Large-scale optimization

Differential evolution of LSHADE-SPA

Memetic framework

LSHADE-SPA memetic framework for solving large-scale optimization problems

摘要

AI总结

期刊

机构