Search

The soil water retention curve (SWRC) has a significant role in determining the unsaturated properties of soil. A stochastic optimisation algorithm named Rao-1 algorithm is employed to estimate the parameters of the SWRC model in this paper. The Rao-1 algorithm is a simple heuristic search algorithm containing only addition and multiplication operations. This paper introduces the method and its application in determining soil water retention this model parameters in detail. In this study, the van Genuchten model is used to depict the SWRC for its good fitting capacity, and the van Genuchten model parameters are determined using Rao-1 algorithm. The feasibility and efficiency of the proposed method are validated via the experimental results of 24 soil samples of 12 soil textural classes. Besides, the performance of Rao-1 algorithm is compared with that of salp swarm algorithm, the particle swarm optimization algorithm, differential evolution algorithm, and RETC program. Through comparative analysis, Rao-1 algorithm outperforms other methods in determining SWRC parameters. [ABSTRACT FROM AUTHOR]

Meta-heuristic algorithms are widely used in complex problems that cannot be solved by traditional computing methods due to their powerful optimization capabilities. However, for high-complexity problems, the fitness function evaluation may take hours or even days to complete. The surrogate-assisted meta-heuristic algorithm effectively solves this kind of long solution time for the fitness function. Therefore, this paper proposes an efficient surrogate-assisted hybrid meta-heuristic algorithm by combining the surrogate-assisted model with gannet optimization algorithm (GOA) and the differential evolution (DE) algorithm, abbreviated as SAGD. We explicitly propose a new add-point strategy based on information from historical surrogate models, using information from historical surrogate models to allow the selection of better candidates for the evaluation of true fitness values and the local radial basis function (RBF) surrogate to model the landscape of the objective function. The control strategy selects two efficient meta-heuristic algorithms to predict the training model samples and perform updates. A generation-based optimal restart strategy is also incorporated in SAGD to select suitable samples to restart the meta-heuristic algorithm. We tested the SAGD algorithm using seven commonly used benchmark functions and the wireless sensor network (WSN) coverage problem. The results show that the SAGD algorithm performs well in solving expensive optimization problems. [ABSTRACT FROM AUTHOR]

The decomposition-based algorithm, for example, multiobjective evolutionary algorithm based on decomposition (MOEA/D), has been proved effective and useful in a variety of multiobjective optimization problems (MOPs). On the basis of MOEA/D, the MOEA/D-DE replaces the simulated binary crossover (SBX) operator with differential evolution (DE) operator, which is used to enhance the diversity of the solutions more effectively. However, the amplification factor and the crossover probability are fixed in MOEA/D-DE, which would lead to a low convergence rate and be more likely to fall into local optimum. To overcome such a prematurity problem, this paper proposes three different adaptive operators in DE with crossover probability and amplification factors to adjust the parameter settings adaptively. We incorporate these three adaptive operators in MOEA/D-DE and MOEA/D-PaS to solve MOPs and many-objective optimization problems (MaOPs), respectively. This paper also designs a sensitive experiment for the changeable parameter η in the proposed adaptive operators to explore how η would affect the convergence of the proposed algorithms. These adaptive algorithms are tested on many benchmark problems, including ZDT, DTLZ, WFG, and MaF test suites. The experimental results illustrate that the three proposed adaptive algorithms have better performance on most benchmark problems. [ABSTRACT FROM AUTHOR]

In multi-objective bilevel optimisation problems, the upper-level performance of different lower-level optimal solutions may be very different, even though they belong to the same lower-level problem. It may lead to poor optimisation results. Therefore, the lower-level search should search lower-level non-dominated solutions that are also non-dominated in the upper-level objective space. In this paper, we use two populations in the lower-level search. The first population maintains non-dominance and diversity in the lower-level objective space and provides the second population with convergence pressure from the lower level. The second population selects the upper-level non-dominated solutions that are not dominated by the first population in the lower-level objective space, which make the second population maintain the non-dominance at both upper and lower levels. Besides, to improve the search efficiency, we set up the upper-level mating pool to generate the upper-level vectors of offsprings near the upper-level vectors of the better individuals in the current population. To balance convergence and diversity, the selection operator of a decomposition based multi-objective evolutionary algorithm is adopted. The proposed algorithm has been evaluated on a set of benchmark problems and a real-world optimisation problem. Experimental results demonstrate that the proposed algorithm is efficient and effective. [ABSTRACT FROM AUTHOR]

In this paper, we propose an improved Harris hawk optimizer (IHHO) to overcome the shortcomings of Harris hawk optimizer (HHO) that there is aimless search in the global search process. IHHO is different from HHO in that during the global search process, the position of the Harris hawks is not random but moves according to the position of the best several Harris hawks in the population. The advantage of the new global search process in the IHHO is that it effectively improves the quality of candidate solutions. We use the proposed algorithm to solve job-shop scheduling problem, which is an NP-hard problem and also a very challenging optimization problem, because it is difficult to find a reasonable candidate solution in polynomial time. Many researchers have tried various methods to solve it, but failed to get an effective result. Therefore, we use it to verify the performance of the proposed algorithm. The experimental results of IHHO are compared with those of improved genetic algorithm, differential evolution and HHO. It can be seen from the experimental results that IHHO has obvious advantages compared with the results of other comparison algorithms in terms of convergence accuracy, convergence speed, stability and running time. The experimental results of Wilcoxon's rank sum test also show that the IHHO is essentially different from other comparison algorithms, which shows that the optimization performance of the IHHO is meaningful. [ABSTRACT FROM AUTHOR]

