arrow
Return

Incremental cooperative coevolution for large-scale global optimization

delete2016-12-24
delete13
PRE
AI
S
Sedigheh Mahdavi
S
Shahryar Rahnamayan *
M
Mohammad Ebrahim Shiri
DOI:10.1007/s00500-016-2466-6delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Cooperative coevolution (CC) is an efficient framework for solving large-scale global optimization (LSGO) problems. It uses a decomposition method to divide the LSGO problems into several low-dimensional subcomponents; then, subcomponents are optimized. Since CC algorithms do not consider any imbalance feature, their performance degrades during solving imbalanced LSGO problems. In this paper, we propose an incremental CC (ICC) algorithm in which the algorithm optimizes an integrated subcomponent which subcomponents are dynamically added to it. Therefore, the search space of the optimizer is grown incrementally toward the original problem search space. Various search spaces are built according to three approaches, namely random-based, sensitivity analysis-based, and random sensitivity analysis-based methods; then, ICC explores these search spaces effectively. Random-based selects a subcomponent randomly for adding it to the current search space and the sensitivity analysis-based method uses a sensitivity analysis strategy to select a subcomponent. The random sensitivity analysis-based strategy is a hybrid of the random and sensitivity analysis-based methods. Theoretical analysis is provided to demonstrate that the proposed ICC-based algorithms are effective for solving imbalanced LSGO problems. Finally, the efficiency of these algorithms is benchmarked on the complex imbalanced LSGO problems. Simulation results confirm that ICC obtains a better performance overall.
Keywords:
Large-scale global optimization (LSGO)
Cooperative coevolution (CC)
Sensitivity analysis (SA)
Incremental problem solving
Problem decomposition
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Soft Computing cover
Soft Computing
IF:
2.5
Papers:
1.0W
Citations:
2.1W

Organization

A
Amirkabir University of Technology
Scholars:
1.1W
Papers: 1.1W
Citations: 1.0W
O
Ontario Tech University
Scholars:
2.0K
Papers: 2.3K
Citations: 2