Differential evolution with two-level parameter adaptation

An investigation of how specimen dimensions affect biaxial mechanical characterizations with CellScale BioTester and constitutive modeling of porcine tricuspid valve leaflets

Biaxial mechanical characterizations are the accepted approach to determine the mechanical response of many biological soft tissues. Although several computational and experimental studies have examined how experimental factors (e.g., clamped vs. suture mounting) affect the acquired tissue mechanical behavior, little is known about the role of specimen dimensions in data acquisition and the subsequent modeling. In this study, we combined our established mechanical characterization framework with an iterative size-reduction protocol to test the hypothesis that specimen dimensions affect the observed mechanical behavior of biaxial characterizations. Our findings indicated that there were non-significant differences in the peak equibiaxial stretches of tricuspid valve leaflets across four specimen dimensions ranging from 4.5×4.5mm to 9 × 9mm. Further analyses revealed that there were significant differences in the low-tensile modulus of the circumferential tissue direction. These differences resulted in significantly different constitutive model parameters for the Tong-Fung model between different specimen dimensions of the posterior and septal leaflets. Overall, our findings demonstrate that specimen dimensions play an important role in experimental characterizations, but not necessarily in constitutive modeling of soft tissue mechanical behavior during biaxial testing with the commercial CellScale BioTester.

Differential evolution for population diversity mechanism based on covariance matrix

Differential evolution (DE) is a heuristic global search algorithm based on population. It has exhibited great adaptability in solving continuous-domain problems, but sometimes suffered from insufficient local search ability and being trapped in local optimum when dealing with complicated optimization problems. To solve these problems, an improved differential evolution algorithm with population diversity mechanism based on covariance matrix (CM-DE) is proposed. First, a new parameter adaptation strategy is used to adapt the control parameters, in which the scale factor F is updated according to the improved wavelet basis function in the early stage and Cauchy distribution in the later stage and the crossover rate CR is generated according to normal distribution. The diversity of population and convergence speed are improved by employing the method above. Second, the perturbation strategy is incorporated into crossover operator to enhance the search ability of DE. Finally, the covariance matrix of the population is constructed, where the variance in the covariance matrix is used as indicator to measure the similarity between individuals in the population in order to prevent the algorithm from falling into local optimum resulted by low population diversity. The CM-DE is compared with the state-of-art DE variants including LSHADE (Tanabe and Fukunaga, 2014), jSO [1], LPalmDE [2], PaDE [3] and LSHADE-cnEpSin [4] under 88 test functions from CEC2013 [5], CEC2014 [6] and CEC2017 (Wu et al., 2017) test suites. From the experiment results, it is obvious that among 30 benchmark functions from CEC2017 on 50D optimization, the CM-DE algorithm has 22, 20, 24, 23, 28 better performances comparing with LSHADE, jSO, LPalmDE, PaDE, and LSHADE-cnEpsin. For CEC2017 on 30D optimization, the proposed algorithm secures better performance on 19 out of 30 benchmark functions in terms of convergence speed. In addition, a real-world application is also used to verify the feasibility of the proposed algorithm. The experiment results validate the highly competitive performance in terms of solution accuracy and convergence speed.

FD-DE: Differential Evolution with fitness deviation based adaptation in parameter control

Differential Evolution (DE) is arguably one of the most powerful stochastic optimization algorithms for different optimization applications, however, even the state-of-the-art DE variants still have many weaknesses. In this study, a new powerful DE variant for single-objective numerical optimization is proposed, and there are several contributions within it: First, an enhanced wavelet basis function is proposed to generate scale factor F of each individual in the first stage of the evolution; Second, a hybrid trial vector generation strategy with perturbation and t-distribution is advanced to generate different trial vectors regarding different stages of the evolution; Third, a fitness deviation based parameter control is proposed for the adaptation of control parameters; Fourth, a novel diversity indicator is proposed and a restart scheme can be launched if necessary when the quality of the individuals is detected bad. The novel algorithm is validated using a large test suite containing 130 benchmarks from the universal test suites on single-objective numerical optimization, and the results approve the big improvement in comparison with several well-known state-of-the-art DE variants. Moreover, our algorithm is also validated under real-world optimization applications, and the results also support its superiority.

