scholarly journals Cloud Particles Differential Evolution Algorithm: A Novel Optimization Method for Global Numerical Optimization

2015 ◽  
Vol 2015 ◽  
pp. 1-36 ◽  
Author(s):  
Wei Li ◽  
Lei Wang ◽  
Quanzhu Yao ◽  
Qiaoyong Jiang ◽  
Lei Yu ◽  
...  
Keyword(s):  
Solid State ◽  
Differential Evolution ◽  
Liquid State ◽  
Differential Evolution Algorithm ◽  
Optimization Method ◽  
Benchmark Problems ◽  
Gaseous State ◽  
Mutation Strategy ◽  
Evolution Algorithm ◽  
Cloud Particles

We propose a new optimization algorithm inspired by the formation and change of the cloud in nature, referred to as Cloud Particles Differential Evolution (CPDE) algorithm. The cloud is assumed to have three states in the proposed algorithm. Gaseous state represents the global exploration. Liquid state represents the intermediate process from the global exploration to the local exploitation. Solid state represents the local exploitation. The best solution found so far acts as a nucleus. In gaseous state, the nucleus leads the population to explore by condensation operation. In liquid state, cloud particles carry out macrolocal exploitation by liquefaction operation. A new mutation strategy called cloud differential mutation is introduced in order to solve a problem that the misleading effect of a nucleus may cause the premature convergence. In solid state, cloud particles carry out microlocal exploitation by solidification operation. The effectiveness of the algorithm is validated upon different benchmark problems. The results have been compared with eight well-known optimization algorithms. The statistical analysis on performance evaluation of the different algorithms on 10 benchmark functions and CEC2013 problems indicates that CPDE attains good performance.

scholarly journals Asynchronous differential evolution with selfadaptive parameter control for global numerical optimization

2018 ◽  
Vol 189 ◽  
pp. 03020 ◽  
Author(s):  
Tae Jong Choi ◽  
Yeonju Lee
Keyword(s):  
Differential Evolution ◽  
Numerical Optimization ◽  
Differential Evolution Algorithm ◽  
Convergence Speed ◽  
Benchmark Problems ◽  
Benchmark Problem ◽  
Adaptive Differential Evolution ◽  
Mutation Strategy ◽  
Asynchronous Method ◽  
Evolution Algorithm

In this paper, we propose an extended self-adaptive differential evolution algorithm, called A-jDE. A-jDE algorithm is based on jDE algorithm with the asynchronous method. jDE algorithm is one of the popular DE variants, which shows robust optimization performance on various problems. However, jDE algorithm uses a slow mutation strategy so that its convergence speed is slow compared to several state-of-the-art DE algorithms. The asynchronous method is one of the recently investigated approaches that if it finds a better solution, the solution is included in the current population immediately so it can be served as a donor individual. Therefore, it can improve the convergence speed significantly. We evaluated the optimization performance of A-jDE algorithm in 13 scalable benchmark problems on 30 and 100 dimensions. Our experiments prove that incorporating jDE algorithm with the asynchronous method can improve the optimization performance in not only a unimodal benchmark problem but also multimodal benchmark problem significantly.

scholarly journals An enhanced differential evolution algorithm with adaptation of switching crossover strategy for continuous optimization

2020 ◽  
Vol 45 (2) ◽  
pp. 97-124
Author(s):  
Pikul Puphasuk ◽  
Jeerayut Wetweerapong
Keyword(s):  
Differential Evolution ◽  
Population Size ◽  
Optimization Problems ◽  
Differential Evolution Algorithm ◽  
Continuous Optimization ◽  
Optimization Method ◽  
Benchmark Problems ◽  
Systems Of Nonlinear Equations ◽  
Wide Range ◽  
Evolution Algorithm

