Stratified Sampling Differential Evolution Algorithm for Global Optimization Problem

2012 ◽  
Vol 452-453 ◽  
pp. 1491-1495
Author(s):  
Shu Hua Wen ◽  
Qing Bo Lu ◽  
Xue Liang Zhang
Keyword(s):  
Differential Evolution ◽  
Optimization Problem ◽  
Sampling Method ◽  
Differential Evolution Algorithm ◽  
Optimal Solution ◽  
Stratified Sampling ◽  
Local Optima ◽  
De Algorithm ◽  
Local Optimal Solution ◽  
Evolution Algorithm

Differential Evolution (DE) is one kind of evolution algorithm, which based on difference of individuals. DE has exhibited good performance on optimization problem. However, when a local optimal solution is reached with classical Differential Evolution, all individuals in the population gather around it, and escaping from these local optima becomes difficult. To avoid premature convergence of DE, we present in this paper a novel variant of DE algorithm, called SSDE, which uses the stratified sampling method to replace the random sampling method. The proposed SSDE algorithm is compared with some variant DE. The numerical results show that our approach is robust, competitive and fast.

Research and Improvement on K-Means Clustering Algorithm

2013 ◽  
Vol 756-759 ◽  
pp. 3231-3235
Author(s):  
Xue Mei Wang ◽  
Jin Bo Wang
Keyword(s):  
Differential Evolution ◽  
Clustering Algorithm ◽  
Differential Evolution Algorithm ◽  
Optimal Solution ◽  
Clustering Quality ◽  
Local Optimal Solution ◽  
Evolution Algorithm ◽  
Clustering Center ◽  
Searching Ability ◽  
Improved Differential Evolution Algorithm

According to the defects of classical k-means clustering algorithm such as sensitive to the initial clustering center selection, the poor global search ability, falling into the local optimal solution. A differential evolution algorithm which was a kind of a heuristic global optimization algorithm based on population was introduced in this article, then put forward an improved differential evolution algorithm combined with k-means clustering algorithm at the same time. The experiments showed that the method has solved initial centers optimization problem of k-means clustering algorithm well, had a better searching ability,and more effectively improved clustering quality and convergence speed.

An Improved Differential Evolution Algorithm for Numerical Optimization Problems

2013 ◽  
Vol 415 ◽  
pp. 349-352
Author(s):  
Hong Wei Zhao ◽  
Hong Gang Xia
Keyword(s):  
Differential Evolution ◽  
Numerical Optimization ◽  
Optimization Problems ◽  
Differential Evolution Algorithm ◽  
Population Based ◽  
Local Optimum ◽  
Local Optima ◽  
De Algorithm ◽  
Evolution Algorithm ◽  
Improved Differential Evolution Algorithm

Differential evolution (DE) is a population-based stochastic function minimizer (or maximizer), whose simple yet powerful and straightforward features make it very attractive for numerical optimization. However, DE is easy to trapped into local optima. In this paper, an improved differential evolution algorithm (IDE) proposed to speed the convergence rate of DE and enhance the global search of DE. The IDE employed a new mutation operation and modified crossover operation. The former can rapidly enhance the convergence of the MDE, and the latter can prevent the MDE from being trapped into the local optimum effectively. Besides, we dynamic adjust the scaling factor (F) and the crossover rate (CR), which is aimed at further improving algorithm performance. Based on several benchmark experiment simulations, the IDE has demonstrated stronger convergence and stability than original differential (DE) algorithm and other algorithms (PSO and JADE) that reported in recent literature.

Research on the Optimal Design of Soccer Robot Based on the Mechanical Analysis

2013 ◽  
Vol 380-384 ◽  
pp. 3854-3857
Author(s):  
Jian Wen Han ◽  
Lei Hong
Keyword(s):  
Differential Evolution ◽  
Clustering Algorithm ◽  
Differential Evolution Algorithm ◽  
Optimal Solution ◽  
Mechanical Analysis ◽  
Clustering Quality ◽  
Local Optimal Solution ◽  
Evolution Algorithm ◽  
Searching Ability ◽  
Improved Differential Evolution Algorithm

According to the defects of classical k-means clustering algorithm such as sensitive to the initial clustering center selection, the poor global search ability, falling into the local optimal solution. A differential evolution algorithm which was a kind of a heuristic global optimization algorithm based on population was introduced in this article, then put forward an improved differential evolution algorithm combined with k-means clustering algorithm at the same time. The experiments showed that the method has solved initial centers optimization problem of k-means clustering algorithm well, had a better searching ability,and more effectively improved clustering quality and convergence speed