A hybridizing-enhanced differential evolution for optimization

Differential evolution (DE) belongs to the most usable optimization algorithms, presented in many improved and modern versions in recent years. Generally, the low convergence rate is the main drawback of the DE algorithm. In this article, the gray wolf optimizer (GWO) is used to accelerate the convergence rate and the final optimal results of the DE algorithm. The new resulting algorithm is called Hunting Differential Evolution (HDE). The proposed HDE algorithm deploys the convergence speed of the GWO algorithm as well as the appropriate searching capability of the DE algorithm. Furthermore, by adjusting the crossover rate and mutation probability parameters, this algorithm can be adjusted to pay closer attention to the strengths of each of these two algorithms. The HDE/current-to-rand/1 performed the best on CEC-2019 functions compared to the other eight variants of HDE. HDE/current-to-best/1 is also chosen as having superior performance to other proposed HDE compared to seven improved algorithms on CEC-2014 functions, outperforming them in 15 test functions. Furthermore, jHDE performs well by improving in 17 functions, compared with jDE on these functions. The simulations indicate that the proposed HDE algorithm can provide reliable outcomes in finding the optimal solutions with a rapid convergence rate and avoiding the local minimum compared to the original DE algorithm.

Optimizing Niche Center for Multimodal Optimization Problems

Many real-world optimization problems require searching for multiple optimal solutions simultaneously, which are called multimodal optimization problems (MMOPs). For MMOPs, the algorithm is required both to enlarge population diversity for locating more global optima and to enhance refine ability for increasing the accuracy of the obtained solutions. Thus, numerous niching techniques have been proposed to divide the population into different niches, and each niche is responsible for searching on one or more peaks. However, it is often a challenge to distinguish proper individuals as niche centers in existing niching approaches, which has become a key issue for efficiently solving MMOPs. In this article, the niche center distinguish (NCD) problem is treated as an optimization problem and an NCD-based differential evolution (NCD-DE) algorithm is proposed. In NCD-DE, the niches are formed by using an internal genetic algorithm (GA) to online solve the NCD optimization problem. In the internal GA, a fitness-entropy measurement objective function is designed to evaluate whether a group of niche centers (i.e., encoded by a chromosome in the internal GA) is promising. Moreover, to enhance the exploration and exploitation abilities of NCD-DE in solving the MMOPs, a niching and global cooperative mutation strategy that uses both niche and population information is proposed to generate new individuals. The proposed NCD-DE is compared with some state-of-the-art and recent well-performing algorithms. The experimental results show that NCD-DE achieves better or competitive performance on both the accuracy and completeness of the solutions than the compared algorithms.

Differential Evolution and Its Applications in Image Processing Problems: A Comprehensive Review

Differential evolution (DE) is one of the highly acknowledged population-based optimization algorithms due to its simplicity, user-friendliness, resilience, and capacity to solve problems. DE has grown steadily since its beginnings due to its ability to solve various issues in academics and industry. Different mutation techniques and parameter choices influence DE's exploration and exploitation capabilities, motivating academics to continue working on DE. This survey aims to depict DE's recent developments concerning parameter adaptations, parameter settings and mutation strategies, hybridizations, and multi-objective variants in the last twelve years. It also summarizes the problems solved in image processing by DE and its variants.

Linking the region-specific tissue microstructure to the biaxial mechanical properties of the porcine left anterior descending artery

