A Novel Clone Selection Algorithm for High-Dimensional Global Optimization Problems

2009 ◽  
Author(s):  
Xingbao Liu ◽  
Liangwu Shi ◽  
Rongyuan Chen ◽  
Haijun Chen
Keyword(s):  
Global Optimization ◽  
Optimization Problems ◽  
High Dimensional ◽  
Selection Algorithm ◽  
Clone Selection

scholarly journals Investigation of Improved Cooperative Coevolution for Large-Scale Global Optimization Problems

Algorithms ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 146
Author(s):  
Aleksei Vakhnin ◽  
Evgenii Sopov
Keyword(s):  
Global Optimization ◽  
Evolutionary Algorithms ◽  
Numerical Experiments ◽  
Large Scale ◽  
Optimization Problems ◽  
State Of The Art ◽  
Fixed Number ◽  
High Dimensional ◽  
Cooperative Coevolution ◽  
Large Scale Problems

Modern real-valued optimization problems are complex and high-dimensional, and they are known as “large-scale global optimization (LSGO)” problems. Classic evolutionary algorithms (EAs) perform poorly on this class of problems because of the curse of dimensionality. Cooperative Coevolution (CC) is a high-performed framework for performing the decomposition of large-scale problems into smaller and easier subproblems by grouping objective variables. The efficiency of CC strongly depends on the size of groups and the grouping approach. In this study, an improved CC (iCC) approach for solving LSGO problems has been proposed and investigated. iCC changes the number of variables in subcomponents dynamically during the optimization process. The SHADE algorithm is used as a subcomponent optimizer. We have investigated the performance of iCC-SHADE and CC-SHADE on fifteen problems from the LSGO CEC’13 benchmark set provided by the IEEE Congress of Evolutionary Computation. The results of numerical experiments have shown that iCC-SHADE outperforms, on average, CC-SHADE with a fixed number of subcomponents. Also, we have compared iCC-SHADE with some state-of-the-art LSGO metaheuristics. The experimental results have shown that the proposed algorithm is competitive with other efficient metaheuristics.

scholarly journals Differential Evolution with Novel Mutation and Adaptive Crossover Strategies for Solving Large Scale Global Optimization Problems

2017 ◽  
Vol 2017 ◽  
pp. 1-18 ◽  
Author(s):  
Ali Wagdy Mohamed ◽  
Abdulaziz S. Almazyad
Keyword(s):  
Global Optimization ◽  
Differential Evolution ◽  
Large Scale ◽  
Optimization Problems ◽  
Differential Evolution Algorithm ◽  
High Dimensional ◽  
Gradual Change ◽  
Comparison Results ◽  
Mutation Strategy ◽  
Common Trade

This paper presents Differential Evolution algorithm for solving high-dimensional optimization problems over continuous space. The proposed algorithm, namely, ANDE, introduces a new triangular mutation rule based on the convex combination vector of the triplet defined by the three randomly chosen vectors and the difference vectors between the best, better, and the worst individuals among the three randomly selected vectors. The mutation rule is combined with the basic mutation strategy DE/rand/1/bin, where the new triangular mutation rule is applied with the probability of 2/3 since it has both exploration ability and exploitation tendency. Furthermore, we propose a novel self-adaptive scheme for gradual change of the values of the crossover rate that can excellently benefit from the past experience of the individuals in the search space during evolution process which in turn can considerably balance the common trade-off between the population diversity and convergence speed. The proposed algorithm has been evaluated on the 20 standard high-dimensional benchmark numerical optimization problems for the IEEE CEC-2010 Special Session and Competition on Large Scale Global Optimization. The comparison results between ANDE and its versions and the other seven state-of-the-art evolutionary algorithms that were all tested on this test suite indicate that the proposed algorithm and its two versions are highly competitive algorithms for solving large scale global optimization problems.

scholarly journals Influence of a neighborhood shape on the efficiency of continuous variable neighborhood search

2020 ◽  
Vol 30 (1) ◽  
pp. 3-17
Author(s):  
Milan Drazic
Keyword(s):  
Global Optimization ◽  
Variable Neighborhood Search ◽  
Optimization Problems ◽  
Continuous Variable ◽  
Efficient Algorithms ◽  
Geometric Shape ◽  
Neighborhood Search ◽  
High Dimensional ◽  
Neighborhood Structures ◽  
Continuous Global Optimization

The efficiency of a Variable neighborhood search metaheuristic for continuous global optimization problems greatly depends on geometric shape of neighborhood structures used by the algorithm. Among the neighborhoods defined by balls in ?p, 1 ?p ? ? metric, we tested the ?1, ?2, and ?? ball shape neighborhoods, for which there exist efficient algorithms for obtaining uniformly distributed points. On many challenging high-dimensional problems, our exhaustive testings showed that, popular and the easiest for implementation, ?? ball shape of neighborhoods performed the worst, and much better efficiency was obtained with ?1 and ?2.

Trust Region Based Mode Pursuing Sampling Method for Global Optimization of High Dimensional Design Problems

2015 ◽  
Vol 137 (2) ◽  
Author(s):  
George H. Cheng ◽  
Adel Younis ◽  
Kambiz Haji Hajikolaei ◽  
G. Gary Wang
Keyword(s):  
Global Optimization ◽  
Optimization Problems ◽  
Trust Region ◽  
Standard Test ◽  
Black Box ◽  
High Dimensional ◽  
Efficient Global Optimization ◽  
Test Problems ◽  
Design Problems ◽  
Design Variables

Mode pursuing sampling (MPS) was developed as a global optimization algorithm for design optimization problems involving expensive black box functions. MPS has been found to be effective and efficient for design problems of low dimensionality, i.e., the number of design variables is less than 10. This work integrates the concept of trust regions into the MPS framework to create a new algorithm, trust region based mode pursuing sampling (TRMPS2), with the aim of dramatically improving performance and efficiency for high dimensional problems. TRMPS2 is benchmarked against genetic algorithm (GA), dividing rectangles (DIRECT), efficient global optimization (EGO), and MPS using a suite of standard test problems and an engineering design problem. The results show that TRMPS2 performs better on average than GA, DIRECT, EGO, and MPS for high dimensional, expensive, and black box (HEB) problems.

Sign in / Sign up

Export Citation Format

Share Document