Population-based Evolutionary Algorithm Research Articles

Multi-domain and complex protein structure prediction using inter-domain interactions from deep learning

Accurately capturing domain-domain interactions is key to understanding protein function and designing structure-based drugs. Although AlphaFold2 has made a breakthrough on single domain, it should be noted that the structure modeling for multi-domain protein and complex remains a challenge. In this study, we developed a multi-domain and complex structure assembly protocol, named DeepAssembly, based on domain segmentation and single domain modeling algorithms. Firstly, DeepAssembly uses a population-based evolutionary algorithm to assemble multi-domain proteins by inter-domain interactions inferred from a developed deep learning network. Secondly, protein complexes are assembled by means of domains rather than chains using DeepAssembly. Experimental results show that on 219 multi-domain proteins, the average inter-domain distance precision by DeepAssembly is 22.7% higher than that of AlphaFold2. Moreover, DeepAssembly improves accuracy by 13.1% for 164 multi-domain structures with low confidence deposited in AlphaFold database. We apply DeepAssembly for the prediction of 247 heterodimers. We find that DeepAssembly successfully predicts the interface (DockQ ≥ 0.23) for 32.4% of the dimers, suggesting a lighter way to assemble complex structures by treating domains as assembly units and using inter-domain interactions learned from monomer structures.

A Multi-Strategy Differential Evolution Algorithm with Adaptive Similarity Selection Rule

The differential evolution (DE) algorithm is a simple and efficient population-based evolutionary algorithm. In DE, the mutation strategy and the control parameter play important roles in performance enhancement. However, single strategy and fixed parameter are not universally applicable to problems and evolution stages with diverse characteristics; besides, the weakness of the advanced DE optimization framework, called selective-candidate framework with similarity selection rule (SCSS), is found by focusing on its single strategy and fixed parameter greedy degree (GD) setting. To address these problems, we mainly combine the multiple candidates generation with multi-strategy (MCG-MS) and the adaptive similarity selection (ASS) rule. On the one hand, in MCG-MS, two symmetrical mutation strategies, “DE/current-to-pbest-w/1” and designed “DE/current-to-cbest-w/1”, are utilized to build the multi-strategy to produce two candidate individuals, which prevents the over-approximation of the candidate in SCSS. On the other hand, the ASS rule provides the individual selection mechanism for multi-strategy to determine the offspring from two candidates, where parameter GD is designed to increase linearly with evolution to maintain diversity at the early evolution stage and accelerate convergence at the later evolution stage. Based on the advanced algorithm jSO, replacing its offspring generation strategy with the combination of MCG-MS and ASS rule, this paper proposes multi-strategy differential evolution algorithm with adaptive similarity selection rule (MSDE-ASS). It combines the advantages of two symmetric strategies and has an efficient individual selection mechanism without parameter adjustment. MSDE-ASS is verified under the Congress on Evolutionary Computation (CEC) 2017 competition test suite on real-parameter single-objective numerical optimization, and the results indicate that, of the 174 cases in total, it wins in 81 cases and loses in 30 cases, and it has the smallest performance ranking value, of 3.05. Therefore, MSDE-ASS stands out compared to the other state-of-the-art DEs.

Differential Evolution with exponential crossover can be also competitive on numerical optimization

Differential Evolution (DE) is a powerful population-based evolutionary algorithm for global optimization, and it is widely used in many scientific and engineering applications. There are two commonly used crossover schemes in the literature: one is binomial crossover and the other is exponential crossover. The majority of DE researchers believe that DE variants employing binomial crossover usually obtain superior performance than the ones employing exponential crossover on numerical optimization and DE variants with exponential crossover are good at tackling optimization problems with linkages among neighboring variables. On the contrary, here in this paper, a new perspective is proposed that DE variant with exponential crossover can obtain competitive performance with the ones employing binomial crossover on numerical optimization regardless of whether there are linkages among the variables or not after discovering the proper crossover rate Cr and its corresponding parameter control, and the main contributions of the paper can be summarized as follows: (1) The first powerful DE variant with exponential crossover, namely the DE-EXP algorithm, which is superior to the recent winner DE variants, e.g. LSHADE, iLSHADE and jSO, in Congress on Evolutionary Computation (CEC) competitions, is developed for numerical optimization; (2) A novel parameter control of crossover rate Cr is developed for exponential crossover and the value of Cr can be automatically generated not only in the initialization stage but also during the evolution. (3) A black-box model illustrating the fitness-value-dependency weakness of the recent winner DE variants in CEC competitions is given and a novel fitness-value-independent adaptation scheme for scale factor F is proposed in the DE-EXP algorithm to overcome the fitness-value-dependency weakness. A larger test suite containing 88 benchmarks is used for the validation of our DE-EXP algorithm, and experiment results show its superiority in comparison with several state-of-the-art DE variants.