scholarly journals A Novel Enhanced Differential Evolution Algorithm for Outbound Logistics of the Poultry Industry in Thailand

2022 ◽  
Vol 8 (1) ◽  
pp. 15
Author(s):  
Karn Moonsri ◽  
Kanchana Sethanan ◽  
Kongkidakhon Worasan
Keyword(s):  
Differential Evolution ◽  
Differential Evolution Algorithm ◽  
Optimal Solution ◽  
Transportation Cost ◽  
Mixed Integer ◽  
Computational Time ◽  
Poultry Industry ◽  
Routing Problem ◽  
De Algorithm ◽  
Evolution Algorithm

Outbound logistics is a crucial field of logistics management. This study considers a planning distribution for the poultry industry in Thailand. The goal of the study is to minimize the transportation cost for the multi-depot vehicle-routing problem (MDVRP). A novel enhanced differential evolution algorithm (RI-DE) is developed based on a new re-initialization mutation formula and a local search function. A mixed-integer programming formulation is presented in order to measure the performance of a heuristic with GA, PSO, and DE for small-sized instances. For large-sized instances, RI-DE is compared to the traditional DE algorithm for solving the MDVRP using published benchmark instances. The results demonstrate that RI-DE obtained a near-optimal solution of 99.03% and outperformed the traditional DE algorithm with a 2.53% relative improvement, not only in terms of solution performance, but also in terms of computational time.

An Improved DE Algorithm Based on the New Crossover Strategy

2015 ◽  
Vol 713-715 ◽  
pp. 1583-1588
Author(s):  
Cao Liang Liang ◽  
Wang Rui Rong ◽  
Liu Man Dan
Keyword(s):  
Differential Evolution Algorithm ◽  
Optimal Solution ◽  
Standard Test ◽  
Local Solution ◽  
Population Diversity ◽  
Test Functions ◽  
Algorithm Optimization ◽  
De Algorithm ◽  
Local Optimal Solution ◽  
Evolution Algorithm

Differential Evolution Algorithm (DE) is fast and stable, but it’s easy to fall into the local optimal solution and the population diversity reduces fast in the later period. In order to improve the algorithm optimization and convergence capability, this paper proposes an improved DE algorithm based on the new crossover strategy (CMDE). As to the Crossover-factor is decided by the proportion of the variance and the evolution process in each generation, so it can follow the process of evolution and constantly change; the added operation of Second Mutation can improve the capacity of solving problem, which algorithm falls into the local solution easily. With four standard test functions, the results show that the CMDE algorithm is superior to DE in convergence speed, precise and stability of algorithm.

scholarly journals An Enhancing Differential Evolution Algorithm with a Rank-Up Selection: RUSDE

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 569
Author(s):  
Kai Zhang ◽  
Yicheng Yu
Keyword(s):  
Differential Evolution ◽  
Optimization Problem ◽  
Differential Evolution Algorithm ◽  
Iteration Process ◽  
Excellent Performance ◽  
De Algorithm ◽  
Current Population ◽  
Mutation Strategy ◽  
Evolution Algorithm ◽  
Better Than

Recently, the differential evolution (DE) algorithm has been widely used to solve many practical problems. However, DE may suffer from stagnation problems in the iteration process. Thus, we propose an enhancing differential evolution with a rank-up selection, named RUSDE. First, the rank-up individuals in the current population are selected and stored into a new archive; second, a debating mutation strategy is adopted in terms of the updating status of the current population to decide the parent’s selection. Both of the two methods can improve the performance of DE. We conducted numerical experiments based on various functions from CEC 2014, where the results demonstrated excellent performance of this algorithm. Furthermore, this algorithm is applied to the real-world optimization problem of the four-bar linkages, where the results show that the performance of RUSDE is better than other algorithms.

scholarly journals An Improved Grey Wolf Optimizer Based on Differential Evolution and OTSU Algorithm

