Cryopreservation of Drosophila melanogaster embryonic nuclei in a Dimethyl sulfoxide (ME2SO)-free solution.

Comparison of survival rate of cleavage stage embryos produced from in vitro maturation cycles after slow freezing and after vitrification

Mobile manipulator robots have become important pieces of equipment due to the high mobility of mobile subsystems and the high flexibility of manipulator subsystems. Considering the increasing degrees of freedom and the need to avoid singular locations, one of the most challenging problems is solving the inverse kinematics problem of mobile manipulator robots (IKMM). Of all the popular optimization algorithms, the differential evolution (DE) algorithm is the most effective method for quickly solving the IKMM problem with sufficient solutions. Currently, many strategies have been proposed for DE algorithms to improve the performance of solving mathematical problems; some symmetry strategies or symmetry functions have been introduced to DE algorithms. However, the effects of various DE algorithms on solving the actual IKMM lack a comprehensive explanation. Therefore, we divide various DE algorithms into three categories considering the control parameter selection and compare the specific optimization of various DE algorithms. Then, we compare the performance of various DE algorithms when solving the inverse kinematics problems of mobile manipulators with different degrees of freedom. Considering the effectiveness and the speed of the DE algorithm on the IKMM problem, we determine the best DE algorithm by comparing the error and time required to reach 100 random mission points and tracking the typical trajectories. Finally, the best-performing DE method is further improved by studying the selection of fundamental parameters in the best DE algorithm. Valuable conclusions are obtained from these experimental simulations, which can help with choosing an algorithm that is suitable for solving the inverse kinematics problem of mobile manipulator robots in practice.

Clinical-pregnancy outcome after vitrification of blastocysts produced from in vitro maturation cycles

In this paper, we propose a triple comparison-based interactive differential evolution (IDE) algorithm and a differential evolution (DE) algorithm. The comparison of target vector and trial vector supports a local fitness landscape for IDE and DE algorithms to conduct a memetic search. In addition to the target vector and trial vector used in canonical IDE and DE algorithm frameworks, we conduct a memetic search around whichever vector has better fitness. We use a random number from a normal distribution generator or a uniform distribution generator to perturb the vector, thereby generating a third vector. By comparing the target vector, the trial vector, and the third vector, we implement a triple comparison mechanism in IDE and DE algorithms. Our proposed triple comparison-based IDE and DE algorithms show significantly better optimisation performance arising from the evaluation results. We also investigate potential issues arising from our proposal and discuss some open topics and future opportunities.

In this paper, we propose a triple comparison-based interactive differential evolution (IDE) algorithm and a differential evolution (DE) algorithm. The comparison of target vector and trial vector supports a local fitness landscape for IDE and DE algorithms to conduct a memetic search. In addition to the target vector and trial vector used in canonical IDE and DE algorithm frameworks, we conduct a memetic search around whichever vector has better fitness. We use a random number from a normal distribution generator or a uniform distribution generator to perturb the vector, thereby generating a third vector. By comparing the target vector, the trial vector, and the third vector, we implement a triple comparison mechanism in IDE and DE algorithms. Our proposed triple comparison-based IDE and DE algorithms show significantly better optimisation performance arising from the evaluation results. We also investigate potential issues arising from our proposal and discuss some open topics and future opportunities.

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.

Postseismic global positioning system (GPS) time series are of fundamental importance for investigating the physical mechanisms of postseismic deformations, as well as the construction and maintenance of terrestrial reference frames. Particularly, methods for constructing accurate fitting models for such time series are critical. Based on the physical features of postseismic deformation models, we propose a new algorithm that combines the strengths of the Levenberg–Marquardt (LM) and differential evolution (DE) algorithms, that is, the LM + DE algorithm. In this algorithm, the parameters are initialised by the constrained DE algorithm; the final parameters of the postseismic model are then solved by the LM algorithm. To validate the proposed method, DE, LM, and LM + DE were compared using synthetic and observational data from the 2011 Tohoku Earthquake. For all tests based on synthetic data, the LM + DE algorithm consistently converged to the global solution and the residual is small, regardless of how the independent parameter was varied. In the 2011 Tohoku earthquake, the parameters calculated by the LM + DE algorithm matched consistently for the global solution with a 100% passing rate after constraints were provided for the ratios of the initial relaxation time parameters. In contrast, the LM and DE algorithms individually achieved passing rates of only 22% and 1%, respectively. These results demonstrate that the proposed LM + DE algorithm effectively solves the initial estimate problem in the fitting of nonlinear postseismic models, and also ensures that the fits are mathematically optimal and consistent with physical reality.

Differential evolution (DE) algorithms compose an efficient type of evolutionary algorithm (EA) for the global optimization domain. Although it is well known that the population structure has a major influence on the behavior of EAs, there are few works studying its effect in DE algorithms. In this paper, we propose and analyze several DE variants using different panmictic and decentralized population schemes. As it happens for other EAs, we demonstrate that the population scheme has a marked influence on the behavior of DE algorithms too. Additionally, a new operator for generating the mutant vector is proposed and compared versus a classical one on all the proposed population models. After that, a new heterogeneous decentralized DE algorithm combining the two studied operators in the best performing studied population structure has been designed and evaluated. In total, 13 new DE algorithms are presented and evaluated in this paper. Summarizing our results, all the studied algorithms are highly competitive compared to the state-of-the-art DE algorithms taken from the literature for most considered problems, and the best ones implement a decentralized population. With respect to the population structure, the proposed decentralized versions clearly provide a better performance compared to the panmictic ones. The new mutation operator demonstrates a faster convergence on most of the studied problems versus a classical operator taken from the DE literature. Finally, the new heterogeneous decentralized DE is shown to improve the previously obtained results, and outperform the compared state-of-the-art DEs.