In this paper, a new design approach of approximately linear phase infinite impulse response (IIR) low pass digital differentiator (LPDD) is proposed and studied. The proposed design is based on a transfer function that has a numerator with anti-symmetric coefficients. To better control the magnitude response of the designed LPDD, the differential evolution (DE) optimization algorithm is used to find the coefficients of the transfer function that meets an appropriate pass band and stop band edge frequencies. The use of appropriate pass band and stop band edge frequencies gives the designer of the LPDD direct control on the width of the transition band. The designed LPDD using the proposed approach has approximately linear phase and much better magnitude response than that of the IIR LPDDs designed using other techniques reported in literature. In addition, the designed LPDD using the proposed approach has steeper roll-off magnitude response and narrower transition band than that of designed IIR and high order FIR LPDDs available in the literature. [ABSTRACT FROM AUTHOR]

Hybridization of meta-heuristic algorithms plays a major role in the optimization problem. In this paper, a new hybrid meta-heuristic algorithm called hybrid pathfinder algorithm (HPFA) is proposed to solve the optimal reactive power dispatch (ORPD) problem. The superiority of the Differential Evolution (DE) algorithm is the fast convergence speed, a mutation operator in the DE algorithm incorporates into the pathfinder algorithm (PFA). The main objective of this research is to minimize the real power losses and subject to equality and inequality constraints. The HPFA is used to find optimal control variables such as generator voltage magnitude, transformer tap settings and capacitor banks. The proposed HPFA is implemented through several simulation cases on the IEEE 118-bus system and IEEE 300-bus power system. Results show the superiority of the proposed algorithm with good quality of optimal solutions over existing optimization techniques, and hence confirm its potential to solve the ORPD problem. [ABSTRACT FROM AUTHOR]

Van Genuchten (VG) equation is the most commonly used equation of soil moisture characteristic curve, and the accuracy of its parameters directly affects the calculation accuracy of soil moisture motion equation. In order to obtain the parameters of the equation more accurately, this paper establishes an optimization model of the VG equation parameters. This optimization model uses the advantages of the cuckoo search algorithm and the differential evolution algorithm to combine the two into a new hybrid cuckoo search algorithm, namely DECS algorithm, and uses this algorithm to solve the parameter optimization problem of VG equation of soil moisture characteristic curve. By collecting and analyzing the relevant experimental data of various soil qualities, the dehumidification and moisture absorption curves of three different soil qualities were selected for simulation calculation. The results show that in the experiment of solving the parameter estimation problem of the VG equation, the DECS hybrid algorithm has better exploration and development capabilities than the cuckoo search algorithm. The hybrid algorithm has relatively significant performance in terms of calculation accuracy and convergence. [ABSTRACT FROM AUTHOR]

Optimization for all disciplines is very important and applicable. Optimization has played a key role in practical engineering problems. A novel hybrid meta-heuristic optimization algorithm that is based on Differential Evolution (DE), Gradient Evolution (GE) and Jumping Technique named Differential Gradient Evolution Plus (DGE+) are presented in this paper. The proposed algorithm hybridizes the above-mentioned algorithms with the help of an improvised dynamic probability distribution, additionally provides a new shake off method to avoid premature convergence towards local minima. To evaluate the efficiency, robustness, and reliability of DGE+ it has been applied on seven benchmark constraint problems, the results of comparison revealed that the proposed algorithm can provide very compact, competitive and promising performance. [ABSTRACT FROM AUTHOR]

This paper presents a novel differential evolution (DE) algorithm, with its improved version (IDE) for the benchmark functions and the optimal reactive power dispatch (ORPD) problem. Minimization of the total active power loss is usually considered as the objective function of the ORPD problem. The constraints involved are generators, transformers tapings, shunt reactors, and other reactive power sources. The aim of this study is to discover the best vector of control variables to minimize power loss, under the premise of considering the constraints system. In the proposed IDE, a new initialization strategy is developed to construct the initial population for guaranteeing its quality and simultaneously maintaining its diversity. In addition, to enhance the convergence characteristic of the original DE, two kinds of self-adaptive adjustment strategies are employed to update the scaling factor and the crossover factor, respectively, in which the detailed information about the two factors can be exchanged for each generation dynamically. Numerical applications of different cases are carried out on several benchmark functions and two standard IEEE systems, i.e., 14-bus and 30-bus test systems. The results achieved by using the proposed IDE, compared with other optimization algorithms, are discussed and analyzed in detail. The obtained results demonstrated that the proposed IDE can successfully be used to deal with the ORPD problem. [ABSTRACT FROM AUTHOR]