Bivariate estimation-of-distribution algorithms can find an exponential number of optima

Finding a large set of optima in a multimodal optimization landscape is a challenging task. Classical population-based evolutionary algorithms typically converge only to a single solution. While this can be counteracted by applying niching strategies, the number of optima is nonetheless trivially bounded by the population size. Estimation-of-distribution algorithms (EDAs) are an alternative, maintaining a probabilistic model of the solution space instead of a population. Such a model is able to implicitly represent a solution set far larger than any realistic population size.To support the study of how optimization algorithms handle large sets of optima, we propose the test function EqualBlocksOneMax (EBOM). It has an easy fitness landscape with exponentially many optima. We show that the bivariate EDA mutual-information-maximizing input clustering, without any problem-specific modification, quickly generates a model that behaves very similarly to a theoretically ideal model for EBOM, which samples each of the exponentially many optima with the same maximal probability. We also prove via mathematical means that no univariate model can come close to having this property: If the probability to sample an optimum is at least inverse-polynomial, there is a Hamming ball of logarithmic radius such that, with high probability, each sample is in this ball.

Surrogate model for memetic genetic programming with application to the one machine scheduling problem with time-varying capacity

Surrogate evaluation is a useful, if not the unique, technique in population-based evolutionary algorithms where exact fitness calculation is too expensive. This situation arises, for example, in Genetic Programming (GP) applied to evolve scheduling priority rules, since the evaluation of a candidate rule amounts to solve a large number of problem instances acting as training set. In this paper, a simplified model is proposed that relies on finding and then exploiting a small set of small problem instances, termed filter, such that the evaluation of a rule on the filter may help to estimate the performance of the same rule in solving the training set. The problem of finding the best filter is formulated as a variant of the optimal subset problem, which is solved by means of a Genetic Algorithm (GA). The surrogate evaluation of a new candidate rule consist in solving the instances of the filter. This model is exploited in combination with a Memetic Genetic Program (MGP); the resulting algorithm is termed Surrogate Model MGP (SM-MGP). An experimental study was performed on the problem of scheduling a set of jobs on a machine with varying capacity over time, denoted (1,Cap(t)||∑Ti). The results of this study provided interesting insights into the problems of filter and rules calculation, and showcase that the priority rules evolved by SM-MGP outperform those evolved by MGP.

A cultural evolution with a modified selection function and adaptive [formula omitted]-cognition procedure for numerical optimization

In recent years, several population-based evolutionary and swarm algorithms have been developed and used in the literature. This work introduces an improved Cultural Algorithm with a modified selection function and a dynamic α-cognition procedure to handle a variety of challenging numerical optimization problems. The modified selection function is used to support a balanced evolutionary search. A process that starts with a clearer exploration early in the search process and gradually begins to focus on exploitation towards the end of the search process. This work uses the elites of each knowledge source that are at a certain distance from each other. The dynamic α-cognition procedure assists in providing effective learning of individuals through preserving the diversity of the population during the evolution process. In this procedure, each individual is able to learn from the top α% individuals controlled by its knowledge source in the belief space, where the proportion of the affecting subpopulation (α) is adaptively modified during the evolution. The performance of the proposed work has been evaluated on the CEC’2010 and CEC’2013 benchmark suites developed for the special sessions on large-scale global optimization problems. An appropriate comparative study with the best results in the literature is presented. The results confirm how the merits of the improved Cultural Algorithm can achieve superior performance over other cutting-edge algorithms for these data sets.

Optimal real-time tuning of autonomous distributed power systems using modern techniques

