Cluster-centroid-based mutation strategies for Differential Evolution

2021 ◽  
Author(s):  
Giovanni Iacca ◽  
Vinícius Veloso de Melo
Keyword(s):  
Differential Evolution ◽  
Cluster Centroid ◽  
Mutation Strategies

scholarly journals Adaptive Unified Differential Evolution for Clustering

2018 ◽  
Vol 12 (1) ◽  
pp. 53
Author(s):  
Maulida Ayu Fitriani ◽  
Aina Musdholifah ◽  
Sri Hartati
Keyword(s):  
Differential Evolution ◽  
Fitness Function ◽  
Single Mutation ◽  
Clustering Methods ◽  
Mutation Strategy ◽  
Clustering Quality ◽  
Silhouette Index ◽  
Mutation Strategies ◽  
Time Required

Various clustering methods to obtain optimal information continues to evolve one of its development is Evolutionary Algorithm (EA). Adaptive Unified Differential Evolution (AuDE), is the development of Differential Evolution (DE) which is one of the EA techniques. AuDE has self adaptive scale factor control parameters (F) and crossover-rate (Cr).. It also has a single mutation strategy that represents the most commonly used standard mutation strategies from previous studies.The AuDE clustering method was tested using 4 datasets. Silhouette Index and CS Measure is a fitness function used as a measure of the quality of clustering results. The quality of the AuDE clustering results is then compared against the quality of clustering results using the DE method.The results show that the AuDE mutation strategy can expand the cluster central search produced by ED so that better clustering quality can be obtained. The comparison of the quality of AuDE and DE using Silhoutte Index is 1:0.816, whereas the use of CS Measure shows a comparison of 0.565:1. The execution time required AuDE shows better but Number significant results, aimed at the comparison of Silhoutte Index usage of 0.99:1 , Whereas on the use of CS Measure obtained the comparison of 0.184:1.

scholarly journals A Hybrid Backtracking Search Optimization Algorithm with Differential Evolution

2015 ◽  
Vol 2015 ◽  
pp. 1-16 ◽  
Author(s):  
Lijin Wang ◽  
Yiwen Zhong ◽  
Yilong Yin ◽  
Wenting Zhao ◽  
Binqing Wang ◽  
...  
Keyword(s):  
Differential Evolution ◽  
Optimization Algorithm ◽  
Iteration Process ◽  
Global Optimum ◽  
Backtracking Search ◽  
De Algorithm ◽  
Search Optimization ◽  
Backtracking Search Optimization Algorithm ◽  
Mutation Strategies ◽  
Multimodal Problems

The backtracking search optimization algorithm (BSA) is a new nature-inspired method which possesses a memory to take advantage of experiences gained from previous generation to guide the population to the global optimum. BSA is capable of solving multimodal problems, but it slowly converges and poorly exploits solution. The differential evolution (DE) algorithm is a robust evolutionary algorithm and has a fast convergence speed in the case of exploitive mutation strategies that utilize the information of the best solution found so far. In this paper, we propose a hybrid backtracking search optimization algorithm with differential evolution, called HBD. In HBD, DE with exploitive strategy is used to accelerate the convergence by optimizing one worse individual according to its probability at each iteration process. A suit of 28 benchmark functions are employed to verify the performance of HBD, and the results show the improvement in effectiveness and efficiency of hybridization of BSA and DE.

scholarly journals Spacecraft Multiple-Impulse Trajectory Optimization Using Differential Evolution Algorithm with Combined Mutation Strategies and Boundary-Handling Schemes

2015 ◽  
Vol 2015 ◽  
pp. 1-13 ◽  
Author(s):  
Yuehe Zhu ◽  
Hua Wang ◽  
Jin Zhang
Keyword(s):  
Differential Evolution ◽  
Trajectory Optimization ◽  
Optimization Problems ◽  
Differential Evolution Algorithm ◽  
Optimal Solution ◽  
Global Optimum ◽  
Local Optimum ◽  
Local Optima ◽  
Trial Vector ◽  
Mutation Strategies

Since most spacecraft multiple-impulse trajectory optimization problems are complex multimodal problems with boundary constraint, finding the global optimal solution based on the traditional differential evolution (DE) algorithms becomes so difficult due to the deception of many local optima and the probable existence of a bias towards suboptimal solution. In order to overcome this issue and enhance the global searching ability, an improved DE algorithm with combined mutation strategies and boundary-handling schemes is proposed. In the first stage, multiple mutation strategies are utilized, and each strategy creates a mutant vector. In the second stage, multiple boundary-handling schemes are used to simultaneously address the same infeasible trial vector. Two typical spacecraft multiple-impulse trajectory optimization problems are studied and optimized using the proposed DE method. The experimental results demonstrate that the proposed DE method efficiently overcomes the problem created by the convergence to a local optimum and obtains the global optimum with a higher reliability and convergence rate compared with some other popular evolutionary methods.

New mutation strategies of differential evolution based on clearing niche mechanism

2016 ◽  
Vol 21 (20) ◽  
pp. 5939-5974 ◽  
Author(s):  
Yanan Li ◽  
Haixiang Guo ◽  
Xiao Liu ◽  
Yijing Li ◽  
Wenwen Pan ◽  
...  
Keyword(s):  
Differential Evolution ◽  
New Mutation ◽  
Mutation Strategies

A Novel Mutation Strategy for Differential Evolution

2016 ◽  
pp. 20-31 ◽  
Author(s):  
Hira Zaheer ◽  
Millie Pant ◽  
Sushil Kumar ◽  
Oleg Monakhov
Keyword(s):  
Differential Evolution ◽  
Novel Mutation ◽  
Optimization Technique ◽  
Search Space ◽  
Additional Parameter ◽  
Solution Vector ◽  
Mutation Strategy ◽  
Suggested Strategy ◽  
The Difference ◽  
Mutation Strategies

Differential Evolution (DE) has attained the reputation of a powerful optimization technique that can be used for solving a wide range of problems. In DE, mutation is the most important operator as it helps in generating a new solution vector. In this paper we propose an additional mutation strategy for DE. The suggested strategy is named DE/rand-best/2. It makes use of an additional parameter called guiding force parameter K, which takes a value between (0,1) besides using the scaling factor F, which has a fixed value. De/rand-best/2 makes use of two difference vectors, where the difference is taken from the best solution vector. One vector difference will be produced with a randomly generated mutation factor K (0,1). It will add a different vector to the old one and search space will increase with a random factor. Result shows that this strategy performs well in comparison to other mutation strategies of DE.

Sign in / Sign up

Export Citation Format

Share Document