This paper corroborated the hybrid Alopex based Differential Evolution Craziness based Particle Swarm Optimization algorithm (ADECRPSO) over DE, ADE, PSO, and CRPSO algorithms to pursuit the gain parameters of the PID and Fuzzy PID (FPID) controller. In a two-area thermal-hydro-diesel power system, primacy of FPID controller is endorsed with PID controller tuned with assorted optimization techniques. The hybrid ADECRPSO algorithm is affirmed over the above mentioned algorithms to tune PID controller in a two-area hydro-thermal system. PSO, DE, CRPSO, ADE, and ADECRPSO are executed individually to optimize the controller to enhance the transient analysis by conceding undershoot, overshoot, and settling time of the system. The compilation of advantages of alopex based DE and craziness based PSO causes an adequate hybrid algorithm, which enhances the performance of Automatic Generation Control (AGC). The step load uprise in area-1 is imposed to observe the activities of AGC. Undeniably, FPID controller optimized by ADECRPSO commits superior performance over PSO, DE, CRPSO, and ADE optimized controller as proposed AGC system. The FPID controller optimized by ADECRPSO, ADE, and CRPSO is realized in real time environment (OPAL RT OP5600). So, the modified mutation of DE by alopex scheme enhances the potentiality to tune the system variables. [ABSTRACT FROM AUTHOR]

In this paper, six metaheuristic algorithms, in the form of artificial bee colony optimization, ant colony optimization, particle swarm optimization, differential evolution, firefly algorithm and teaching-learning-based optimization techniques are applied for parametric optimization of a multi-pass face milling process. Using those algorithms, the optimal values of cutting speed, feed rate and depth of cut for both roughing and finishing operations are determined for having minimum total production time and total production cost. It is observed that the teaching-learning-based optimization algorithm outperforms the others with respect to accuracy and consistency of the derived solutions as well as computational speed. Two statistical tests, i.e. paired t-test and Wilcoxson signed rank test also confirm its superiority over the remaining algorithms. Finally, these metaheuristics are employed for multi-objective optimization of the considered multi-pass milling process while concurrently minimizing both the objectives. [ABSTRACT FROM AUTHOR]

This paper is concerned with the application of computational intelligence techniques to the conceptual design and development of a large-scale floating settlement. The settlement in question is a design for the area of Urla, which is a rural touristic region located on the west coast of Turkey, near the metropolis of Izmir. The problem at hand includes both engineering and architectural aspects that need to be addressed in a comprehensive manner. We thus adapt the view as a multi-objective constrained real-parameter optimization problem. Specifically, we consider three objectives, which are conflicting. The first one aims at maximizing accessibility of urban functions such as housing and public spaces, as well as special functions, such as a marina for yachts and a yacht club. The second one aims at ensuring the wind protection of the general areas of the settlement, by adequately placing them in between neighboring land masses. The third one aims at maximizing visibility of the settlement from external observation points, so as to maximize the exposure of the settlement. To address this complex multi-objective optimization problem and identify lucrative alternative design solutions, a multi-objective harmony search algorithm (MOHS) is developed and applied in this paper. When compared to the Differential Evolution algorithm developed for the problem in the literature, we demonstrate that MOHS achieves competitive or slightly better performance in terms of hyper volume calculation, and gives promising results when the Pareto front approximation is examined. [ABSTRACT FROM AUTHOR]

This paper develops a robust strategy based on integrating three mutation phases and adapted control parameters into the Adaptive Guided Differential Evolution algorithm called (mAGDE) to improve diversity and exploration of the original AGDE. The mAGDE performance is evaluated using IEEE CEC'2020 test suite. Furthermore, the mAGDE is employed to identify the solid oxide fuel cell (SOFC) model optimal parameters. Two modes of SOFC operation are investigated, steady and transient states. The results obtained from the proposed mAGDE are compared with a number of recent, well-established and reputed meta-heuristics, including Particle swarm optimization, Teaching learning-based optimization, Whale optimization algorithm, Harris hawks optimization, Marine predators algorithm, Archimedes optimization algorithm, Differential evolution, and the original AGDE. Additionally, the statistical parameters that measure the performance of the proposed optimizer and the other competitors are calculated. The main finding demonstrated the preference and robustness of the suggested mAGDE in constructing the SOFC circuit that closely converges to the actual one. During the steady-state operation, the best fitness value obtained via the suggested mAGDE for operation at 1273 K is 2.2995E−06, while in the transient-state operation, the best SMSE is 1.04. The average cost function is decreased by 43.33% compared to the one obtained by the original AGDE. From the aforementioned assessments, it can be concluded that the proposed mAGDE is outstanding and promising. • This paper introduces a modified mAGDE based on the integration of a modified three-phases AGDE with the DE_SPA algorithm. • A modified three-phases AGDE has been introduced to maintain diversity and convergence of the evolutionary process. • The CEC'2020 test suite problems are used to demonstrate the performance mAGDE against other competitors. • Applying for first time mAGDE to identify the optimal parameters of SOFC model. • The robustness of the proposed strategy-based mAGDE is proved. [ABSTRACT FROM AUTHOR]