This work considers using a novel heuristic population-based evolutionary algorithm [viz., the moth flame optimization (MFO) algorithm] to regulate the conventional controller installed in an autonomous power system (APS). The moth flame optimization algorithm intends to produce the optimal magnitudes of the proportional-integral-derivative plus second derivative (PIDD2) controller parameters along with its first- and second-order low-pass filter constraints (installed in the investigated autonomous power system). The present task includes a comparison of the voltage response profiles of the investigated system obtained by the proposed moth flame optimization-based proportional-integral-derivative plus second derivative controller and those obtained by other algorithms (conveyed in current state-of-the-art literature) based on a proportional-integral controller. A fast-acting Sugeno fuzzy logic (SFL) technique is used to achieve the dynamic online results of the investigated autonomous power system model for online, off-nominal operational circumstances. Under step perturbations, the time-domain transient investigation in reference to voltage and/or mandate of load for the proposed autonomous power system model is inspected. Additionally, the robustness of the proposed moth flame optimization-based proportional-integral-derivative plus second derivative controller is investigated to test its behavior. An investigation has been provided by varying the model components of the studied autonomous power system model. It may be reported, as per the results obtained from the simulation, that the proposed moth flame optimization-based proportional-integral-derivative plus second derivative controller is an effective control strategy for the autonomous power system. The current research effort indicates that the proposed moth flame optimization algorithm, along with Sugeno fuzzy logic, may be useful for the actual time process of an autonomous power system.

A complex network-based firefly algorithm for numerical optimization and time series forecasting

The firefly algorithm (FA) has gained widespread attention and has been widely applied because of its simple structure, few control parameters and easy implementation. As the traditional FA lacks a mutation mechanism, it tends to fall into local optima, leading to premature convergence, thus affecting the optimization accuracy. To address these limitations, from the perspective of population diversity, a complex network-based FA (CnFA) with scale-free properties is proposed in this paper. The scale-free properties of complex networks effectively ensure the diversity of populations to guide the populations in their search, thus avoiding random interactions of information among populations that could lead to superindividuals controlling the entire population. The property of the power-law distribution of nodes in complex networks is exploited to effectively avoid the premature convergence of the FA and falling into local optima. To verify the search performance of CnFA, we compared the FA and its variants, as well as multiple competitive approaches, on 30 different-dimension benchmark function optimization tasks and two time series prediction tasks. The experimental results and statistical analysis show that CnFA achieves satisfactory performance due to the better balance between exploitation and exploration in the search process. Additionally, we extended the proposed method to two other population-based algorithms, and the experimental results verify that the complex network-based mechanism can enhance the performance of not only the FA but also other population-based evolutionary algorithms.

Evolutionary-assisted reinforcement learning for reservoir real-time production optimization under uncertainty

Production optimization has gained increasing attention from the smart oilfield community because it can increase economic benefits and oil recovery substantially. While existing methods could produce high-optimality results, they cannot be applied to real-time optimization for large-scale reservoirs due to high computational demands. In addition, most methods generally assume that the reservoir model is deterministic and ignore the uncertainty of the subsurface environment, making the obtained scheme unreliable for practical deployment. In this work, an efficient and robust method, namely evolutionary-assisted reinforcement learning (EARL), is proposed to achieve real-time production optimization under uncertainty. Specifically, the production optimization problem is modeled as a Markov decision process in which a reinforcement learning agent interacts with the reservoir simulator to train a control policy that maximizes the specified goals. To deal with the problems of brittle convergence properties and lack of efficient exploration strategies of reinforcement learning approaches, a population-based evolutionary algorithm is introduced to assist the training of agents, which provides diverse exploration experiences and promotes stability and robustness due to its inherent redundancy. Compared with prior methods that only optimize a solution for a particular scenario, the proposed approach trains a policy that can adapt to uncertain environments and make real-time decisions to cope with unknown changes. The trained policy, represented by a deep convolutional neural network, can adaptively adjust the well controls based on different reservoir states. Simulation results on two reservoir models show that the proposed approach not only outperforms the RL and EA methods in terms of optimization efficiency but also has strong robustness and real-time decision capacity.

Ant weight-lifting algorithm for motion estimation

Every video coding standard includes and requires motion estimation and compensation. The full search algorithm, which provides the best motion estimation, has a very high computation cost. Researchers have developed several algorithms to reduce the cost of computation. However, most of these algorithms become trapped in local minima during the search. Population-based evolutionary algorithms are widely used to develop a computationally efficient and cost-effective motion estimation strategy. The most recent effort used the Jaya algorithm to develop a motion estimation process that outperformed the state-of-the-art test zone search algorithm. In this study, a motion estimation algorithm based on the ant weight-lifting approach is proposed. Previously, the ant weight-lifting algorithm was used to solve a variety of problems, such as image segmentation, signal compression, and so on. The ant weight-lifting algorithm's computation cost was reduced by adopting a fitness estimation method that uses nearest-neighbor interpolation and an early termination strategy. Compared to Jaya algorithm-based motion estimation, the proposed algorithm executes up to 3% more quickly and exhibits up to 1.2 dB less distortion.

