Large-Scale Global Optimization via Swarm Intelligence

2014 ◽  
pp. 241-253 ◽  
Author(s):  
Shi Cheng ◽  
T. O. Ting ◽  
Xin-She Yang
Keyword(s):  
Global Optimization ◽  
Swarm Intelligence ◽  
Large Scale

Large-scale global optimization based on hybrid swarm intelligence algorithm

2020 ◽  
Vol 39 (1) ◽  
pp. 1257-1275 ◽  
Author(s):  
Wali Khan Mashwani ◽  
Abdelouahed Hamdi ◽  
Muhammad Asif Jan ◽  
Atila Göktaş ◽  
Fouzia Khan
Keyword(s):  
Global Optimization ◽  
Swarm Intelligence ◽  
Large Scale ◽  
Hybrid Swarm ◽  
Intelligence Algorithm ◽  
Swarm Intelligence Algorithm

A New Stochastic/Perturbation Method for Large-Scale Global Optimization and Its Application to Water Cluster Problems

1993 ◽  
Author(s):  
Richard H. Byrd ◽  
Thomas Derby ◽  
Elizabeth Eskow ◽  
Klaas P. Oldenkamp ◽  
Robert B. Schnabel
Keyword(s):  
Global Optimization ◽  
Perturbation Method ◽  
Water Cluster ◽  
Large Scale ◽  
Stochastic Perturbation ◽  
Stochastic Perturbation Method

scholarly journals Image-based benchmarking and visualization for large-scale global optimization

2021 ◽  
Author(s):  
Kyle Robert Harrison ◽  
Azam Asilian Bidgoli ◽  
Shahryar Rahnamayan ◽  
Kalyanmoy Deb
Keyword(s):  
Global Optimization ◽  
Large Scale

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.

Cooperative Coevolution with Formula-Based Variable Grouping for Large-Scale Global Optimization

2018 ◽  
Vol 26 (4) ◽  
pp. 569-596 ◽  
Author(s):  
Yuping Wang ◽  
Haiyan Liu ◽  
Fei Wei ◽  
Tingting Zong ◽  
Xiaodong Li
Keyword(s):  
Global Optimization ◽  
Objective Function ◽  
Real World ◽  
Large Scale ◽  
Divide And Conquer ◽  
Group Method ◽  
Objective Functions ◽  
Elementary Functions ◽  
Cooperative Coevolution ◽  
Solution Quality

For a large-scale global optimization (LSGO) problem, divide-and-conquer is usually considered an effective strategy to decompose the problem into smaller subproblems, each of which can then be solved individually. Among these decomposition methods, variable grouping is shown to be promising in recent years. Existing variable grouping methods usually assume the problem to be black-box (i.e., assuming that an analytical model of the objective function is unknown), and they attempt to learn appropriate variable grouping that would allow for a better decomposition of the problem. In such cases, these variable grouping methods do not make a direct use of the formula of the objective function. However, it can be argued that many real-world problems are white-box problems, that is, the formulas of objective functions are often known a priori. These formulas of the objective functions provide rich information which can then be used to design an effective variable group method. In this article, a formula-based grouping strategy (FBG) for white-box problems is first proposed. It groups variables directly via the formula of an objective function which usually consists of a finite number of operations (i.e., four arithmetic operations “[Formula: see text]”, “[Formula: see text]”, “[Formula: see text]”, “[Formula: see text]” and composite operations of basic elementary functions). In FBG, the operations are classified into two classes: one resulting in nonseparable variables, and the other resulting in separable variables. In FBG, variables can be automatically grouped into a suitable number of non-interacting subcomponents, with variables in each subcomponent being interdependent. FBG can easily be applied to any white-box problem and can be integrated into a cooperative coevolution framework. Based on FBG, a novel cooperative coevolution algorithm with formula-based variable grouping (so-called CCF) is proposed in this article for decomposing a large-scale white-box problem into several smaller subproblems and optimizing them respectively. To further enhance the efficiency of CCF, a new local search scheme is designed to improve the solution quality. To verify the efficiency of CCF, experiments are conducted on the standard LSGO benchmark suites of CEC'2008, CEC'2010, CEC'2013, and a real-world problem. Our results suggest that the performance of CCF is very competitive when compared with those of the state-of-the-art LSGO algorithms.

Sign in / Sign up

Export Citation Format

Share Document