In this paper, a new color watermarking algorithm based on differential evolution is proposed. A color host image is first converted from RGB space to YIQ space, which is more suitable for the human visual system. Then, apply three-level discrete wavelet transformation to luminance component Y and generate four different frequency sub-bands. After that, perform singular value decomposition on these sub-bands. In the watermark embedding process, apply discrete wavelet transformation to a watermark image after the scrambling encryption processing. Our new algorithm uses differential evolution algorithm with adaptive optimization to choose the right scaling factors. Experimental results show that the proposed algorithm has a better performance in terms of invisibility and robustness. [ABSTRACT FROM AUTHOR]

It is known that the optimization of the Earth-Moon low-energy transfer trajectory is extremely sensitive with the initial condition chosen to search. In order to find the proper initial parameter values of Earth-Moon low-energy transfer trajectory faster and obtain more accurate solutions with high stability, in this paper, an efficient hybridized differential evolution (DE) algorithm with a mix reinitialization strategy (DEMR) is presented. The mix reinitialization strategy is implemented based on a set of archived superior solutions to ensure both the search efficiency and the reliability for the optimization problem. And by using DE as the global optimizer, DEMR can optimize the Earth-Moon low-energy transfer trajectory without knowing an exact initial condition. To further validate the performance of DEMR, experiments on benchmark functions have also been done. Compared with peer algorithms on both the Earth-Moon low-energy transfer problem and benchmark functions, DEMR can obtain relatively better results in terms of the quality of the final solutions, robustness, and convergence speed. [ABSTRACT FROM AUTHOR]

Driver pathways have been acknowledged to play critical roles in the initiation and progression of cancers►hence it is essential for precision medicine related studies to develop accurate and efficient methods to identify them. Although previous approaches have shown promising results by integrating multi-omics data, their preset artificial parameters may decrease the convenience to use and limit the application scalability. In this paper, a novel integration approach is proposed to incorporate four omics data, i.e., construct a weighted non-binary mutation matrix without presetting artificial parameters. A parameter-free identification model is put forward based on it. It takes advantage of the association between genes in the PPI network as well as balances the contribution of coverage and mutual exclusivity with the harmonic mean. Furthermore, a cooperative co-evolution algorithm is proposed for solving this model. In the algorithm, a particle swarm optimization algorithm suitable for solving combinatorial problems is presented. Three cooperative operators are devised to construct the cooperation among the populations and the swarm to increase the population diversity. Both real biological datasets and simulated ones were exerted to perform experimental comparisons among the proposed method and six other state-of-the-art ones. The gene sets identified by the presented method generally contain more genes involved in known signaling pathways than those obtained by the other methods. Simultaneously, both high accuracy and high efficiency of the proposed method were verified in experiments, making it practical in realistic applications and an effective supplementary tool to identify driver pathways. • A non-binary mutation matrix is constructed without artificial adjustable parameters. • The model incorporates gene association and balances coverage and mutual exclusivity. • A PSO algorithm suitable for solving combinatorial problems is presented. • A co-operative co-evolution algorithm is put forward for solving the presented model. • The performance is compared among the proposed method and seven state of the art ones. [ABSTRACT FROM AUTHOR]

• Optimal foraging algorithm with direction prediction & Gaussian oscillation is built. • New algorithm includes two update methods: prediction model and random model. • Prediction model mends exploitation ability by predicting the evolutionary direction. • Random model mends exploration by exploring the space with Gaussian distribution. • The superiority of algorithm is verified on benchmark set and engineering problems. Optimal foraging algorithm (OFA) is a newly stochastic optimization technique and is famous for its computational accuracy. However, the high computational accuracy leads to slow convergence speed. Experimental results demonstrate that OFA is good at unimodal functions but poor at multimodal functions. To improve these drawbacks, in this paper a novel modified OFA with direction prediction and Gaussian oscillation, named OFA/P&G is introduced. In OFA/P&G, a transition matrix is constructed when a new global optimum is found to generate the candidate individuals. If the current global optimum does not change, the Gaussian oscillation is employed in a low probability and OFA update method is used in a high probability to generate the candidate individuals. The superior performance of OFA/P&G is verified on the 12 CEC2017 benchmark functions, 13 constrained benchmark functions and 5 engineering problems. Experimental results demonstrate that OFA/P&G outperforms other comparative algorithms. Finally, a real-world problem, drilling path optimization, is solved by OFA/P&G. [ABSTRACT FROM AUTHOR]

Abstract: This paper presents combination of differential evolution (DE) and biogeography-based optimization (BBO) algorithm to solve complex economic emission load dispatch (EELD) problems of thermal generators of power systems. Emission substances like NO X , SO X , COX, Power demand equality constraint and operating limit constraint are considered here. Differential evolution (DE) is one of the very fast and robust, accurate evolutionary algorithms for global optimization and solution of EELD problems. Biogeography-based optimization (BBO) is another new biogeography inspired algorithm. Biogeography deals with the geographical distribution of different biological species. This algorithm searches for the global optimum mainly through two steps: migration and mutation. In this paper combination of DE and BBO (DE/BBO) is proposed to accelerate the convergence speed of both the algorithm and to improve solution quality. To show the advantages of the proposed algorithm, it has been applied for solving multi-objective EELD problems in a 3-generator system with NO X and SO X emission, in a 6-generators system considering NO X emission, in a 6-generator system addressing both valve-point loading and NO X emission. The current proposal is found better in terms of quality of the compromising and individual solution obtained. [Copyright &y& Elsevier]