Coronary atherosclerosis is the main cause of death worldwide. Advancing the understanding of coronary microstructure-based mechanics is fundamental for the development of therapeutic tools and surgical procedures. Although the passive biaxial properties of the coronary arteries have been extensively explored, their regional differences and the relationship between tissue microstructure and mechanics have not been fully characterized. In this study, we characterized the passive biaxial mechanical properties and microstructural properties of the proximal, medial, and distal regions of the porcine left anterior descending artery (LADA). We also attempted to relate the biaxial stress-stretch response of the LADA and its respective birefringent responses to the polarized light for obtaining information about the load-dependent microstructural variations. We found that the LADA extensibility is reduced in the proximal-to-distal direction and that the medial region exhibits more heterogeneous mechanical behavior than the other two regions. We have also observed highly dynamic microstructural behavior where fiber families realign themselves depending on loading. In addition, we found that the microstructure of the distal region exhibited highly aligned fibers along the longitudinal axis of the artery. To verify this microstructural feature, we imaged the LADA specimens with multi-photon microscopy and observed that the adventitia microstructure transitioned from a random fiber network in the proximal region to highly aligned fibers in the distal region. Our findings could offer new perspectives for understanding coronary mechanics and aid in the development of tissue-engineered vascular grafts, which are currently limited due to their mismatch with native tissue in terms of mechanical properties and microstructural features. STATEMENT OF SIGNIFICANCE: The tissue biomechanics of coronary arteries is fundamental for the development of revascularization techniques such as coronary artery bypass. These therapeutics require a deep understanding of arterial mechanics, microstructure, and mechanobiology to prevent graft failure and reoperation. The present study characterizes the unique regional mechanical and microstructural properties of the porcine left anterior descending artery using biaxial testing, polarized-light imaging, and confocal microscopy. This comprehensive characterization provides an improved understanding of the collagen/elastin architecture in response to mechanical loads using a region-specific approach. The unique tissue properties obtained from this study will provide guidance for the selection of anastomotic sites in coronary artery bypass grafting and for the design of tissue-engineered vascular grafts.

Adaptive Differential Evolution Algorithm Based on Fitness Landscape Characteristic

Differential evolution (DE) is a simple, effective, and robust algorithm, which has demonstrated excellent performance in dealing with global optimization problems. However, different search strategies are designed for different fitness landscape conditions to find the optimal solution, and there is not a single strategy that can be suitable for all fitness landscapes. As a result, developing a strategy to adaptively steer population evolution based on fitness landscape is critical. Motivated by this fact, in this paper, a novel adaptive DE based on fitness landscape (FL-ADE) is proposed, which utilizes the local fitness landscape characteristics in each generation population to (1) adjust the population size adaptively; (2) generate DE/current-to-pcbest mutation strategy. The adaptive mechanism is based on local fitness landscape characteristics of the population and enables to decrease or increase the population size during the search. Due to the adaptive adjustment of population size for different fitness landscapes and evolutionary processes, computational resources can be rationally assigned at different evolutionary stages to satisfy diverse requirements of different fitness landscapes. Besides, the DE/current-to-pcbest mutation strategy, which randomly chooses one of the top p% individuals from the archive cbest of local optimal individuals to be the pcbest, is also an adaptive strategy based on fitness landscape characteristic. Using the individuals that are approximated as local optimums increases the algorithm’s ability to explore complex multimodal functions and avoids stagnation due to the use of individuals with good fitness values. Experiments are conducted on CEC2014 benchmark test suit to demonstrate the performance of the proposed FL-ADE algorithm, and the results show that the proposed FL-ADE algorithm performs better than the other seven highly performing state-of-art DE variants, even the winner of the CEC2014 and CEC2017. In addition, the effectiveness of the adaptive population mechanism and DE/current-to-pcbest mutation strategy based on landscape fitness proposed in this paper are respectively verified.

Multiscale modeling of passive material influences on deformation and force output of skeletal muscles