A Compact Cat Swarm Optimization Algorithm Based on Small Sample Probability Model

In this paper, a compact cat swarm optimization algorithm based on a Small Sample Probability Model (SSPCCSO) is proposed. In the same way as with previous algorithms, there is a tracking mode and a searching mode in the processing of searching for optimal solutions, but besides these, a novel differential operator is introduced in the searching mode, and it is proved that this could greatly enhance the search ability for the potential global best solution. Another highlight of this algorithm is that the gradient descent method is adopted to increase the convergence velocity and reduce the computation cost. More importantly, a small sample probability model is designed to represent the population of samples instead of the normal probability distribution. This representation method could run with low computing power of the equipment, and the whole algorithm only uses a cat with no historical position and velocity. Therefore, it is suitable for solving optimization problems with limited hardware. In the experiment, SSPCCSO is superior to other compact evolutionary algorithms in most benchmark functions and can also perform well compared to some population-based evolutionary algorithms. It provides a new means of solving small sample optimization problems.

Solving the Integrated Optimal Power and Gas Flow Problem by Improved Crow Search Algorithm

This paper solves the integrated optimal power and gas flow (IOPGF) problem in a multicarrier energy system (MES), to find the operating variables of electrical and natural gas networks satisfying some practical constraints. The proposed problem models optimal power flow (OPF), optimal gas flow (OGF), and economic heat dispatch (EHD) equations which make it a very complex optimization problem that cannot be easily solved by the classical optimization techniques. In addition, a population-based evolutionary algorithm (PEA), namely the improved crow search algorithm (ICSA) is introduced and applied to solve the OPF and the IOPGF problems. The results are compared with other well-known PEAs to ensure the higher performance of the ICSA. Also, the superior performance of the ICSA is confirmed by applying it to solve five well-known benchmark functions (BFs).

Multi-objective optimization for solving mobile robot path planning problem employing hybridization of algorithms

Mobile Robot Path Planning problem (MRPPP) is the most prominent research area employed in different real-time environments. In this article, a hybrid strategy is employed and validated with different environments for the path planning of mobile robots. The Artificial Potential Field (APF) algorithm and Multi-objective Genetic Algorithm (MOGA) are hybridized to solve an MRPPP. In the proposed hybrid methodology, the implementation is accomplished in three phases. To generate the initial population, an Artificial Potential Field (APF) algorithm is applied to discover all viable routes in an environment between the start and destination points. The collision-free paths are generated by determining the artificial force produced by obstacles and the target. The population-based evolutionary algorithm is employed to derive an optimal solution path from the initial population consisting of candidate paths. The selection operator is used to select the qualified subpopulation to the next generation to converge into the optimal solution. The genetic operators such as two-point crossover and mid-point mutation are exercised which are specific to the path planning problem.

A Real-Coding Population-Based Incremental Learning Evolutionary Algorithm for Multi-Satellite Scheduling

With the increasing demand for earth observation in various fields, remote satellites play an important role in ground information assurance. Apparently, the effective scheduling and utilization of multi-satellite resources determine the quality and efficiency of information acquisition. In this paper, focusing on the problem of centralized multi-satellite scheduling, we establish a mathematical model of satellite scheduling with complex constraints of load and platform operation. We also propose a real-coding Population Incremental Based Learning (PBIL) algorithm to solve the multi-satellite scheduling problem. The real-coding format can greatly shorten the coding length compared to the traditional PBIL algorithm with binary coding so that the computational efficiency is improved. Additionally, we design a value probability matrix, correction coefficient and mutation operator to guide better evolution and avoid early convergence. Finally, we take some numerical examples to verify the real-coding PBIL algorithm for multi-satellite scheduling. The performance of the algorithm is analyzed by comparing it with binary-coding PBIL and the Genetic Algorithm (GA). Additionally, the influence of key parameters on algorithm performance, such as probability correction coefficient, is also analyzed.

Adaptation of Population Size in Differential Evolution and Its Effects on Localization of Target Nodes