This paper presents the evolution of combinational logic circuits by a new hybrid algorithm known as the Differential Evolution Particle Swarm Optimization (DEPSO), formulated from the concepts of a modified particle swarm and differential evolution. The particle swarm in the hybrid algorithm is represented by a discrete 3-integer approach. A hybrid multi-objective fitness function is coined to achieve two goals for the evolution of circuits. The first goal is to evolve combinational logic circuits with 100% functionality, called the feasible circuits. The second goal is to minimize the number of logic gates needed to realize the feasible circuits. In addition, the paper presents modifications to enhance performance and robustness of particle swarm and evolutionary techniques for discrete optimization problems. Comparison of the performance of the hybrid algorithm to the conventional Karnaugh map and evolvable hardware techniques such as genetic algorithm, modified particle swarm, and differential evolution are presented on a number of case studies. Results show that feasible circuits are always achieved by the DEPSO algorithm unlike with other algorithms and the percentage of best solutions (minimal logic gates) is higher. [ABSTRACT FROM AUTHOR]

The differential evolution algorithm has been widely applied on unmanned aerial vehicle (UAV) path planning. At present, four random tuning parameters exist for differential evolution algorithm, namely, population size, differential weight, crossover, and generation number. These tuning parameters are required, together with user setting on path and computational cost weightage. However, the optimum settings of these tuning parameters vary according to application. Instead of trial and error, this paper presents an optimization method of differential evolution algorithm for tuning the parameters of UAV path planning. The parameters that this research focuses on are population size, differential weight, crossover, and generation number. The developed algorithm enables the user to simply define the weightage desired between the path and computational cost to converge with the minimum generation required based on user requirement. In conclusion, the proposed optimization of tuning parameters in differential evolution algorithm for UAV path planning expedites and improves the final output path and computational cost. [ABSTRACT FROM AUTHOR]

This paper presents two-swim operators to be added to the chemotaxis process of the modified bacterial foraging optimization algorithm to solve three instances of the synthesis of four-bar planar mechanisms. One swim favors exploration while the second one promotes fine movements in the neighborhood of each bacterium. The combined effect of the new operators looks to increase the production of better solutions during the search. As a consequence, the ability of the algorithm to escape from local optimum solutions is enhanced. The algorithm is tested through four experiments and its results are compared against two BFOA-based algorithms and also against a differential evolution algorithm designed for mechanical design problems. The overall results indicate that the proposed algorithm outperforms other BFOA-based approaches and finds highly competitive mechanisms, with a single set of parameter values and with less evaluations in the first synthesis problem, with respect to those mechanisms obtained by the differential evolution algorithm, which needed a parameter fine-tuning process for each optimization problem. [ABSTRACT FROM AUTHOR]

Brain Storm Optimization (BSO) algorithm is a swarm intelligence algorithm inspired by human being’s behavior of brainstorming. The performance of BSO is maintained by the creating process of ideas, but when it cannot find a better solution for some successive iterations, the result will be so inefficient that the population might be trapped into local optima. In this paper, we propose an improved BSO algorithm with differential evolution strategy and new step size method. Firstly, differential evolution strategy is incorporated into the creating operator of ideas to allow BSO jump out of stagnation, owing to its strong searching ability. Secondly, we introduce a new step size control method that can better balance exploration and exploitation at different searching generations. Finally, the proposed algorithm is first tested on 14 benchmark functions of CEC 2005 and then is applied to train artificial neural networks. Comparative experimental results illustrate that the proposed algorithm performs significantly better than the original BSO. [ABSTRACT FROM AUTHOR]

Many improved differential Evolution (DE) algorithms have emerged as a very competitive class of evolutionary computation more than a decade ago. However, few improved DE algorithms guarantee global convergence in theory. This paper developed a convergent DE algorithmin theory, which employs a self-adaptation scheme for the parameters and two operators, that is, uniform mutation and hidden adaptation selection (haS) operators. The parameter self-adaptation and uniformmutation operator enhance the diversity of populations and guarantee ergodicity. The haS can automatically remove some inferior individuals in the process of the enhancing population diversity. The haS controls the proposed algorithm to break the loop of current generation with a small probability. The breaking probability is a hidden adaptation and proportional to the changes of the number of inferior individuals. The proposed algorithm is tested on ten engineering optimization problems taken from IEEE CEC2011. [ABSTRACT FROM AUTHOR]

An improved differential evolution (DE) method based on the dynamic search strategy (IDEBDSS) is proposed to solve dynamic economic dispatch problem with valve-point effects in this paper. The proposed method combines the DE algorithm with the dynamic search strategy, which improves the performance of the algorithm. DE is the main optimizer in the method proposed. While chaotic sequences are applied to obtain the dynamic parameter settings in DE, dynamic search strategy which consists of two steps, global search strategy and local search strategy, is used to improve algorithm efficiency. To accelerate convergence, a new infeasible solution handing method is adopted in the local search strategy; meanwhile, an orthogonal crossover (OX) operator is added to the global search strategy to enhance the optimization search ability. Finally, the feasibility and effectiveness of the proposed methods are demonstrated by three test systems, and the simulation results reveal that the IDEBDSS method can obtain better solutions with higher efficiency than the standard DE and other methods reported in the recent literature. [ABSTRACT FROM AUTHOR]