Electroencephalogram (EEG) is the neurophysiologic measurement of the electrical action of the brain, acquired by recording from electrodes located on the scalp. EEG is a vital clinical tool for diagnosing, monitoring and managing neurological disorders. EEG signal is contaminated with various artifacts such as Electroocculogram (EOG), Electrocardiogram (ECG) and Electromyogram (EMG). In this paper, we propose a novel method called ANFIS-DE (Adaptive Neuro Fuzzy Inference System (ANFIS) tuned by Differential Evolution (DE) algorithm) to estimate the artifacts and to extract the EEG signal from stained EEG signal. Differential Evolution (DE) algorithm is used to find the optimum design parameters of ANFIS to achieve better performance and faster convergence with simpler structure. Quantitative analysis of Signal to Noise Ratio and Mean Square Error reveals that ANFIS parameters tuned with Differential Evolution algorithm (ANFIS-DE) outperforms the ANFIS with general hybrid learning algorithm.

The dual-population differential evolution (DDE) algorithm is an optimization technique that simultaneously maintains two populations to balance global and local search. It has been demonstrated to outperform single-population differential evolution algorithms. However, existing improvements to dual-population differential evolution algorithms often overlook the importance of selecting appropriate mutation and selection operators to enhance algorithm performance. In this paper, we propose a dual-population differential evolution (DPDE) algorithm based on a hierarchical mutation and selection strategy. We divided the population into elite and normal subpopulations based on fitness values. Information exchange between the two subpopulations was facilitated through a hierarchical mutation strategy, promoting a balanced exploration–exploitation trade-off in the algorithm. Additionally, this paper presents a new hierarchical selection strategy aimed at improving the population’s capacity to avoid local optima. It achieves this by accepting discarded trial vectors differently compared to previous methods. We expect that the newly introduced hierarchical selection and mutation strategies will work in synergy, effectively harnessing their potential to enhance the algorithm’s performance. Extensive experiments were conducted on the CEC 2017 and CEC 2011 test sets. The results showed that the DPDE algorithm offers competitive performance, comparable to six state-of-the-art differential evolution algorithms.

Dynamic fitness landscape analyses mainly try to figure out the performance of evolutionary algorithms through some simple graphs and effective data. In this paper, we focus on one of evolutionary algorithms named as differential evolution (DE) algorithm. Six benchmark functions we selected because of different properties are involved in our experiments using metrics of dynamic fitness landscape analyses to test. According to experimental results, they shows obviously that differential evolution algorithm can calculate low dimension of benchmark functions and is very hard to handle high dimension. When a benchmark function becomes more and more complicate within higher dimension, sometimes differential evolution algorithm can get good results, but most of time there is no result at all. Dynamic fitness landscape analyses truly obtain experimental results and more details as differential evolution algorithm.

Differential evolution is arguably one of the hottest topics in today's computational intelligence research. This book seeks to present a comprehensive study of the state of the art in this technology and also directions for future research. The fourteen chapters of this book have been written by leading experts in the area. The first seven chapters focus on algorithm design, while the last seven describe real-world applications. Chapter 1 introduces the basic differential evolution (DE) algorithm and presents a broad overview of the field. Chapter 2 presents a new, rotationally invariant DE algorithm. The role of self-adaptive control parameters in DE is investigated in Chapter 3. Chapters 4 and 5 address constrained optimization; the former develops suitable stopping conditions for the DE run, and the latter presents an improved DE algorithm for problems with very small feasible regions. A novel DE algorithm, based on the concept of opposite points, is the topic of Chapter 6. Chapter 7 provides a survey of multi-objective differential evolution algorithms. A review of the major application areas of differential evolution is presented in Chapter 8. Chapter 9 discusses the application of differential evolution in two important areas of applied electromagnetics. Chapters 10 and 11 focus on applications of hybrid DE algorithms to problems in power system optimization. Chapter 12 applies the DE algorithm to computer chess. The use of DE to solve a problem in bioprocess engineering is discussed in Chapter 13. Chapter 14 describes the application of hybrid differential evolution to a problem in control engineering.

In this work, a method to control the parameters of Differential Evolution (DE) algorithm is proposed. Here the control parameters of DE are co-evolved by Particle Swarm Optimization (PSO) algorithm. The classical DE algorithm has two main control parameters: Scale Factor (F) and Cross-over Rate (CR). These are selected on trial-and-error basis for solving optimization problems. Several optimization problems lead to optimal or sub-optimal solution by proper selection of control parameters of the DE algorithm. In this proposed method, PSO algorithm is used to tune the scale factor and cross-over rate in DE algorithm. Basically PSO algorithm is used as a meta-optimizer for DE algorithm. The proposed method is termed as mPSO-DE in this paper. The mPSO-DE algorithm is applied on 12 benchmark unconstrained optimization problems. The obtained results are compared with that of classical DE algorithm. From the experimental studies, it has been found that the proposed mPSO-DE algorithm performed better than DE algorithm.

This paper proposes a novel Two-layer Hierarchical differential evolution (THDE) algorithm to improve the search ability of differential evolution (DE) algorithm. Individuals are separated into bottom layer and top layer. In the bottom layer, individuals are divided into several groups. Modified DE/current-best/1/bin strategy is conducted to produce offspring, where the best individual comes from top layer. In the top layer, modified DE/rand/1/bin strategy is used to update individuals. A set of famous benchmark functions has been used to test and evaluate the performance of the proposed THDE. The experimental results show that the proposed algorithm is better than DE/current-best/1/bin and DE/rand/1/bin and better than or at least comparable to the self-adaptive DE (JDE) and intersect mutation differential evolution algorithm (IMDE) for most functions.

A Preliminary Application of the Differential Evolution Algorithm to Calculate the CNOP