The differential evolution (DE) is a well known population-based evolutionary algorithm that has shown capabilities for solving real-world problems such as resource allocation, multicast routing, and localization of target nodes. However, the accuracy of the DE, like other evolutionary algorithms, depends on the settings of its control parameters. The localization of target nodes is highly nonlinear and multi-modal, which may trap the DE in a local optimum. A local optimum may be avoided by a proper selection of the control parameters. One of the key control parameters is the population size (PS), which affects directly the localization accuracy and computational complexity. Finding an adequate PS throughout the evolution process is a challenging task. Even if an adequate PS is found it may not be the adequate PS anymore when the scenario of a problem changes. Although several approaches have been proposed for adapting the PS, they have not been evaluated when solving the localization problem. In this paper, a comprehensive comparison in terms of accuracy and computational demand is conducted among the state-of-the-art PS adaptation techniques when employed with the DE for solving the localization problem of target nodes in various scenarios.We also propose three new PS adaptation techniques, namely, exponential, parabolic, and logistic reduction. The results from extensive numerical simulations show that, after setting the initial PS properly, there is no technique that outperforms the others in practically all the scenario of the localization problem. Additionally, the DE with the proposed techniques provides competitive localization accuracy with considerably less computational complexity. Specifically, The proposed approaches reduce the computational demand by approximately 50% over the standard DE in all the scenarios considered here.

Dynamic production optimization based on transfer learning algorithms

Dynamic production optimization involves continuous cycle of model-predictive control initiated at specified times to maximize production net present value (NPV) throughout the expected life of the reservoir. Re-evaluating predictive models using traditional methods is computationally expensive. The existing methods for updating production controls, do not take the inter-cycle correlation into account. But such information is valuable for boosting the problem-solving efficiency on the current cycle by utilizing the experience or knowledge extracted from the previous developed cycles. Originally, transfer learning algorithms are difficult to be implemented into the oil and gas industry, due to its high computational cost and random or unavailable learning samples. Therefore, we propose a new transfer learning based optimization framework for dynamic production optimization problems. First, domain adaptation learning (DAL) is used to represent data between two inter-cycles, to decrease the dissimilarity between them. Second, extended boundary constraints (EBC) is a technique used to embed the optimization problem into the learning samples during DAL stage. EBC reduces the burden on computational facilities and makes the algorithm suitable for production optimization. Third, a transfer component analysis (TCA) method is used to simplify the data representation and also extract the data correlation. Then, the extracted correlation is used to produce an effective population for MOEAs. The developed framework is incorporated into three well-known evolutionary algorithms, nondominated sorting genetic algorithm II (NSGAII), multiobjective particle swarm optimization (MOPSO), and multiobjective evolutionary algorithm based on decomposition (MOEA/D) and one single objective optimizer, particle swarm optimization (PSO) for NPV maximization and robust optimization respectively. The proposed method is tested on a series of dynamic benchmark problems dynamic and a practical case based on a three channel reservoir model. Results showed that the proposed method reduces the number of simulation calls needed to reach optimum control options when using population-based evolutionary algorithms. Also, using the proposed technique, a higher NPV and better convergence speed in comparison to their original evolutionary algorithms is achieved.

Population initialization techniques for evolutionary algorithms for single-objective constrained optimization problems: Deterministic vs. stochastic techniques

The population initialization step is a common step in the majority (or even all) of evolutionary algorithms (EAs). There are many population initialization techniques. Due to the limited population size and the high dimensionality of many problems, there is little chance to cover the promising regions in the search space. From different perspectives, this paper compares the stochastic and deterministic population initialization techniques through comparing five of the well-known population initializers: Random number generator (RNG), Latin Hypercube, Sobol, Halton, and Kronecker. Due to the presence of many constraints in real-world applications, in this paper, we are focusing only on single-objective constrained optimization problems. Specifically, the goal is to investigate if there is a significant difference between these population initialization methods. In this paper, we explain theoretically and mathematically these different population initialization techniques. Moreover, different illustrative examples and visualizations are introduced to explain the behavior of each technique and compare different techniques from different perspectives. The results show that due to the high uniformity of the low-discrepancy sequences such as the Halton and Sobol sequences, the generated points using these sequences are more evenly distributed over the space than RNG, which is the commonly used technique for initializing the populations in EAs. Practically, using a set of benchmark functions, we investigate the use of each population initialization technique for initializing different population-based evolutionary algorithms. The results of our experiments prove that with sufficient numbers of iterations, the EAs are not sensitive to the initialization methods and there are no significant differences between the mentioned population initialization methods. Further, the low discrepancy methods enhance the exploration ability of EAs in early iterations.

Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift.