Abstract: In the present paper, a comparison is made between the Coupled Local Minimizers (CLM) method and the Differential Evolution (DE) algorithm to perform FE model updating for the damage detection in a cracked beam. CLM method is a gradient-based method with multiple local optimization runs. DE algorithm is a direct search approach which uses a population of solution vectors collecting the design parameters. Two benchmark examples of damage assessment are considered, i.e., beams under flexural vibrations with one crack and two cracks, with unknown position and depth. The effectiveness of the two methods to obtain the set of unknown parameters has been verified by performing a number of optimization processes starting from initial values of parameters selected randomly. Both exact and pseudo-experimental input data are used. A statistical analysis of the optimization results is presented. Both methods give results much better than the classical gradient optimization method. Better performances in term of speed rate and precision have been obtained by CLM when the number of identified parameters is limited. On the other hand, DE shows good efficiency when the number of parameters increases or in the case of pseudo-experimental input data. [Copyright &y& Elsevier]

In this paper, a novel hybrid algorithm based on artificial bee colony (ABC) algorithm and differential evolution (DE) algorithm called ABC-DE is proposed to inherit their advantages and overcome their drawbacks. In ABC-DE algorithm, employed bees employ the mutation and crossover strategies of DE to enforce their exploration ability while onlooker bees keep their original updating strategy to retain the exploitation ability. Classical test functions have been provided to testify the ABC-DE algorithm. Furthermore, ABC-DE is applied to different types of time-modulated arrays (TMAs) pattern synthesis problems, including the syntheses of low equal-ripple sidelobe level (SLL) pattern, deep null level pattern, multiple-beams patterns and satellite footprint pattern. Experiment results reveal that ABC-DE has a promising performance in the convergence rate and the exploration ability when compared with other improved evolutionary algorithms, which indicates that the proposed algorithm can be an effective approach for TMAs synthesis problems. [ABSTRACT FROM PUBLISHER]

In this paper, a new compact algorithm is proposed. Two sinusoidal formulas are used to automatically adjust the crossover rate and the mutation scaling factor in the compact Differential Evolution (cDE) metaheuristic. The proposed algorithm, called Compound Sinusoidal cDE, CScDE, is compared to seven state-of-the-art compact algorithms on the well-known BBOB test-bed, the CEC-2014 test suite for continuous optimisation, as well as five real-world optimisation problems chosen from the CEC-2011 benchmarks. The CScDE algorithm outperformed its competitors for most problem categories and over most dimensions. It is also compared to some well-established population-based metaheuristics. • A compact compound sinusoidal differential evolution, CScDE, is proposed. • CScDE uses sinusoidal formulas to adjust the parameters of compact DE. • Both binomial and exponential crossover are tested. • CScDE is applied on 89 reference problems with several dimensions. • CScDE outperformed state-of-the-art compact algorithms. [ABSTRACT FROM AUTHOR]

Trajectory optimization is essentially an optimal control problem (OCP) with highly nonlinear dynamic properties and complex constraints, and a critical part of spacecraft design. In this paper, a hybrid algorithm is proposed for automatic reentry trajectory optimization of reusable launch vehicle (RLV) without providing user-specified initial guesses and a priori knowledge about the optimal trajectory. The method combines the strong robustness and global optimization properties of hyper-heuristic whale optimization algorithm (HHWOA) with the efficient and accurate features of the Gauss pseudospectral method (GPM). HHWOA works as the first-stage optimizer aims to obtain an approximate solution to provide a high-quality initial guess for the GPM, while the GPM works as the second-stage optimizer aims to accelerate the search of the optimum neighborhood to obtain an accurate optimal solution. Additionally, to enhance the progress during the evolutionary process, HHWOA is equipped with opposition-based learning, differential evolution operators, chaotic map sequences and smoothing technique strategies. The utilization of such strategies can potentially smooth the flight trajectory and improve the global convergence of the algorithm, while the three OCPs have shown their superiority in HHWOA. In order to evaluate the performance of the hybrid algorithm, complex constrained RLV maximum cross-range reentry problems with three different path constraint scenarios are investigated. Furthermore, more discussion and experiments are likewise conducted to investigate the impact of the parameters on the performance of the algorithm. The results show that the proposed hybrid algorithm can be very effective in addressing RLV reentry trajectory optimization problems. [ABSTRACT FROM AUTHOR]