Passive materials in human skeletal muscle tissues play an important role in force output of skeletal muscles. This paper introduces a multiscale modeling framework to investigate how age-associated variations on microscale passive muscle components, including microstructural geometry (e.g., connective tissue thickness) and material properties (e.g., anisotropy), influence the force output and deformations of the continuum skeletal muscle. We first define a representative volume element (RVE) for the microstructure of muscle and determine the homogenized macroscale mechanical properties of the RVE from the separate mechanical properties of the individual components of the RVE, including muscle fibers and connective tissue with its associated collagen fibers. The homogenized properties of the RVE are then used to define the elements of the continuum muscle model to evaluate the force output and deformations of the whole muscle. Conversely, the regional deformations of the continuum model are fed back to the RVE model to determine the responses of the individual microscale components. Simulations of muscle isometric contractions at a range of muscle lengths are performed to investigate the effects of muscle architectural changes (e.g., pennation angles) due to aging on force output and muscle deformation. The correlations between the pennation angle, the shear deformation in the microscale connective tissue (an indicator for the lateral force transmission), the angle difference between the fiber direction and principal strain direction and the resulting shear deformation at the continuum scale, as well as the force output of the skeletal muscle are also discussed.

Evolutionary Optimization Under Uncertainty: The Strategies to Handle Varied Constraints for Fluid Catalytic Cracking Operation

This article studies an operational optimization problem of the fluid catalytic cracking (FCC) unit under uncertainty. The objective of this problem is to quickly reoptimize the operating variables that control the operational condition of the FCC unit when fossil fuel yield constraints or prices change. To solve this problem, based on the challenges caused by the varied constraints, we establish a mathematical model and propose a fast adaptive differential evolution algorithm with an adaptive mutation strategy, a parameter adaptation strategy, a repaired strategy, and an enhanced strategy. In the proposed algorithm, we integrate the status information of each solution into the mutation strategy and parameter adaptation scheme to search for the best solution in the irregular feasible region of the operating variables. In addition, a repaired strategy is proposed to repair the infeasible operating variables with unknown bounds, and an enhanced strategy is presented to further improve the objective function value of the best solution. The experimental results on ten test scenarios with different fossil fuel yield constraints and prices demonstrate the robustness of the proposed algorithm for optimizing the operating variables of the FCC unit under uncertainty.

A novel adaptive momentum method for medical image classification using convolutional neural network

Background

AI for medical diagnosis has made a tremendous impact by applying convolutional neural networks (CNNs) to medical image classification and momentum plays an essential role in stochastic gradient optimization algorithms for accelerating or improving training convolutional neural networks. In traditional optimizers in CNNs, the momentum is usually weighted by a constant. However, tuning hyperparameters for momentum can be computationally complex. In this paper, we propose a novel adaptive momentum for fast and stable convergence.

Method

Applying adaptive momentum rate proposes increasing or decreasing based on every epoch's error changes, and it eliminates the need for momentum hyperparameter optimization. We tested the proposed method with 3 different datasets: REMBRANDT Brain Cancer, NIH Chest X-ray, COVID-19 CT scan. We compared the performance of a novel adaptive momentum optimizer with Stochastic gradient descent (SGD) and other adaptive optimizers such as Adam and RMSprop.

Results

Proposed method improves SGD performance by reducing classification error from 6.12 to 5.44%, and it achieved the lowest error and highest accuracy compared with other optimizers. To strengthen the outcomes of this study, we investigated the performance comparison for the state-of-the-art CNN architectures with adaptive momentum. The results shows that the proposed method achieved the highest with 95% compared to state-of-the-art CNN architectures while using the same dataset. The proposed method improves convergence performance by reducing classification error and achieves high accuracy compared with other optimizers.

Determination of a Strain Energy Density Function for the Tricuspid Valve Leaflets Using Constant Invariant-Based Mechanical Characterizations

The tricuspid valve (TV) regulates the blood flow within the right side of the heart. Despite recent improvements in understanding TV mechanical and microstructural properties, limited attention has been devoted to the development of TV-specific constitutive models. The objective of this work is to use the first-of-its-kind experimental data from constant invariant-based mechanical characterizations to determine a suitable invariant-based strain energy density function (SEDF). Six specimens for each TV leaflet are characterized using constant invariant mechanical testing. The data is then fit with three candidate SEDF forms: (i) a polynomial model-the transversely isotropic version of the Mooney-Rivlin model, (ii) an exponential model, and (iii) a combined polynomial-exponential model. Similar fitting capabilities were found for the exponential and the polynomial forms (R2=0.92-0.99 versus 0.91-0.97) compared to the combined polynomial-exponential SEDF (R2=0.65-0.95). Furthermore, the polynomial form had larger Pearson's correlation coefficients than the exponential form (0.51 versus 0.30), indicating a more well-defined search space. Finally, the exponential and the combined polynomial-exponential forms had notably smaller but more eccentric model parameter's confidence regions than the polynomial form. Further evaluations of invariant decoupling revealed that the decoupling of the invariant terms within the exponential form leads to a less satisfactory performance. From these results, we conclude that the exponential form is better suited for the TV leaflets owing to its superb fitting capabilities and smaller parameter's confidence regions.