AbstractDesigning an efficient optimization method which also has a simple structure is generally required by users for its applications to a wide range of practical problems. In this research, an enhanced differential evolution algorithm with adaptation of switching crossover strategy (DEASC) is proposed as a general-purpose population-based optimization method for continuous optimization problems. DEASC extends the solving ability of a basic differential evolution algorithm (DE) whose performance significantly depends on user selection of the control parameters: scaling factor, crossover rate and population size. Like the original DE, the proposed method is aimed at e ciency, simplicity and robustness. The appropriate population size is selected to work in accordance with good choices of the scaling factors. Then, the switching crossover strategy of using low or high crossover rates are incorporated and adapted to suit the problem being solved. In this manner, the adaptation strategy is just a convenient add-on mechanism. To verify the performance of DEASC, it is tested on several benchmark problems of various types and di culties, and compared with some well-known methods in the literature. It is also applied to solve some practical systems of nonlinear equations. Despite its much simpler algorithmic structure, the experimental results show that DEASC greatly enhances the basic DE. It is able to solve all the test problems with fast convergence speed and overall outperforms the compared methods which have more complicated structures. In addition, DEASC also shows promising results on high dimensional test functions.

scholarly journals Cloud Particles Evolution Algorithm

2015 ◽  
Vol 2015 ◽  
pp. 1-21 ◽  
Author(s):  
Wei Li ◽  
Lei Wang ◽  
Qiaoyong Jiang ◽  
Xinhong Hei ◽  
Bin Wang
Keyword(s):  
Phase Transformation ◽  
Optimization Problems ◽  
Optimization Method ◽  
Cloud Formation ◽  
Benchmark Problems ◽  
Gaseous State ◽  
Use Phase ◽  
Evolution Algorithm ◽  
Cloud Particles ◽  
Survival Of The Fittest

Many evolutionary algorithms have been paid attention to by the researchers and have been applied to solve optimization problems. This paper presents a new optimization method called cloud particles evolution algorithm (CPEA) to solve optimization problems based on cloud formation process and phase transformation of natural substance. The cloud is assumed to have three states in the proposed algorithm. Gaseous state represents the global exploration. Liquid state represents the intermediate process from the global exploration to the local exploitation. Solid state represents the local exploitation. The cloud is composed of descript and independent particles in this algorithm. The cloud particles use phase transformation of three states to realize the global exploration and the local exploitation in the optimization process. Moreover, the cloud particles not only realize the survival of the fittest through competition mechanism but also ensure the diversity of the cloud particles by reciprocity mechanism. The effectiveness of the algorithm is validated upon different benchmark problems. The proposed algorithm is compared with a number of other well-known optimization algorithms, and the experimental results show that cloud particles evolution algorithm has a higher efficiency than some other algorithms.

scholarly journals Multiscale Cooperative Differential Evolution Algorithm

2019 ◽  
Vol 2019 ◽  
pp. 1-17 ◽  
Author(s):  
Yongzhao Du ◽  
Yuling Fan ◽  
Xiaofang Liu ◽  
Yanmin Luo ◽  
Jianeng Tang ◽  
...  
Keyword(s):  
Differential Evolution ◽  
Optimization Problems ◽  
Early Stage ◽  
Differential Evolution Algorithm ◽  
Search Range ◽  
Adaptive Parameter ◽  
Mutation Strategy ◽  
Evolution Algorithm ◽  
Evolution Algorithms ◽  
The Individual

A multiscale cooperative differential evolution algorithm is proposed to solve the problems of narrow search range at the early stage and slow convergence at the later stage in the performance of the traditional differential evolution algorithms. Firstly, the population structure of multipopulation mechanism is adopted so that each subpopulation is combined with a corresponding mutation strategy to ensure the individual diversity during evolution. Then, the covariance learning among populations is developed to establish a suitable rotating coordinate system for cross operation. Meanwhile, an adaptive parameter adjustment strategy is introduced to balance the population survey and convergence. Finally, the proposed algorithm is tested on the CEC 2005 benchmark function and compared with other state-of-the-art evolutionary algorithms. The experiment results showed that the proposed algorithm has better performance in solving global optimization problems than other compared algorithms.

Sign in / Sign up

Export Citation Format

Share Document