A decent number of lower bounds for non-elitist population-based evolutionary algorithms has been shown by now. Most of them are technically demanding due to the (hard to avoid) use of negative drift theorems-general results which translate an expected movement away from the target into a high hitting time. We propose a simple negative drift theorem for multiplicative drift scenarios and show that it can simplify existing analyses. We discuss in more detail Lehre's (2010) negative drift in populations method, one of the most general tools to prove lower bounds on the runtime of non-elitist mutation-based evolutionary algorithms for discrete search spaces. Together with other arguments, we obtain an alternative and simpler proof of this result, which also strengthens and simplifies this method. In particular, now only three of the five technical conditions of the previous result have to be verified. The lower bounds we obtain are explicit instead of only asymptotic. This allows us to compute concrete lower bounds for concrete algorithms, but also enables us to show that super-polynomial runtimes appear already when the reproduction rate is only a (1-ω(n-1/2)) factor below the threshold. For the special case of algorithms using standard bit mutation with a random mutation rate (called uniform mixing in the language of hyper-heuristics), we prove the result stated by Dang and Lehre (2016b) and extend it to mutation rates other than Θ(1/n), which includes the heavy-tailed mutation operator proposed by Doerr et al. (2017). We finally use our method and a novel domination argument to show an exponential lower bound for the runtime of the mutation-only simple genetic algorithm on OneMax for arbitrary population size.

Escaping Local Optima with Non-Elitist Evolutionary Algorithms

Most discrete evolutionary algorithms (EAs) implement elitism, meaning that they make the biologically implausible assumption that the fittest individuals never die. While elitism favours exploitation and ensures that the best seen solutions are not lost, it has been widely conjectured that non-elitism is necessary to explore promising fitness valleys without getting stuck in local optima. Determining when non-elitist EAs outperform elitist EAs has been one of the most fundamental open problems in evolutionary computation. A recent analysis of a non-elitist EA shows that this algorithm does not outperform its elitist counterparts on the benchmark problem JUMP. We solve this open problem through rigorous runtime analysis of elitist and non-elitist population-based EAs on a class of multi-modal problems. We show that with 3-tournament selection and appropriate mutation rates, the non-elitist EA optimises the multi-modal problem in expected polynomial time, while an elitist EA requires exponential time with overwhelmingly high probability. A key insight in our analysis is the non-linear selection profile of the tournament selection mechanism which, with appropriate mutation rates, allows a small sub-population to reside on the local optimum while the rest of the population explores the fitness valley. In contrast, we show that the comma-selection mechanism which does not have this non-linear profile, fails to optimise this problem in polynomial time. The theoretical analysis is complemented with an empirical investigation on instances of the set cover problem, showing that non-elitist EAs can perform better than the elitist ones. We also provide examples where usage of mutation rates close to the error thresholds is beneficial when employing non-elitist population-based EAs.

Hip-DE: Historical population based mutation strategy in differential evolution with parameter adaptive mechanism

Differential Evolution (DE) was a powerful population-based evolutionary algorithm for global optimization, and it achieved great success in both evolutionary computation competitions and engineering applications. Despite the excellent performance of the state-of-the-art DE variants, there are still two main weaknesses existing within them: one is the weakness in a given mutation strategy and the other is the weakness in the corresponding parameter control (of the mutation strategy). By reviewing the existing mutation strategies in the recent state-of-the-art DE variants, it can be seen that all of them have insufficient use of the knowledge obtained during the evolution because the historical information of the population is not taken into consideration, which inevitably leads to a bad perception of the landscapes of the objectives. Moreover, the adaptations of the control parameters including F and CR in these state-of-the-art DE variants are interlaced with one another. A bad F and a good CR may produce a good trial vector candidate, then the bad F is of misuse in the parameter control and vice versa. In this paper, a novel DE variant, called Hip-DE, meaning the latest fashion of DE, with historical population based mutation strategy was proposed to tackle the above mentioned weaknesses. Moreover, novel parameter adaptive mechanisms for control parameters F and CR as well as a platform based step-decrease scheme of population size were proposed to enhance capacity of the mutation strategy. By incorporating these three advancements, the novel Hip-DE algorithm secured an overall better performance on the tested benchmarks in comparison with the recent proposed state-of-the-art DE variants.