Linking collagen fiber architecture to tissue-level biaxial mechanical behaviors of porcine semilunar heart valve cusps

The semilunar heart valves regulate the blood flow from the ventricles to the major arteries through the opening and closing of the scallop shaped cusps. These cusps are composed of collagen fibers that act as the primary loading-bearing component. The load-dependent collagen fiber architecture has been previously examined in the existing literature; however, these studies relied on chemical clearing and tissue modifications to observe the underlying changes in response to mechanical loads. In the present study, we address this gap in knowledge by quantifying the collagen fiber orientations and alignments of the aortic and pulmonary cusps through a multi-scale, non-destructive experimental approach. This opto-mechanical approach, which combines polarized spatial frequency domain imaging and biaxial mechanical testing, provides a greater field of view (10-25mm) and faster imaging time (45-50s) than other traditional collagen imaging techniques. The birefringent response of the collagen fibers was fit with a von Mises distribution, while the biaxial mechanical testing data was implemented into a modified full structural model for further analysis. Our results showed that the semilunar heart valve cusps are more extensible in the tissue's radial direction than the circumferential direction under all the varied biaxial testing protocols, together with greater material anisotropy among the pulmonary valve cusps compared to the aortic valve cusps. The collagen fibers were shown to reorient towards the direction of the greatest applied loading and incrementally realign with the increased applied stress. The collagen fiber architecture within the aortic valve cusps were found to be more homogeneous than the pulmonary valve counterparts, reflecting the differences in the physiological environments experienced by these two semilunar heart valves. Further, the von Mises distribution fitting highlighted the presence and contribution of two distinct fiber families for each of the two semilunar heart valves. The results from this work would provide valuable insight into connecting tissue-level mechanics to the underlying collagen fiber architecture-an essential information for the future development of high-fidelity aortic/pulmonary valve computational models.

Wind Power Forecasting with Deep Learning Networks: Time-Series Forecasting

Studies have demonstrated that changes in the climate affect wind power forecasting under different weather conditions. Theoretically, accurate prediction of both wind power output and weather changes using statistics-based prediction models is difficult. In practice, traditional machine learning models can perform long-term wind power forecasting with a mean absolute percentage error (MAPE) of 10% to 17%, which does not meet the engineering requirements for our renewable energy project. Deep learning networks (DLNs) have been employed to obtain the correlations between meteorological features and power generation using a multilayer neural convolutional architecture with gradient descent algorithms to minimize estimation errors. This has wide applicability to the field of wind power forecasting. Therefore, this study aimed at the long-term (24–72-h ahead) prediction of wind power with an MAPE of less than 10% by using the Temporal Convolutional Network (TCN) algorithm of DLNs. In our experiment, we performed TCN model pretraining using historical weather data and the power generation outputs of a wind turbine from a Scada wind power plant in Turkey. The experimental results indicated an MAPE of 5.13% for 72-h wind power prediction, which is adequate within the constraints of our project. Finally, we compared the performance of four DLN-based prediction models for power forecasting, namely, the TCN, long short-term memory (LSTM), recurrent neural network (RNN), and gated recurrence unit (GRU) models. We validated that the TCN outperforms the other three models for wind power prediction in terms of data input volume, stability of error reduction, and forecast accuracy.

Adaptive Granularity Learning Distributed Particle Swarm Optimization for Large-Scale Optimization

