Authors:
Mohamed A. Meselhi
;
Ruhul A. Sarker
;
Daryl L. Essam
and
Saber M. Elsayed
Affiliation:
School of Engineering and Information Technology, University of New South Wales at Canberra, Canberra, 2600 and Australia
Keyword(s):
Evolutionary Algorithms, Cooperative Coevolution, Problem Decomposition, Large Scale Global Optimization.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Co-Evolution and Collective Behavior
;
Computational Intelligence
;
Evolutionary Computing
;
Soft Computing
Abstract:
The curse of dimensionality is considered a main impediment in improving the optimization of large scale problems. An intuitive method to enhance the scalability of evolutionary algorithms is cooperative co-evolution. This method can be used to solve high dimensionality problems through a divide-and-conquer strategy. Nevertheless, its performance deteriorates if there is any interaction between subproblems. Thus, a method that tries to group interdependent variables in the same group is demanded. In addition, the computational cost of current decomposition methods is relatively expensive. In this paper, we propose an enhanced differential grouping (EDG) method, that can efficiently uncover separable and nonseparable variables in the first stage. Then, nonseparable variables are furthermore examined to detect their direct and indirect interdependencies, and all interdependent variables are grouped in the same subproblem. The efficiency of the EDG method was evaluated using large scale
global optimization benchmark functions with up to 1000 variables. The numerical experimental results indicate that the EDG method efficiently decomposes benchmark functions with fewer fitness evaluations, in comparison with state-of-the-art methods. Moreover, EDG was integrated with cooperative co-evolution, which shows the efficiency of this method over other decomposition methods.
(More)