Moth–Flame Optimization (MFO) algorithm is widely used to solve real parameter global optimization problems. However, the original MFO algorithm has some problems. First, the global search ability of the algorithm is insufficient due to the lack of high-quality flames or the lack of diversity of the population. Moreover, due to the reduction of the number of flames mechanism and the simple transverse orientation flight mode of moths, the algorithm is easy to fall into local optimum. To overcome these difficulties, a new MFO called ODSFMFO is proposed in this paper, which consists of an improved flame generation mechanism based on Opposition-Based Learning (OBL) and Differential Evolution (DE) algorithm, and an enhanced local search mechanism based on Shuffled Frog Leaping Algorithm (SFLA) and death mechanism. The ODSFMFO firstly obtains a high-quality population through opposition-based learning, then enhances the diversity of the population through differential evolution algorithm, to improve the global search ability of the algorithm, and then, employs an improved shuffled frog leaping algorithm as a local search algorithm, and uses the death mechanism to eliminate the individuals with low fitness value, which not only make the algorithm easy to jump out of the local optimum, but also further improve the convergence speed. To demonstrate the effectiveness of the proposed algorithm, the ODSFMFO and other fourteen well-known optimization algorithms are tested and compared on 28 benchmark tasks of CEC 2013 and 30 benchmark tasks of CEC 2017. Simulation results show that the proposed algorithm obtains better results compared with other competitive algorithms. • An improved flame generation mechanism of MFO is proposed. • A new updating mechanism of SFLA is proposed to improve the local search ability. • The SFLA and death mechanism are applied in combination to MFO. • ODSFMFO is better than 14 compared algorithms. [ABSTRACT FROM AUTHOR]

Abstract: This paper proposes an optimization-based model for generic document summarization. The model generates a summary by extracting salient sentences from documents. This approach uses the sentence-to-document collection, the summary-to-document collection and the sentence-to-sentence relations to select salient sentences from given document collection and reduce redundancy in the summary. To solve the optimization problem has been created an improved differential evolution algorithm. The algorithm can adjust crossover rate adaptively according to the fitness of individuals. We implemented the proposed model on multi-document summarization task. Experiments have been performed on DUC2002 and DUC2004 data sets. The experimental results provide strong evidence that the proposed optimization-based approach is a viable method for document summarization. [Copyright &y& Elsevier]

Abstract: Several geometries of the hydrocyclones have been proposed in the literature to improve the separation efficiency or reduce the energy costs. In the present paper, a new geometrical configuration of hydrocyclone has been found through the use of response surface technique combined with the Differential Evolution algorithm. The result obtained with these optimization techniques has been validated by experimental data. The optimized configuration of hydrocyclone presented a high efficiency and a small reduced cut size. [Copyright &y& Elsevier]

Abstract: The sale of electric energy generated by photovoltaic (PV) plants has attracted much attention in recent years. The installation of PV plants aims to obtain the maximum benefit of captured solar energy. The current methodologies for planning the design of the different components of a PV plant are not completely efficient. This paper addresses the optimization of the design of PV plants with solar tracking, which consists of the optimization of the variables that make up the PV plant to obtain the minimum electric (Joule) losses possible. These variables are the size and distribution of solar modules in the solar tracker, the distribution of the solar trackers in the field and the choice of inverter. Evolutionary algorithms (EAs) are adaptive methods based on natural evolution that may be used for searching and optimization. Four different EAs have been used for optimizing the design of PV plants: steady-state genetic algorithm, generational genetic algorithm, CHC algorithm and DE algorithm. In order to test the performance of these algorithms we have used different proposed fields to mount PV plants. The results obtained show that EAs, and specifically DE with rand mutation schemes, are promising techniques to optimize design of PV plants. Furthermore, the results are contrasted with nonparametric statistical tests to support our conclusions. [Copyright &y& Elsevier]

Differential evolution (DE) is one of the most powerful stochastic real parameter optimizers of current interest. In this paper, we propose a new mutation strategy, a fitness-induced parent selection scheme for the binomial crossover of DE, and a simple but effective scheme of adapting two of its most important control parameters with an objective of achieving improved performance. The new mutation operator, which we call DE/current-to-gr_best/1, is a variant of the classical DE/current-to-best/1 scheme. It uses the best of a group (whose size is q\% of the population size) of randomly selected solutions from current generation to perturb the parent (target) vector, unlike DE/current-to-best/1 that always picks the best vector of the entire population to perturb the target vector. In our modified framework of recombination, a biased parent selection scheme has been incorporated by letting each mutant undergo the usual binomial crossover with one of the p top-ranked individuals from the current population and not with the target vector with the same index as used in all variants of DE. A DE variant obtained by integrating the proposed mutation, crossover, and parameter adaptation strategies with the classical DE framework (developed in 1995) is compared with two classical and four state-of-the-art adaptive DE variants over 25 standard numerical benchmarks taken from the IEEE Congress on Evolutionary Computation 2005 competition and special session on real parameter optimization. Our comparative study indicates that the proposed schemes improve the performance of DE by a large magnitude such that it becomes capable of enjoying statistical superiority over the state-of-the-art DE variants for a wide variety of test problems. Finally, we experimentally demonstrate that, if one or more of our proposed strategies are integrated with existing powerful DE variants such as jDE and JADE, their performances can also be enhanced. [ABSTRACT FROM AUTHOR]