Large-scale optimization has become a significant and challenging research topic in the evolutionary computation (EC) community. Although many improved EC algorithms have been proposed for large-scale optimization, the slow convergence in the huge search space and the trap into local optima among massive suboptima are still the challenges. Targeted to these two issues, this article proposes an adaptive granularity learning distributed particle swarm optimization (AGLDPSO) with the help of machine-learning techniques, including clustering analysis based on locality-sensitive hashing (LSH) and adaptive granularity control based on logistic regression (LR). In AGLDPSO, a master-slave multisubpopulation distributed model is adopted, where the entire population is divided into multiple subpopulations, and these subpopulations are co-evolved. Compared with other large-scale optimization algorithms with single population evolution or centralized mechanism, the multisubpopulation distributed co-evolution mechanism will fully exchange the evolutionary information among different subpopulations to further enhance the population diversity. Furthermore, we propose an adaptive granularity learning strategy (AGLS) based on LSH and LR. The AGLS is helpful to determine an appropriate subpopulation size to control the learning granularity of the distributed subpopulations in different evolutionary states to balance the exploration ability for escaping from massive suboptima and the exploitation ability for converging in the huge search space. The experimental results show that AGLDPSO performs better than or at least comparable with some other state-of-the-art large-scale optimization algorithms, even the winner of the competition on large-scale optimization, on all the 35 benchmark functions from both IEEE Congress on Evolutionary Computation (IEEE CEC2010) and IEEE CEC2013 large-scale optimization test suites.

A pilot study on biaxial mechanical, collagen microstructural, and morphological characterizations of a resected human intracranial aneurysm tissue

Intracranial aneurysms (ICAs) are focal dilatations that imply a weakening of the brain artery. Incidental rupture of an ICA is increasingly responsible for significant mortality and morbidity in the American’s aging population. Previous studies have quantified the pressure-volume characteristics, uniaxial mechanical properties, and morphological features of human aneurysms. In this pilot study, for the first time, we comprehensively quantified the mechanical, collagen fiber microstructural, and morphological properties of one resected human posterior inferior cerebellar artery aneurysm. The tissue from the dome of a right posterior inferior cerebral aneurysm was first mechanically characterized using biaxial tension and stress relaxation tests. Then, the load-dependent collagen fiber architecture of the aneurysm tissue was quantified using an in-house polarized spatial frequency domain imaging system. Finally, optical coherence tomography and histological procedures were used to quantify the tissue’s microstructural morphology. Mechanically, the tissue was shown to exhibit hysteresis, a nonlinear stress-strain response, and material anisotropy. Moreover, the unloaded collagen fiber architecture of the tissue was predominantly aligned with the testing Y-direction and rotated towards the X-direction under increasing equibiaxial loading. Furthermore, our histological analysis showed a considerable damage to the morphological integrity of the tissue, including lack of elastin, intimal thickening, and calcium deposition. This new unified characterization framework can be extended to better understand the mechanics-microstructure interrelationship of aneurysm tissues at different time points of the formation or growth. Such specimen-specific information is anticipated to provide valuable insight that may improve our current understanding of aneurysm growth and rupture potential.

Manifold learning based data-driven modeling for soft biological tissues

Data-driven modeling directly utilizes experimental data with machine learning techniques to predict a material's response without the necessity of using phenomenological constitutive models. Although data-driven modeling presents a promising new approach, it has yet to be extended to the modeling of large-deformation biological tissues. Herein, we extend our recent local convexity data-driven (LCDD) framework (He and Chen, 2020) to model the mechanical response of a porcine heart mitral valve posterior leaflet. The predictability of the LCDD framework by using various combinations of biaxial and pure shear training protocols are investigated, and its effectiveness is compared with a full structural, phenomenological model modified from Zhang et al. (2016) and a continuum phenomenological Fung-type model (Tong and Fung, 1976). We show that the predictivity of the proposed LCDD nonlinear solver is generally less sensitive to the type of loading protocols (biaxial and pure shear) used in the data set, while more sensitive to the insufficient coverage of the experimental data when compared to the predictivity of the two selected phenomenological models. While no pre-defined functional form in the material model is necessary in LCDD, this study reinstates the importance of having sufficiently rich data coverage in the date-driven and machine learning type of approaches. It is also shown that the proposed LCDD method is an enhancement over the earlier distance-minimization data-driven (DMDD) against noisy data. This study demonstrates that when sufficient data is available, data-driven computing can be an alternative method for modeling complex biological materials.