2020 ◽  
Vol 10 (18) ◽  
pp. 6343
Author(s):  
Yuanyuan Liu ◽  
Jiahui Sun ◽  
Haiye Yu ◽  
Yueyong Wang ◽  
Xiaokang Zhou
Keyword(s):  
Differential Evolution ◽  
Image Recognition ◽  
Optimal Solution ◽  
Tsallis Entropy ◽  
Grey Wolf Optimizer ◽  
Initial Population ◽  
Grey Wolf ◽  
Particle Swarm Optimizer ◽  
De Algorithm ◽  
Local Optimal Solution

Aimed at solving the problems of poor stability and easily falling into the local optimal solution in the grey wolf optimizer (GWO) algorithm, an improved GWO algorithm based on the differential evolution (DE) algorithm and the OTSU algorithm is proposed (DE-OTSU-GWO). The multithreshold OTSU, Tsallis entropy, and DE algorithm are combined with the GWO algorithm. The multithreshold OTSU algorithm is used to calculate the fitness of the initial population. The population is updated using the GWO algorithm and the DE algorithm through the Tsallis entropy algorithm for crossover steps. Multithreshold OTSU calculates the fitness in the initial population and makes the initial stage basically stable. Tsallis entropy calculates the fitness quickly. The DE algorithm can solve the local optimal solution of GWO. The performance of the DE-OTSU-GWO algorithm was tested using a CEC2005 benchmark function (23 test functions). Compared with existing particle swarm optimizer (PSO) and GWO algorithms, the experimental results showed that the DE-OTSU-GWO algorithm is more stable and accurate in solving functions. In addition, compared with other algorithms, a convergence behavior analysis proved the high quality of the DE-OTSU-GWO algorithm. In the results of classical agricultural image recognition problems, compared with GWO, PSO, DE-GWO, and 2D-OTSU-FA, the DE-OTSU-GWO algorithm had accuracy in straw image recognition and is applicable to practical problems. The OTSU algorithm improves the accuracy of the overall algorithm while increasing the running time. After adding the DE algorithm, the time complexity will increase, but the solution time can be shortened. Compared with GWO, DE-GWO, PSO, and 2D-OTSU-FA, the DE-OTSU-GWO algorithm has better results in segmentation assessment.

Enhanced Directed Differential Evolution Algorithm for Solving Constrained Engineering Optimization Problems

2019 ◽  
Vol 10 (1) ◽  
pp. 1-28 ◽  
Author(s):  
Ali Wagdy Mohamed ◽  
Ali Khater Mohamed ◽  
Ehab Z. Elfeky ◽  
Mohamed Saleh
Keyword(s):  
Differential Evolution ◽  
Optimization Problems ◽  
Differential Evolution Algorithm ◽  
Test Problems ◽  
New Mutation ◽  
De Algorithm ◽  
Engineering Problems ◽  
Evolution Algorithm ◽  
Mutation Scheme ◽  
Exploration Exploitation

The performance of Differential Evolution is significantly affected by the mutation scheme, which attracts many researchers to develop and enhance the mutation scheme in DE. In this article, the authors introduce an enhanced DE algorithm (EDDE) that utilizes the information given by good individuals and bad individuals in the population. The new mutation scheme maintains effectively the exploration/exploitation balance. Numerical experiments are conducted on 24 test problems presented in CEC'2006, and five constrained engineering problems from the literature for verifying and analyzing the performance of EDDE. The presented algorithm showed competitiveness in some cases and superiority in other cases in terms of robustness, efficiency and quality the of the results.

A Hybrid Differential Evolution Algorithm for Binary CSPs

2010 ◽  
Vol 108-111 ◽  
pp. 328-334 ◽  
Author(s):  
Hong Jie Fu
Keyword(s):  
Differential Evolution ◽  
Mutation Rate ◽  
Differential Evolution Algorithm ◽  
Premature Convergence ◽  
De Algorithm ◽  
Wrong Direction ◽  
Adaptive Adjustment ◽  
Evolution Algorithm

A novel hybrid elements exchange/electromagnetism meta-heuristic differential evolution algorithm, named EEMDE, is proposed in this paper, avoiding the premature convergence of original DE algorithm. A metric to measure the Simplification of force exerted on a point is defined as the mutation rate F in the EEMDE, which is used to get an adaptive adjustment of F. EEMDE may produce slight disturbance on the original vector for enhancing the exploring capacity and avoid the DE to the "uphill" in the wrong direction forward. Experiments demonstrate that the convergence of EEMDE is faster than DE and simulations based on some CSPs express the effectiveness, efficiency and robustness of it.

Sign in / Sign up

Export Citation Format

Share Document