Abstract: The performance of an optimization tool is largely determined by the efficiency of the search algorithm used in the process. The fundamental nature of a search algorithm will essentially determine its search efficiency and thus the types of problems it can solve. Modern metaheuristic algorithms are generally more suitable for global optimization. This paper carries out extensive global optimization of unconstrained and constrained problems using the recently developed eagle strategy by Yang and Deb in combination with the efficient differential evolution. After a detailed formulation and explanation of its implementation, the proposed algorithm is first verified using twenty unconstrained optimization problems or benchmarks. For the validation against constrained problems, this algorithm is subsequently applied to thirteen classical benchmarks and three benchmark engineering problems reported in the engineering literature. The performance of the proposed algorithm is further compared with various, state-of-the-art algorithms in the area. The optimal solutions obtained in this study are better than the best solutions obtained by the existing methods. The unique search features used in the proposed algorithm are analyzed, and their implications for future research are also discussed in detail. [Copyright &y& Elsevier]

Abstract: This paper presents a constrained Self-adaptive Differential Evolution (SaDE) algorithm for the design of robust optimal fixed structure controllers with uncertainties and disturbance. Almost all real world optimization problems have constraints which should be satisfied along with the best optimal solution for the problem. In evolutionary algorithms (EAs) the presence of constraints reduces the feasible region and complicates the search process. Therefore, a suitable method to handle the constraints must also be executed. In the SaDE algorithm, four mutation strategies and the control parameter CR are self-adapted. Self-adaptive Penalty (SP) method is introduced into the SaDE algorithm for constraint handling. The performance of SaDE algorithm is demonstrated on the design of robust optimal fixed structure controller of three systems, namely the linearized magnetic levitation system, F-8 aircraft linearized model and a SISO plant. For the comparison purpose, reported results of constrained PSO algorithm and five DE algorithms with different strategies and parameter values are taken into account. Statistical performance in 20 independent runs is considered to compare the performance of algorithms. From the obtained results, it is observed that SaDE algorithm is able to self-adapt the mutation strategy and the crossover rate and hence performs better than the other variants of DE and the constrained PSO algorithm. Better performance of SaDE is achieved by sustained maintenance of diversity throughout the evolutionary process thus producing better individuals consistently. This also aids the algorithm to escape from local optima thereby avoiding premature convergence. [Copyright &y& Elsevier]

Abstract: The differential evolution (DE) is a global optimization algorithm to solve numerical optimization problems. Recently the quantum-inquired differential evolution (QDE) has been proposed for binary optimization. This paper proposes DE/QDE to learn the Takagi–Sugeno (T–S) fuzzy model. DE/QDE can simultaneously optimize the structure and the parameters of the model. Moreover a new encoding scheme is given to allow DE/QDE to be easily performed. The two benchmark problems are used to validate the performance of DE/QDE. Compared to some existing methods, DE/QDE shows the competitive performance in terms of accuracy. [Copyright &y& Elsevier]

Abstract: This paper proposes new Differential Evolution (DE) algorithm, named as Chaotically Initialized Differential Evolution (CIDE), that uses chaotic maps with certainty, ergodicity, unpredictability, non-periodicity, complex temporal behavior and the stochastic property for initial population generation. This has been done by using of different chaotic number generators each time a random number is needed by the classical DE algorithm in its initial step. Seven chaotic maps have been analyzed in the benchmark functions. It has been detected that coupling emergent results in different areas, like those of DE and complex dynamics, can improve the quality of results in some optimization problems and also that chaos may be a desired process. It has been also shown that, Sinus map and Circle map have somewhat increased the solution quality, that is in some cases they improved the global searching capability by escaping the local solutions. [Copyright &y& Elsevier]

This paper deals with the parameter determination procedure of a gas-discharge arrester's (GDA) model. As the accuracy of the model depends on its parameters, the goal of this procedure is to determine adequate parameter values so that the model's performances match the real device behavior as much as possible. In order to achieve this goal, differential evolution (DE), a stochastic optimization algorithm, is included in the determination process. The main task of the DE algorithm is to vary the model's parameters during the optimization process, thus minimizing the difference between the measured and model-calculated current and voltage time behavior. An accurate GDA model has been obtained on the basis of measurements on a single GDA test object. This model is relevant and suitable for a series of GDA devices as the agreement between their measured and model-calculated voltage and current time behavior is excellent. [ABSTRACT FROM AUTHOR]

Abstract: Dynamic economic dispatch (DED) plays an important role in power system operation, which is a complicated nonlinear constrained optimization problem. It has non-smooth and non-convex characteristic when generation unit valve-point effects are taken into account. This paper proposes a novel hybrid method to solve DED problem with valve-point effects, by integrating an improved differential evolution(IDE) with the Shor’s r-algorithm. The proposed method is developed in such a way that IDE is applied as a based level search, which can give a good direction to the optimal global region, and a local search Shor’s r-algorithm is used as a fine tuning to determine the optimal solution at the final. A feasibility-based selection comparison technique and a heuristic rule are devised to handle constraints effectively in IDE, which does not require penalty factors or any extra parameters and can guide the population to the feasible region quickly. The feasibility and effectiveness of the proposed hybrid method is demonstrated for an application example and the test results are compared with those of other methods. It is shown that the proposed method is capable of yielding higher quality solutions. [Copyright &y& Elsevier]