Underestimation-Assisted Global-Local Cooperative Differential Evolution and the Application to Protein Structure Prediction

Various mutation strategies show distinct advantages in differential evolution (DE). The cooperation of multiple strategies in the evolutionary process may be effective. This paper presents an underestimation-assisted global and local cooperative DE to simultaneously enhance the effectiveness and efficiency. In the proposed algorithm, two phases, namely, the global exploration and the local exploitation, are performed in each generation. In the global phase, a set of trial vectors is produced for each target individual by employing multiple strategies with strong exploration capability. Afterward, an adaptive underestimation model with a self-adapted slope control parameter is proposed to evaluate these trial vectors, the best of which is selected as the candidate. In the local phase, the better-based strategies guided by individuals that are better than the target individual are designed. For each individual accepted in the global phase, multiple trial vectors are generated by using these strategies and filtered by the underestimation value. The cooperation between the global and local phases includes two aspects. First, both of them concentrate on generating better individuals for the next generation. Second, the global phase aims to locate promising regions quickly while the local phase serves as a local search for enhancing convergence. Moreover, a simple mechanism is designed to determine the parameter of DE adaptively in the searching process. Finally, the proposed approach is applied to predict the protein 3D structure. Experimental studies on classical benchmark functions, CEC test sets, and protein structure prediction problem show that the proposed approach is superior to the competitors.

Reviewing and Benchmarking Parameter Control Methods in Differential Evolution

Many differential evolution (DE) algorithms with various parameter control methods (PCMs) have been proposed. However, previous studies usually considered PCMs to be an integral component of a complex DE algorithm. Thus, the characteristics and performance of each method are poorly understood. We present an in-depth review of 24 PCMs for the scale factor and crossover rate in DE and a large-scale benchmarking study. We carefully extract the 24 PCMs from their original, complex algorithms and describe them according to a systematic manner. Our review facilitates the understanding of similarities and differences between existing, representative PCMs. The performance of DEs with the 24 PCMs and 16 variation operators is investigated on 24 black-box benchmark functions. Our benchmarking results reveal which methods exhibit high performance when embedded in a standardized framework under 16 different conditions, independent from their original, complex algorithms. We also investigate how much room there is for further improvement of PCMs by comparing the 24 methods with an oracle-based model, which can be considered to be a conservative lower bound on the performance of an optimal method.

Adaptive Distributed Differential Evolution

Due to the increasing complexity of optimization problems, distributed differential evolution (DDE) has become a promising approach for global optimization. However, similar to the centralized algorithms, DDE also faces the difficulty of strategies' selection and parameters' setting. To deal with such problems effectively, this article proposes an adaptive DDE (ADDE) to relieve the sensitivity of strategies and parameters. In ADDE, three populations called exploration population, exploitation population, and balance population are co-evolved concurrently by using the master-slave multipopulation distributed framework. Different populations will adaptively choose their suitable mutation strategies based on the evolutionary state estimation to make full use of the feedback information from both individuals and the whole corresponding population. Besides, the historical successful experience and best solution improvement are collected and used to adaptively update the individual parameters (amplification factor F and crossover rate CR) and population parameter (population size N), respectively. The performance of ADDE is evaluated on all 30 widely used benchmark functions from the CEC 2014 test suite and all 22 widely used real-world application problems from the CEC 2011 test suite. The experimental results show that ADDE has great superiority compared with the other state-of-the-art DDE and adaptive differential evolution variants.

Dual-Subpopulation as reciprocal optional external archives for differential evolution

Differential Evolution (DE) is powerful for global optimization problems. Among DE algorithms, JADE and its variants, whose mutation strategy is DE/current-to-pbest/1 with optional archive, have good performance. A significant feature of the above mutation strategy is that one individual for difference operation comes from the union of the optional external archive and the population. In existing DE algorithms based on the mutation strategy—JADE and its variants, individuals eliminated from the population are send to the archive. In this paper, we propose a scheme for managing the optional external archive. According to our scheme, two subpopulations are maintained in the population. Each of them regards the other as the archive. In experiments, our scheme is applied in JADE and two of its variants—SHADE and L-SHADE. Experimental results show that our scheme can enhance JADE and its variants. Moreover, it can be seen that L-SHADE with our scheme performs significantly better than four DE algorithms, CoBiDE, MPEDE, EDEV, and MLCCDE.

Parameter Combination Framework for the Differential Evolution Algorithm

The differential evolution (DE) algorithm is a popular and efficient evolutionary algorithm that can be used for single objective real-parameter optimization. Its performance is greatly affected by its parameters. Generally, parameter control strategies involve determining the most suitable value for the current state; there is only a little research on parameter combination and parameter distribution which is also useful for improving algorithm performance. This paper proposes an idea to use parameter region division and parameter strategy combination to flexibly adjust the parameter distribution. Based on the idea, a group-based two-level parameter combination framework is designed to support various modes of parameter combination, and enrich the parameter distribution characteristics. Under this framework, two customized parameter combination strategies are given for a single-operation DE algorithm and a multi-operation DE algorithm. The experiments verify the effectiveness of the two strategies and it also illustrates the meaning of the framework.

Differential Evolution With Underestimation-Based Multimutation Strategy

As we know, the performance of differential evolution (DE) highly depends on the mutation strategy. However, it is difficult to choose a suitable mutation strategy for a specific problem or different running stages. This paper proposes an underestimation-based multimutation strategy (UMS) for DE. In the UMS, a set of candidate offsprings are simultaneously generated for each target individual by utilizing multiple mutation strategies. Then a cheap abstract convex underestimation model is built based on some selected individuals to obtain the underestimation value of each candidate offspring. According to the quality of each candidate offspring measured by the underestimation value, the most promising candidate solution is chosen as the offspring. Compared to the existing probability-based multimutation techniques, no mutation strategies are lost during the search process as each mutation strategy has the same probability to generate a candidate solution. Moreover, no extra function evaluations are produced because the candidate solutions are filtered by the underestimation value. The UMS is integrated into some DE variants and compared with their original algorithms and several advanced DE approaches over the CEC 2013 and 2014 benchmark sets. Additionally, a well-known real-world problem is employed to evaluate the performance of the UMS. Experimental results show that the proposed UMS can improve the performance of the advanced DE variants.

Set-Based Discrete Particle Swarm Optimization Based on Decomposition for Permutation-Based Multiobjective Combinatorial Optimization Problems

This paper studies a specific class of multiobjective combinatorial optimization problems (MOCOPs), namely the permutation-based MOCOPs. Many commonly seen MOCOPs, e.g., multiobjective traveling salesman problem (MOTSP), multiobjective project scheduling problem (MOPSP), belong to this problem class and they can be very different. However, as the permutation-based MOCOPs share the inherent similarity that the structure of their search space is usually in the shape of a permutation tree, this paper proposes a generic multiobjective set-based particle swarm optimization methodology based on decomposition, termed MS-PSO/D. In order to coordinate with the property of permutation-based MOCOPs, MS-PSO/D utilizes an element-based representation and a constructive approach. Through this, feasible solutions under constraints can be generated step by step following the permutation-tree-shaped structure. And problem-related heuristic information is introduced in the constructive approach for efficiency. In order to address the multiobjective optimization issues, the decomposition strategy is employed, in which the problem is converted into multiple single-objective subproblems according to a set of weight vectors. Besides, a flexible mechanism for diversity control is provided in MS-PSO/D. Extensive experiments have been conducted to study MS-PSO/D on two permutation-based MOCOPs, namely the MOTSP and the MOPSP. Experimental results validate that the proposed methodology is promising.