Search

Surrogate-assisted evolutionary algorithms (SAEAs) have been successfully employed for expensive optimization. However, most SAEAs are designed for expensive unconstrained optimization, and less attention has been paid to expensive optimization with inequality constraints. Therefore, this work proposes a novel SAEA, called surrogate-assisted two-stage differential evolution (SA-TSDE), for expensive constrained optimization. In the first search stage, surrogate-assisted hybrid differential evolution is adopted for prescreening promising solutions in the decision space for exploration. Moreover, an effective repair strategy, named surrogate based repair strategy, is introduced to move the infeasible solutions closer to the feasible region. In the second search stage, a clustering strategy of feasible solutions is proposed based on the information provided by the first search stage and historical search. The clustering strategy adaptively generates a number of clusters, each of which can form a promising local region for the local search. Afterwards, local surrogates are built for finding the predicted optima in each local region. During the search process, a good balance between exploration and exploitation can be obtained by interleaving the two search stages. Experimental results indicate that SA-TSDE is highly competitive compared with some state-of-the-art methods.

Surrogate-assisted evolutionary algorithms (SAEAs) have been widely used for solving complex and computationally expensive optimization problems. However, most of the existing algorithms converge slowly in the later stage. This article proposes a novel two-stage data-driven evolutionary optimization (TS-DDEO) that meets the requirements of early exploration and later exploitation. In the first stage, a surrogate-assisted hierarchical particle swarm optimization method is used to find a promising area from the entire search space. In the second stage, we propose a best-data-driven optimization (BDDO) method with a strong exploitation ability to accelerate the optimization process. BDDO has a real-time update mechanism for the surrogate model and population and uses a predefined number of ranking-top solutions to update population and surrogates. BDDO combines three surrogate-assisted evolutionary sampling strategies: 1) surrogate-assisted differential evolution sampling; 2) surrogate-assisted local search; and 3) a surrogate-assisted full-crossover (FC) strategy which is proposed to integrate existing best genotypes in the population. Experiments and analysis have validated the effectiveness of the two-stage framework, the BDDO method, and the FC strategy. Moreover, the proposed algorithm is compared with five state-of-the-art SAEAs on high-dimensional benchmark functions. The result shows that TS-DDEO performs better both in effectiveness and robustness.

Aquila Optimization Algorithm (AQUILA) is a newly emerged metaheuristic optimizer for solving global optimization problems, which is based on intrinsic hunting behaviors of the foraging aquila individuals. However, this stochastic optimization method suffers from some algorithm-specific drawbacks, such as premature convergence to the local optimum points over the search hyperspace due to the lack of solution diversity in the population. To conquer this algorithmic deficiency, an ensemble of Wavelet mutation operators has been implemented into the standard AQUILA to enhance the explorative capabilities of the algorithm by diversifying the search domain as much as possible. Furthermore, a brand-new local search scheme empowered by the synergetic interactions of elite opposition-based learning and a simple-yet-effective exploitative manipulation equation is introduced into the base AQUILA to intensify on the previously visited promising regions. The proposed learning schemes are stochastically applied to the obtained solutions from the base Aquila algorithm to refine the overall solution quality and amend the premature convergence problem. It is also aimed to investigate whether the collective application of Wavelet mutation operators with different types entails a significant improvement in the general search effectivity of the algorithm rather than their individual efforts. Numerical experiments made on a suite of unconstrained unimodal and multimodal benchmark functions reveal that this hybridization with AQUILA has improved the general solution accuracy and stability to very high standards, outperforming its contemporary counterparts in the comparative statistical analysis. Furthermore, an exhaustive benchmark analysis has been performed on fourteen constrained real-world complex engineering problems.(c) 2022 International Association for Mathematics and Computers in Simulation (IMACS). Published by Elsevier B.V. All rights reserved.

An expensive multimodal optimization problem (EMMOP) is that the computation of the objective function is time consuming and it has multiple global optima. This article proposes a decomposition differential evolution (DE) based on the radial basis function (RBF) for EMMOPs, called D/REM. It mainly consists of two phases: the promising subregions detection (PSD) and the local search phase (LSP). In PSD, a population update strategy is designed and the mean-shift clustering is employed to predict the promising subregions of EMMOP. In LSP, a local RBF surrogate model is constructed for each promising subregion and each local RBF surrogate model tracks a global optimum of EMMOP. In this way, an EMMOP is decomposed into many expensive global optimization subproblems. To handle these subproblems, a popular DE variant, JADE, acts as the search engine to deal with these subproblems. A large number of numerical experiments unambiguously validate that D/REM can solve EMMOPs effectively and efficiently.

The application of Evolutionary Algorithms (EAs) to complex engineering optimization problems may present difficulties as they require many evaluations of the objective functions by computationally expensive simulation procedures. To deal with this issue, surrogate models have been employed to replace those expensive simulations. In this work, a surrogate-assisted evolutionary optimization procedure is proposed. The procedure combines the Differential Evolution method with a Anchor -nearest neighbors ( –NN) similarity-based surrogate model. In this approach, the database that stores the solutions evaluated by the exact model, which are used to approximate new solutions, is managed according to a merit scheme. Constraints are handled by a rank-based technique that builds multiple separate queues based on the values of the objective function and the violation of each constraint. Also, to avoid premature convergence of the method, a strategy that triggers a random reinitialization of the population is considered. The performance of the proposed method is assessed by numerical experiments using 24 constrained benchmark functions and 5 mechanical engineering problems. The results show that the method achieves optimal solutions with a remarkably reduction in the number of function evaluations compared to the literature.

International audience; New investigations were carried out to demonstrate the ability of Trichoderma viride dead biomass for the bioremoval of Cr(VI) from aqueous solutions. The gathered experimental data were initially modelled considering both adsorption and reduction kinetic models, followed by equilibrium models. In the next step, Design of Experiments method (DoE) and a Differential Evolution (DE) algorithm were applied for determining the optimal Response Surface Methodology and Artificial Neural Network (ANN) models which are able to correlate the process efficiency with the experimental conditions. In addition, DE (in combination with the previously determined ANN) was used to obtain the optimal working conditions for maximum process efficiency. These optimization procedures allow setting various process parameters and working conditions which ensure the maximum bioremoval efficiency. DoE highlighted that all the study parameters have statistically significant individual influence on Cr(VI) bioremoval efficiency and, for example, at pH 2 and a temperature of 50 °C, 100% of Cr(VI) is bioremoved if the biosorbent dosage is 10 g/L, considering a minimum contact time of 2 h and given a maximum initial concentration of 122.5 mg/L. According to the ANN model, a contact time set at 24 h yields optimal values for Cr(VI) bioremoval by dead biomass considering pH 1.00, 3 g/L biosorbent dosage, 23 mg/L metallic ion concentration and a temperature of 50 °C. pHpzc, FT-IR and SEM-EDX analyses were included for biomass characterization and to underline the bioremoval mechanism of Cr(VI). Our results are providing a solid basis for the development of technologies for detoxification of contaminated effluents. © 2022 Institution of Chemical Engineers

To sustain the economic growth, infrastructure development is only of the essential aspects and also the power sector is the most important infrastructure elements. For the increment of energy demand, apart from the conventional energy sources, the wind, solar etc., of the necessary sources to produce the electrical energy to meet out the demand. The conventional sources of energy associated with many problems like, prices increased for petroleum products, environmental implications, safety from radiations, global warming etc. To overcome the difficulties in association with conventional energy sources, most of the countries including India have shifted the attention for improving renewable energy sources. In practical, the Generation Expansion Planning (GEP) problem is a large scale and complex. Also the nonlinear optimization problem of mixed integer nature where the number of candidate solutions to be evaluated increases exponentially with system size. By the effective planning of power systems can be achieved by the accurate solution of the GEP problem. The aim of this paper is to apply the Differential Evolution (DE) algorithm to the GEP problem and find out the least cost expansion plan. It is applied for a test system of six and fourteen years planning horizons. As the wind energy composition in the system is continuously growing, the impact of the same has been studied. The different cost component with variations and also the reliability indices are studied.

In power systems, Economic Power dispatch Problem (EPP) is an influential optimization problem which is a highly non-convex and non-linear optimization problem. In the current study, a novel version of Differential Evolution (NDE) is used to solve this particular problem. NDE algorithm enhances local and global search capability along with efficient utilization of time and space by making use of two elite features: selfadaptive control parameter and single population structure. The combined effect of these concepts improves the performance of Differential Evolution (DE) without compromising on quality of the solution and balances the exploitation and exploration capabilities of DE. The efficiency of NDE is validated by evaluating on three benchmark cases of the power system problem having constraints such as power balance and power generation along with nonsmooth cost function and is compared with other optimization algorithms. The Numerical outcomes uncovered that NDE performed well for all the benchmark cases and maintained a trade-off between convergence rate and efficiency.

It is known that many-objective optimization problems (MaOPs) often face the difficulty of maintaining good diversity and convergence in the search process due to the high-dimensional objective space. To address this issue, this article proposes a novel multiobjective framework for many-objective optimization (Mo4Ma), which transforms the many-objective space into multiobjective space. First, the many objectives are transformed into two indicative objectives of convergence and diversity. Second, a clustering-based sequential selection strategy is put forward in the transformed multiobjective space to guide the evolutionary search process. Specifically, the selection is circularly performed on the clustered subpopulations to maintain population diversity. In each round of selection, solutions with good performance in the transformed multiobjective space will be chosen to improve the overall convergence. The Mo4Ma is a generic framework that any type of evolutionary computation algorithm can incorporate compatibly. In this article, the differential evolution (DE) is adopted as the optimizer in the Mo4Ma framework, thus resulting in an Mo4Ma-DE algorithm. Experimental results show that the Mo4Ma-DE algorithm can obtain well-converged and widely distributed Pareto solutions along with the many-objective Pareto sets of the original MaOPs. Compared with seven state-of-the-art MaOP algorithms, the proposed Mo4Ma-DE algorithm shows strong competitiveness and general better performance.

In recent decades, the insufficiency in power production has led to the incorporation of renewable energy sources into microgrid systems. However, ambiguity in the generation of renewable sources and load variation impacts on the system frequency influencing the stable operation of microgrid system. To augment the stable operation of the system an intelligent controller is required for continuous electric power. The implementation of a modified differential evolution (MDE)-based cascaded proportional integral derivative fractional filter (PIDFN) controller using integral of timeweighted absolute error (ITAE) is proposed in this work. In order to demonstrate the robustness and efficacy of the proposed MDE optimization technique is compared with differential evolution (DE), teaching learningbased optimization (TLBO), invasive weed optimization (IWO) and particle swarm optimization (PSO). MDE-based cascaded PIDFN controller is implemented for governing the frequency in two-area interconnected microgrid system. The system is substantiated over load perturbations, system uncertainties, communication delay and real time data of solar irradiance and wind speed and action of unified power flow controller (UPFC) in MATLAB®/Simulink environment.

Stock price prediction is a significant index which helps to achieve maximum benefit with minimum risk by increasing the decision making capability of financial investigators and investors. However, the problem of short term stock price prediction is a complex task due to its uncertainty, discontinuity, and random nonlinear nature. In this paper, a prediction model is proposed to predict random nonlinear stock market price using Intrinsic Time-Scale Decomposition (ITD), Cluster based Modified Crow Search Algorithm (CMCSA), and Optimized Extreme Learning Machine (OELM). ITD is adopted to decompose the non-stationary stock price data into some Proper-Rotation-Components (PRCs) and a residual component. ITD is used to convert non-stationary stock price data to stationary data which are simpler and steady for analysis. The CMCSA is proposed by modifying Crow Search Algorithm (CSA) with better capability to select optimal weight and biases of ELM. Thereafter, the optimized ELM is used to predict the PRCs and residual component individually which are then incorporated to predict closing price of short term stocks. The effectiveness of proposed CMCSA is tested and validated by solving benchmark problems. The experimental study indicates that the proposed ITD-CMCSA-OELM model outperforms the CMCSA-OELM, CSA-OELM, DE-OELM (Differential Evolution optimized ELM) and ANN models.

Wireless Sensor Networks include a substantial number of nodes with limited battery power that is used for gathering and sending the data to the Base station. Here most energy is consumed in data transfer. Hence a foremost problem is the maximization of network lifetime through minimization of energy consumption in the nodes. To resolve this issue, the clustering method is involved to achieve energy-efficient data transmission. A cluster head is elected which uses an energy distribution mechanism to conserve the remaining power, thereby extending network lifetime. Various present methodologies are employed but every algorithm had notable constraints individually. In this paper, a hybrid Sparrow Search Algorithm with Differential Evolution algorithm is intended to solve the energy efficiency issue by cluster head selection in Wireless Sensor Networks. The proposed algorithm uses the high-level search efficiency of the Sparrow Search Algorithm and the lively potential of Differential Evolution that enhances the lifetime of nodes. The performance of this hybrid model seems to be exploiting the count of alive nodes and dead nodes, throughput, and residual energy. The proposed Improved Sparrow search algorithm using the Differential evolution model for choosing the best possible cluster head shows a development in residual power and throughput than other compared algorithms.

The neural-network (NN)-based control method is a new emerging promising technique for controller design in a power electronic circuit (PEC). However, the optimization of NN-based controllers (NNCs) has significant challenges in two aspects. The first challenge is that the search space of the NNC optimization problem is such complex that the global optimization ability of the existing algorithms still needs to be improved. The second challenge is that the training process of the NNC parameters is very computationally expensive and requires a long execution time. Thus, in this article, we develop a powerful evolutionary computation-based algorithm to find a high-quality solution and reduce computational time. First, the differential evolution (DE) algorithm is adopted because it is a powerful global optimizer in solving a complex optimization problem. This can help to overcome the premature convergence in local optima to train the NNC parameters well. Second, to reduce the computational time, the DE is extended to distribute DE (DDE) by dispatching all the individuals to different distributed computing resources for parallel computing. Moreover, a resource-aware strategy (RAS) is designed to further efficiently utilize the resources by adaptively dispatching individuals to resources according to the real-time performance of the resources, which can simultaneously concern the computing ability and load state of each resource. Experimental results show that, compared with some other typical evolutionary algorithms, the proposed algorithm can get significantly better solutions within a shorter computational time.

Optimizing the production of electrical energy through the efficient management of reservoirs is one of the major concerns in power supply. Then, optimization methods have been employed to solve the problem of service continuity in a generation. Many reservoir management issues are indeed addressed without achieving a desired solution in line with demand. The main motivation for state-of-the-art technology is to develop robust and intelligent methods that enable strict compliance with production restrictions while meeting energy demand. This paper follows this perspective by proposing the water supply and hydroelectric production through a hybrid method combining the differential evolution and two constraints processing treatments (TCPT). The interest of the constraint method using here, including its superiority of feasible solutions (SF) and auto-adaptative penalty (AP) is its ability to overcome premature convergence and to obtain very accuracy near optimal solutions. AP technique improve by its ability process through tedious trial and error methods to select the best penalty coefficient during implementation. SF, for its part, is a technique for comparing unrealistic solutions on the basis of the violation of global constraint aimed at pushing unrealistic solutions towards the feasible region, while comparing two workable solutions on objective value improves the overall solution. To compare the performance of the proposed hybrid method of optimization with the SF and AP techniques as a constraint method, a series of experiments was firstly carried out using 25 well know benchmark functions. The obtained results as opposed to the current hybrid method such as TCPT-PSO, TCPT-ABC and TCPT-GA have exhibited the method’s superiority. Based on these performances, we employed the proposed hybrid method to manage the water supply and hydroelectric production of the Memve’ele reservoir. The application on the management of Memve’ele Reservoir demonstrates its accuracy in providing a near-optimal solution on the order of 99.7% for 1945s, 1985s and 1988s of demand during the seven hydrological years of the Ntem Valley with real mean square error (RMSE) in order of 10−7for water supply and hundredth for hydropower reservoir operation.

A growing number of organizations are hosting their software applications in distributed data centers (DCs) in the cloud, for faster response time and higher energy efficiency. The dramatic increase of user tasks, however, poses a significant challenge on DC providers to retain users' expectations on both aspects. To tackle this challenge, this work first formulates the problem into a constrained biobjective optimization problem. A biobjective algorithm, named simulated-annealing-based adaptive differential evolution (SADE), is presented to simultaneously reduce both the response time of tasks and energy cost. Meanwhile, a method of minimal Manhattan distance is adopted to search for a final knee, for achieving a good balance between response time minimization and energy cost reduction. Experimental results on real-life datasets, i.e., the electricity prices and tasks collected from a Google cluster trace, have proved that SADE yields less task response time and lower energy cost compared with state-of-the-art algorithms.

This paper proposes the tuning approach of the event-triggered controller (ETCTA) for the robotic system stabilization task where the reduction of the stabilization error and the data broadcasting of the control update are simultaneously considered. This approach is stated as a dynamic optimization problem, and the best controller parameters are obtained by using fourteen different bio-inspired optimization algorithms. The statistics results reveal that, among the tested bio-inspired optimization algorithms, the most reliable algorithm in the proposed tuning problem is the differential evolution variant DE/Best/1/Exp. The obtained result is validated both in numerical simulation as well as using a laboratory prototype. The simulation results indicate that the obtained control parameters can also deal with disturbances and reference changes not considered in the ETCTA’s optimization problem formulation without significantly worsening the control design objective. Experimental results disclose that the proposed event-triggered control tuning approach provides the best trade-off between the number of control signal updates and the position error among other tuning approaches, decreasing the data broadcasting of the control update by around 86.33% with a non-significant increase in the stabilization error of around 26.53%.

The economic load dispatch (ELD) problem plays a crucial role in power system operation. In practice, the ELD problem becomes a non-convex, multi-constraint, non-linear optimization problem when considering the valve point effects, the prohibited operation zones, the ramp rate limit, and the multi-fuel options. To effectively solve this problem, this paper puts forward an improved differential evolution (DE) named OMLIDE based on opposition-mutual learning, hybrid mutation strategy, and parameters adaptive mechanism. OMLIDE differs from the traditional DE in that: (1) an opposition-mutual learning strategy is employed for population initialization to increase the probability of finding an optimal solution; (2) two novel mutation operators named DE/elite-to-ordinary/1 and DE/elite-to-ordinary/2 are hybridized and a selection probability is introduced to regulate them adaptively at different evolutionary stages; and (3) a parameters adaptive mechanism is presented to adjust the scaling factor and crossover rate. The proposed OMLIDE is first validated by the numerical benchmark functions of CEC 2014. Then it is applied to five non-convex ELD problems with valve-point effects and multi-fuel options. Simulation results demonstrate that OMLIDE provides better or highly competitive results in different terms compared with other peer algorithms. This work was supported by the Basic Research Program of Guizhou Province (Natural Science) (QiankeheBasic-ZK[2022]General121) and the National Natural Science Foundation of China (52167007).

Surrogate-assisted evolutionary algorithms (SAEAs) have become very popular for tackling computationally expen-sive multiobjective optimization problems (EMOPs), as the sur-rogate models in SAEAs can approximate EMOPs well, thereby reducing the time cost of the optimization process. However, with the increased number of decision variables in EMOPs, the pre-diction accuracy of surrogate models will deteriorate, which inevitably worsens the performance of SAEAs. To deal with this issue, this paper suggests an ensemble surrogate-based frame-work for tackling EMOPs. In this framework, a global surrogate model is trained under the entire search space to explore the global area, while a number of surrogate sub-models are trained under different search subspaces to exploit the sub-area, so as to enhance the prediction accuracy and reliability. Moreover, a new infill sampling criterion is designed based on a set of reference vectors to select promising samples for training the models. To validate the generality and effectiveness of our framework, three state-of-the-art evolutionary algorithms (nondominated sorting genetic algorithm III (NSGA-III), multiobjective evolutionary algorithm based on decomposition with differential evolution (MOEA/D-DE) and reference vector-guided evolutionary algo-rithm (RVEA)) are embedded, which significantly improve their performance for solving most of the test EMOPs adopted in this paper. When compared to some competitive SAEAs for solving EMOPs with up to 30 decision variables, the experimental results also validate the advantages of our approach in most cases.

A considerable number of surrogate-assisted evolutionary algorithms (SAEAs) have been developed to solve expensive optimization problems (EOPs) with continuous objective functions. However, in the real-world applications, we may face EOPs with discontinuous objective functions, which are also called EOPs with discontinuous responses (EOPDRs). Indeed, EOPDRs pose a great challenge to current SAEAs. In this paper, a surrogate-assisted differential evolution (DE) algorithm with region division is proposed, named ReDSADE. ReDSADE includes three main strategies: the region division strategy, the Kriging-based search, and the radial basis function (RBF)-based local search. In the region division strategy, we define a new distance measure, called the objective-decision distance. Based on this distance, the evaluated solutions are partitioned into several clusters, and several support vector machine (SVM) classifiers are trained to classify them. These SVM classifiers divide the decision space into several subregions, with the aim of making the objective function continuous in them. In the Kriging-based search, a Kriging model is established in each subregion and combined with DE to search for the optimal solution. In the RBF-based local search, DE is coupled with RBF to search around the best solution found so far, thus accelerating the convergence. By combining these three strategies, ReDSADE is able to solve EOPDRs with limited function evaluations. Three set of test problems and a real-world application are utilized to verify the effectiveness of ReDSADE. The results demonstrate that ReDSADE exhibits good convergence accuracy and convergence speed.

Aiming to meet the growing demands for observation and analysis in IoT-based (Internet of Things) power system, the machine learning technology is adopted sto deal with the data-intensive power electronic applications in IoT. By feeding previous power electronic data into the learning model, accurate information is drawn and the quality of IoT-based power services is improved. Generally, the data-intensive electronic applications with machine learning are split as numerous data/control constrained tasks by workflow technology. The efficient execution of this data-intensive Power Workflow (PW) needs massive computing resources, which are available in the cloud infrastructure. Nevertheless, the execution efficiency of PW decreases due to inappropriate sub-task and data placement. In addition, the power consumption explodes due to massive data acquisition. To address these challenges, a PW placement method named PWP is devised. Specifically, the Non-dominated Sorting Differential Evolution (NSDE) is used to generate placement strategies. The simulation experiments show that PWP achieves the best trade-off among data acquisition time, power consumption, load distribution and privacy preservation, confirming that PWP is effective for the placement problem.

Knowledge transfer plays a vastly important role in solving multitask optimization problems (MTOPs). Many existing methods transfer task-specific knowledge such as the high-quality solution from one task to other tasks to enhance the optimization ability, which however may not work well or even have a negative effect if the tasks have very different task-specific knowledge. Hence, this paper proposes a meta-knowledge transfer-based differential evolution (MKTDE) algorithm by using a more general meta-knowledge transfer (MKT) method to solve MTOPs more efficiently. The meta-knowledge defined in this paper refers to the knowledge that can evolve task-specific knowledge during the evolutionary search. That is, the meta-knowledge is a kind of “knowledge of knowledge”, which denotes the knowledge of “how to solve problem via evolution” and “the feature of evolving high-quality solution”. The evolutionary search for solving different tasks can share common meta-knowledge even though these tasks involve heterogeneous data and have very different task-specific knowledge. Therefore, the MKT can associate the heterogeneous multi-source data of different tasks via transferring the meta-knowledge to help solve MTOPs more efficiently in a more general way. Moreover, to further enhance the MKTDE, two novel and efficient methods are proposed. One is a multiple populations for multiple tasks framework using a unified search space for making knowledge transfer flexibly. The other is an elite solution transfer method for achieving positive high-quality solution transfer. The superior performance of the proposed MKTDE is verified via extensive numerical experiments on both widely-used MTOP benchmark problems and real-world robot navigation problems, with comparisons with some state-of-the-art and the latest well-performing algorithms.

It is very difficult to locate multiple global optimal solutions (GOSs) of multimodal optimization problems (MMOPs). To deal with this issue, a penalty-based multimodal optimization differential evolution (DE), called PMODE, is developed in this article. In PMODE, a penalty strategy with a dynamic penalty radius is constructed to solve MMOPs. An elite selection mechanism is designed to identify and select elite solutions. The neighboring areas of these elite solutions are penalized. PMODE uses a popular DE variant--JADE as its search engine. The proposed PMODE is compared with several other state-of-the-art multimodal optimization algorithms on 20 MMOPs used in the IEEE CEC2013 special session. The experimental results show that PMODE performs better than other state-of-the-art methods.

In the iron and steel industry, the hardness of steel strips is one of the key performance indicators to evaluate strip quality and guide production for the continuous annealing production line (CAPL). However, the hardness cannot be measured online in the actual production process. Consequently, the precise prediction of the strip hardness based on practical data becomes one of the key tasks during production. In this article, a multiobjective sparse nonlinear ensemble learning with evolutionary feature selection (MOSNE-EFS) method is proposed, which is data-driven modeling of the soft sensor. The method mainly consists of two stages: 1) the construction of individual learners based on multiobjective feature selection learning (MOFSL) and 2) the selection and ensemble of individual learners based on sparse nonlinear ensemble learning via differential evolution (SNEL-DE). The final ensemble model obtained by SNEL-DE is used as the prediction model for strip hardness in CAPL. The proposed method is evaluated with industrial production data. Experimental results indicate that the two strategies, i.e., evolutionary feature selection and sparse nonlinear ensemble, are effective in improving the accuracy and robustness of the prediction model, and further comparison results demonstrate the superiority of the MOSNE-EFS model over the other existing methods.

The population size of DE plays a significant role in the way the algorithm performs as it influences whether good solutions can be found. Generally, the population size of DE algorithm is a user-defined input that remains fixed during the optimization process. Therefore, inadequate selection of DE population size may seriously hinder the performance of the algorithm. This paper investigates the impact of DE population size on (i) the performance of DE when applied to the optimal tuning of power system stabilizers (PSSs); and (ii) the ability of the tuned PSSs to perform efficiently to damp low-frequency oscillations. The effectiveness of these controllers is evaluated based on frequency domain analysis and validated using time-domain simulations. Simulation results show that a small population size may lead the algorithm to converge prematurely, and thus resulting in a poor controller performance. On the other hand, a large population size requires more computational effort, whilst no noticeable improvement in the performance of the controller is observed.

Building a post-layout simulation performance model is essential in closing the loop of analog circuits, but it is a challenging task because of the high-dimensional space and expensive simulation cost. To facilitate efficient modeling, this paper proposes a Global Mapping Model Fusion (GMMF) technique. The key idea of GMMF is to reuse the schematic-level model trained by the Artificial Neural Network (ANN) algorithm, and combine it with few mapping coefficients to build the post-simulation model. Furthermore, as an efficient global optimization algorithm, differential evolution is applied to determine the optimal mapping coefficients with few samples. In GMMF, only a small number of mapping coefficients are unknown, so the number of post-layout samples needed is significantly reduced. To enhance practical utility of the proposed GMMF technique, two specific mapping relations, i.e., linear or weakly no-linear and nonlinear, are carefully considered in this paper. We conduct experiments on two topologies of two-stage operational amplifier and comparator in different commercial processes. All the simulation data for modeling are obtained from a parametric design framework. A more than 5× runtime speedup is achieved over ANN without surrendering any accuracy.

In Deep Neural Networks (DNNs), several architectures had been proposed for the various complex tasks such as Machine Translation, Natural Language processing and time series forecasting. Long-Short Term Model (LSTM), a deep neural network became the popular architecture for solving sequential and time series problems and achieved markable results. On building the LSTM model, many hyper-parameters like activation function, loss function, and optimizer need to be set in advance. These hyper-parameters play a significant role in the performance of the DNNs. This work concentrates on finding a novel activation function that can replace the existing activation function such as sigmoid and tanh in the LSTM. The Differential Evolution Algorithm (DEA) based search methodology is proposed in our work to discover the novel activation function for the LSTM network. Our proposed methodology finds an optimal activation function that outperforms than the traditional activation functions like sigmoid ( σ ), hyperbolic tangent (tanh) and Rectified Linear Unit (ReLU). In this work, the newly explored activation function based on DEA methodology is sinh ( x ) + sinh - 1 ( x ) named as Combined Hyperbolic Sine (comb-H-sine) function. The proposed comb-H-sine activation function outperforms the traditional functions in LSTM with accuracy of 98.83%,93.49% and 78.38% with MNIST, IMDB and UCI HAR datasets respectively.

Real-time forecasting of the financial time-series data is challenging for many machine learning (ML) algorithms. First, many ML models operate offline, where they need a batch of data, which may not be available during training. Besides, due to a fixed architecture of the majority of the offline-based ML models, they suffer to deal with the uncertain nature of financial time-series data. In contrast, online learning mode evolving-structured ML models could be promising for financial time-series forecasting. For real-time deployment of such models, low memory demand is a must. Besides, the model's explainability plays a crucial role in forecasting financial time-series. Considering all the requirements, a rule-based autonomous neuro-fuzzy learning algorithm called the parsimonious learning machine (PALM) is proposed here to forecast time-varying stock indices. To provide efficient automation of the proposed algorithm by maintaining the model explainability in terms of limited number linguistic IF-THEN rules, two popular multiobjective evolutionary algorithms (MEAs), such as a real-coded genetic algorithm (GA) and a self-adaptive differential evolution (DE) algorithm are utilized here. In addition, fuzzy type-2 variants of PALMs' are considered here due to better uncertainty handling capacity than their type-1 counterparts. To evaluate the proposed algorithm's performance, the closing stock price of fifteen (15) different stock market indices are predicted here. From the results, it is observed that the MEA-based PALMs are performing better than the state-of-the-art benchmark online ML models and providing a rule-based explainable model to the end-user.

Solving constrained multiobjective optimization problems brings great challenges to an evolutionary algorithm, since it simultaneously requires the optimization among several conflicting objective functions and the satisfaction of various constraints. Hence, how to adjust the tradeoff between objective functions and constraints is crucial. In this article, we propose a dynamic selection preference-assisted constrained multiobjective differential evolutionary (DE) algorithm. In our approach, the selection preference of each individual is suitably switching from the objective functions to constraints as the evolutionary process. To be specific, the information of objective function, without considering any constraints, is extracted based on Pareto dominance to maintain the convergence and diversity by exploring the feasible and infeasible regions; while the information of constraint is used based on constrained dominance principle to promote the feasibility. Then, the tradeoff in these two kinds of information is adjusted dynamically, by emphasizing the utilization of objective functions at the early stage and focusing on constraints at the latter stage. Furthermore, to generate the promising offspring, two DE operators with distinct characteristics are selected as components of the search algorithm. Experiments on four test suites including 56 benchmark problems indicate that the proposed method exhibits superior or at least competitive performance, in comparison with other well-established methods.

In the blast furnace ironmaking process, accurate prediction of silicon content in molten iron is of great significance for maintaining stable furnace conditions, improving hot metal quality, and reducing energy consumption. However, most of the current research works employ linear correlation coefficient methods to select input features in modeling, which may not fully take the nonlinear and coupling relationships between features into account. Therefore, this article considers the input feature selection issue of silicon content prediction model from a new perspective and proposes a multiobjective evolutionary nonlinear ensemble learning model with evolutionary feature selection mechanism (MOENE-EFS), in which extreme learning machine is adopted as the base learner. MOENE-EFS takes the input feature scheme of each base learner as well as their network structure and parameters as decision variables and proposes a modified nondominated sorting differential evolution algorithm to optimize two conflicting objectives, i.e., accuracy and diversity of base learners, simultaneously. Through the optimization, a set of Pareto optimal base learners with high accuracy and strong diversity can be obtained. Moreover, different from the linear ensemble methods commonly used in classical evolutionary ensemble learning, this article proposes a nonlinear ensemble method to combine the obtained base learners based on differential evolution. Experimental results indicate that the two proposed strategies, i.e., evolutionary feature selection and nonlinear ensemble, are very effective in improving the accuracy and stability of the prediction model. MOENE-EFS also outperforms the other prediction models in both benchmark data and practical industrial data. Furthermore, analysis on the input features of all Pareto optimal base learners shows that the evolutionary feature selection is capable of selecting essential features and is consistent with human experience, which indicates it is a promising method to deal with the input feature selection issue in silicon content prediction.

In contrast to the traditional single-tasking evolutionary algorithms, evolutionary multitasking (EMT) travels in the search space of multiple optimization tasks simultaneously. Through sharing knowledge across the tasks, EMT is able to enhance solving the optimization tasks. However, if knowledge transfer is not properly carried out, the performance of EMT might become unsatisfactory. To address this issue and improve the quality of knowledge transfer among the tasks, a novel multiobjective EMT algorithm based on subspace alignment and self-adaptive differential evolution (DE), namely, MOMFEA-SADE, is proposed in this article. Particularly, a mapping matrix obtained by subspace learning is used to transform the search space of the population and reduce the probability of negative knowledge transfer between tasks. In addition, DE characterized by a self-adaptive trial vector generation strategy is introduced to generate promising solutions based on previous experiences. The experimental results on multiobjective multi/many-tasking optimization test suites show that MOMFEA-SADE is superior or comparable to other state-of-the-art EMT algorithms. MOMFEA-SADE also won the Competition on Evolutionary Multitask Optimization (the multitask multiobjective optimization track) within IEEE 2019 Congress on Evolutionary Computation.

Purpose This paper aims to compare stochastic gradient method used for neural network training with global optimizer without use of gradient information, in particular differential evolution. Design/methodology/approach This contribute shows the application of heuristic optimization algorithms to the training phase of artificial neural network whose aim is to predict renewable power production as function of environmental variables such as solar irradiance and temperature. The training problem is cast as the minimization of a cost function whose degrees of freedom are the parameters of the neural network. A differential evolution algorithm is substituted to the more usual gradient-based minimization procedure, and the comparison of their performances is presented. Findings The two procedures based on stochastic gradient and differential evolution reach the same results being the gradient based moderately quicker in convergence but with a lower value of reliability, as a significant number of runs do not reach convergence. Research limitations/implications The approach has been applied to two forecasting problems and, even if results are encouraging, the need for extend the approach to other problems is needed. Practical implications The new approach could open the training of neural network to more stable and general methods, exploiting the potentialities of parallel computing. Originality/value To the best of the authors’ knowledge, the research presented is fully original for the part regarding the neural network training with differential evolution.

Current pulses are convenient to be actively implemented by a Battery Management System (BMS). However, the Short-Term Features (STF) from currentpulses originate from various sensors with uneven qualities, which hinders one powerful and strong learner with STF for the battery SOH estimation. This paper thus proposes an optimized weak learner formulation procedure for Lithium-ion (Li-ion) battery SOH estimation, which further enables the automatic initialization and integration of the weak learners with STF into an efficient SOH estimation framework. A Pareto Front-based Selection Strategy (PFSS) is designed to select the representative solutions from the non-dominated solutions fed by a Knee point driven Evolutionary Algorithm (KnEA), which guarantees both the diversity and accuracy of the weak learners. Afterwards, the weak learners, whose coefficients are obtained by Selfadaptive Differential Evolution (SaDE), are integrated by a weight-based structure. The proposed method utilizes the weak learners with STF to boost the overall performance of SOH estimation. The validation of the proposed method is proved by LiFePO4/C batteries under accelerated cycling ageing test including one mission profile providing Primary Frequency Regulation (PFR) service to the grid and one constant current profile.

Since last few years, microarray technology has got tremendous application in many bio-medical researches. However, in order to efficiently recognize and apply this technology into the bio-medical areas is still very difficult and expensive. There are many metaheuristic approaches has been developed with different biological interpretation. Despite the existence of several approaches, there is always a requirement of development of more robust and efficient approach. In this work a new metaheuristic approach is proposed implementing binary shuffled frog leaping algorithm (BSFLA) for gene selection. To obtain an optimal gene subset, 20 different combination of gene subset is extracted from the original dataset. Out of which the optimal gene subset is identified implementing KNN classifier. Superiority of these gene set is shown using few other classifiers such as ANN and SVM. The model performance is also compared with few other metaheuristic approaches such as particle swarm optimization, differential evolution and genetic algorithm.

Quantum-inspired differential evolution (QDE) is an evolutionary algorithm, which can effectively solve complex optimization problems. However, sometimes, it easily leads to premature convergence and low search ability and falls to local optima. To overcome these problems, based on the MSIQDE (improved QDE with multistrategies) algorithm, an enhanced MSIQDE algorithm based on mixing multiple strategies, namely, EMMSIQDE is proposed in this article. In the EMMSIQDE, a new differential mutation strategy of a difference vector is proposed to enhance the search ability and descent ability. Then, a new multipopulation mutation evolution mechanism is designed to ensure the relative independence of each subpopulation and the population diversity. The feasible solution space transformation strategy is used to achieve the optimal solution by mapping the quantum chromosome from a unit space to solution space. Finally, some multidimensional unimodal and multimodal functions are selected to demonstrate the optimization performance of EMMSIQDE. The results demonstrate that the EMMSIQDE is significantly better than the DE, QDE, QGA, and MSIQDE, and has better optimization ability, scalability, efficiency, and stability.

In this article, a hybrid asynchronous particle swarm optimization-genetic algorithm (APSO-GA) is proposed for the removal of unwanted lower order harmonics in the cascaded H-bridge multilevel inverter (MLI). The APSO-GA is applicable to all levels of MLI. In the proposed method, ring topology based APSO is hybrid with GA. APSO is applied for exploration and GA is used for the exploitation of the best solutions. In this article, optimized switching angles are calculated using APSO-GA for seven-level and nine-level inverter, and results are compared with GA, PSO, APSO, bee algorithm (BA), differential evolution (DE), synchronous PSO, and teaching–learning-based optimization (TLBO). Simulation results show that APSO-GA can easily find feasible solutions particularly when the number of switching angles is high; however, the rest of all stuck at local minima due to less exploration capability. Also, the APSO-GA is less computational complex than GA, BA, TLBO, and DE algorithms. Experimentally, the performance of APSO-GA is validated on a single-phase seven-level inverter.

Evolutionary algorithms (EAs) have been recognized as a promising approach for bi-level optimization. However, the population-based characteristic of EAs largely influences their efficiency and effectiveness due to the nested structure of the two levels of optimization problems. In this paper, we propose a transfer learning based parallel evolutionary algorithm (TLEA) framework for bi-level optimization. In this framework, the task of optimizing a set of lower level problems parameterized by upper level variables is conducted in a parallel manner. In the meanwhile, a transfer learning strategy is developed to improve the effectiveness of each lower level search (LLS) process. In practice, we implement two versions of the TLEA: the first version uses the covariance matrix adaptation evolutionary strategy and the second version uses the differential evolution as the evolutionary operator in lower level optimization. Experimental studies on two sets of widely used bi-level optimization benchmark problems are conducted, and the performance of the two TLEA implementations is compared to that of four well-established evolutionary bi-level optimization algorithms to verify the effectiveness and efficiency of the proposed algorithm framework.

This paper presents spacecraft trajectory optimizations for deep-space missions requiring multiple gravity-assists (MGA). The main algorithm is based on a self-adaptive/self-learning differential evolution (DE). In the process of improving the performance of DE for optimizing the MGA trajectory, the proposed algorithm alleviates the dependence on predetermined mutation strategy and control parameters in DE; as evolution progresses, the mutation strategy and the control parameters switch adaptively to more promising ones by reflecting experiences in previous evolution steps. Furthermore, the proposed algorithm is equipped with a re-initialization technique to directly mollify the issue of converging to a local optimum, which is often observed when optimizing the MGA trajectory. In order to demonstrate these favorable characteristics, the proposed algorithm is implemented to solve six well-known MGA trajectory optimization problems designed by the European space agency (ESA). Compared with the latest representative evolutionary algorithms, the proposed algorithm can successfully converge to the currently known best solutions of five MGA problems; our solutions to four of those MGA problems are better than currently known solutions. The proposed algorithm also performs well as a local/auxiliary search algorithm to improve the performance of other evolutionary algorithms. In addition to describing the algorithms and solutions characteristics, sensitivity analysis is presented to quantitatively investigate the search capability of finding the optimal solutions of MGA problems. The overall results show that our self-learning DE is competitively compared with other representative algorithms in terms of convergences to the global optimum, reliable search capability, and applicability to a variety of deep-space trajectory optimizations.

Aims : The main focus in this work is to improve balanced and sinusoidal grid currents by feeding compensating current at point of common coupling (PCC). Background: In recent years the advancement in electronics and electrical appliances are widely improved and are also more sophisticated. These appliances require uninterrupted and quality power. Therefore in the growing power system scenario, several issues like malfunction of electrical sensitive devices, overheat in transformer, interference in communication, failures in computer network etc., adversely affects the power quality (PQ). These issues are generated due to rapid use of non-linear loads in three-phase system which generates harmonics in the system. To overcome from these PQ issues, several PQ mitigation custom power devices are integrated in power distribution network. But, the conventional PQ mitigation devices are insufficient to eliminate PQ problems such as current and voltage harmonics, voltage sag/swell and voltage unbalances associated with the power distribution network. Objective : The objective of using A-PSO is to find the global optimum of the spread factor parameter at the upper level. APSO, has a faster convergence speed and correct response compared to the PSO algorithm. Method : SO A-PSO M p-q. Result: A-PSO is giving better results than PSO. Conclusion : A three-phase system with SHAPF injected at PCC is proposed in this paper. The SHAPF injects filter current at PCC for supressing the harmonics using a modified pq scheme. For controlling the PIC, two optimised parameters are discussed and found that reducing the harmonics distortions using A-PSO is giving better results compare to the conventional PSO.

Evolutionary algorithms and swarm intelligence algorithms have been widely used for constrained optimization problems for decades and numerous techniques for constraint handling have been proposed. The e-constrained method is a very effective one. In the literature, the e value was usually controlled via an exponential function, which is not competent for solving certain types of constrained optimization problems, e.g., whose global optima are located near the boundary of the feasible and infeasible regions. To solve this problem, this article proposes a new adaptive e control method and incorporate it into a basic differential evolution (DE) algorithm: (DE/rand/1/exp). Based on the information of constraint violation in the current population, the adaptive method controls the value of e through a simple heuristic rule. Compared with the traditional exponential function-based control methods, the proposed adaptive method can prevent the algorithm from being trapped into local optima while retaining the obtained near-optimal candidate solutions in the infeasible region for generating promising searching paths. Besides, we set the crossover rate (CR) as a more reasonable value for DE/rand/1/exp, which can enhance the efficiency significantly. The well-known 2006 IEEE Congress on Evolutionary Computation (CEC 2006) competition on real-parameter single-objective constrained optimization benchmark is adopted to evaluate the effectiveness of the proposed adaptive e-constrained DE. Fifteen constrained engineering optimization problems are collected from the literature to test the proposed algorithm. Moreover, the adaptive e control method is extended to an adaptive algorithm to solve the benchmark problems from CEC 2017. The comparison results confirm the superiority of the proposed method.

Recently, the numerical optimization field has attracted the research community to propose and develop various metaheuristic optimization algorithms. This paper presents a new metaheuristic optimization algorithm called Honey Badger Algorithm (HBA). The proposed algorithm is inspired from the intelligent foraging behavior of honey badger, to mathematically develop an efficient search strategy for solving optimization problems. The dynamic search behavior of honey badger with digging and honey finding approaches are formulated into exploration and exploitation phases in HBA. Moreover, with controlled randomization techniques, HBA maintains ample population diversity even towards the end of the search process. To assess the efficiency of HBA, 24 standard benchmark functions, CEC’17 test-suite, and four engineering design problems are solved. The solutions obtained using the HBA have been compared with ten well-known metaheuristic algorithms including Simulated annealing (SA), Particle Swarm Optimization (PSO), Covariance Matrix Adaptation Evolution Strategy (CMA-ES), Success-History based Adaptive Differential Evolution variants with linear population size reduction (L-SHADE), Moth-flame Optimization (MFO), Elephant Herding Optimization (EHO), Whale Optimization Algorithm (WOA), Grasshopper Optimization Algorithm (GOA), Thermal Exchange Optimization (TEO) and Harris hawks optimization (HHO). The experimental results, along with statistical analysis, reveal the effectiveness of HBA for solving optimization problems with complex search-space, as well as, its superiority in terms of convergence speed and exploration–exploitation balance, as compared to other methods used in this study. The source code of HBA is currently available for public at https://www.mathworks.com/matlabcentral/fileexchange/98204-honey-badger-algorithm .

Differential evolution is a powerful nature-inspired real-parameter optimization algorithm that has been successfully used to solve a number of hard optimization problems. It has been used to tackle both continuous and discrete optimization problems. The application of a continuous method to discrete problems involves several challenges, including solution representation and search space – solution space mapping. In this work, we study random key encoding, a popular encoding scheme that is used to represent permutations in high-dimensional continuous spaces. We analyze the search space it constitutes, study its structure and properties, and introduce two novel modifications of the encoding. We investigate the proposed encoding strategies in the context of four variants of the differential evolution algorithm and demonstrate their usefulness for two widespread permutation problems: the linear ordering problem and the traveling salesman problem.

Expensive optimization problem (EOP) widely exists in various significant real-world applications. However, EOP requires expensive or even unaffordable costs for evaluating candidate solutions, which is expensive for the algorithm to find a satisfactory solution. Moreover, due to the fast-growing application demands in the economy and society, such as the emergence of the smart cities, the internet of things, and the big data era, solving EOP more efficiently has become increasingly essential in various fields, which poses great challenges on the problem-solving ability of optimization approach for EOP. Among various optimization approaches, evolutionary computation (EC) is a promising global optimization tool widely used for solving EOP efficiently in the past decades. Given the fruitful advancements of EC for EOP, it is essential to review these advancements in order to synthesize and give previous research experiences and references to aid the development of relevant research fields and real-world applications. Motivated by this, this paper aims to provide a comprehensive survey to show why and how EC can solve EOP efficiently. For this aim, this paper firstly analyzes the total optimization cost of EC in solving EOP. Then, based on the analysis, three promising research directions are pointed out for solving EOP, which are problem approximation and substitution, algorithm design and enhancement, and parallel and distributed computation. Note that, to the best of our knowledge, this paper is the first that outlines the possible directions for efficiently solving EOP by analyzing the total expensive cost. Based on this, existing works are reviewed comprehensively via a taxonomy with four parts, including the above three research directions and the real-world application part. Moreover, some future research directions are also discussed in this paper. It is believed that such a survey can attract attention, encourage discussions, and stimulate new EC research ideas for solving EOP and related real-world applications more efficiently.

Medical prediction systems recognize as a significant AI field of study. A huge number of methodologies have been produced in the last decades to solve different kinds of prediction system problems in medical fields, in order to assist physicians in their diagnoses. Deep neural network (DNN) considers an extraordinary method in the medical prediction area. The purpose of this study is to enhance DNN accuracy using a meta-heuristic approach by propose a hybrid model formulated of two meta-heuristic algorithms evolutionary as population-based solution and trajectory as a single-based solution to improve (DNN) to facilitate exploration and exploitation balance and consequently enhance medical dataset prediction. The complex structure of DNN to achieve a best classification accuracy would be useful for meta-heuristic algorithm efficiency for searching the global optimum. To verify the proposal method, the study enhanced DNN with four meta-heuristic algorithms to test the selected medical benchmarks separately. The meta-heuristic algorithms included two population-based algorithms, namely, genetic algorithms GA and differential evolution DE, and two single-based algorithms, namely, simulated annealing SA and Tabu search TS. The proposed methodology registered a significant enhancement in anemia classification comparing with four other meta-heuristic algorithms; the anemia data was composed of a real dataset gathered from Iraqi blood laboratories to detect anemia diseases. Meanwhile, the proposal applied two benchmarks from the University of California repository (UCI), namely, Pima Indian diabetes data and liver disorder diseases. The proposed method attained remarkable results.

The differential evolution (DE) algorithm was deployed to calibrate microparameters of the DEM cohesive granular material. 4 macroparameters, namely, uniaxial compressive strength, direct tensile strength, Young’s modulus and Poisson’s ratio, can be calibrated to high accuracy. The best calibration accuracy could reach the sum of relative errors REsum

Robotic manipulators are electronically controlled mechanical devices with several links, which are used to perform any specific task under certain circumstances. However, the vibration of these manipulators can provide a hindrance in the completion of the task. Hence, it is highly essential to model and control these manipulators appropriately to minimize the vibrations. This paper provides a comprehensive review of modelling and control techniques of different types of manipulators such as Single Link Manipulator (SLM), Single-Link flexible Manipulator (SLFM), and manipulator with double link (DLM). Furthermore, this review discusses the merits and demerits of different manipulator models and their control methodologies. Moreover, the utilization of the several optimization algorithms such as Differential Evolution (DE), Cuckoo Search (CSA), the Bat Algorithm (BA), the Particle Swarm Optimization (PSO), the Ant Colony Algorithm (ACA), and so on in controlling the position, velocity, and vibration of the manipulators are explored in this paper.

Some recent research reports that a dendritic neuron model (DNM) can achieve better performance than traditional artificial neuron networks (ANNs) on classification, prediction, and other problems when its parameters are well-tuned by a learning algorithm. However, the back-propagation algorithm (BP), as a mostly used learning algorithm, intrinsically suffers from defects of slow convergence and easily dropping into local minima. Therefore, more and more research adopts non-BP learning algorithms to train ANNs. In this paper, a dynamic scale-free network-based differential evolution (DSNDE) is developed by considering the demands of convergent speed and the ability to jump out of local minima. The performance of a DSNDE trained DNM is tested on 14 benchmark datasets and a photovoltaic power forecasting problem. Nine meta-heuristic algorithms are applied into comparison, including the champion of the 2017 IEEE Congress on Evolutionary Computation (CEC2017) benchmark competition effective butterfly optimizer with covariance matrix adapted retreat phase (EBOwithCMAR). The experimental results reveal that DSNDE achieves better performance than its peers.

Tobacco industry companies need to conduct a regular inventory of finished products and raw and auxiliary materials, and drones with radio frequency identification (RFID) readers are becoming a major application trend of inventory. Under the condition of ensuring the accuracy of inventory, this article considers the physical performance constraints of the drone, the constraints of the RFID reader, etc., and introduces the force of the drone into the model establishment, and a task planning model for UAV inventory library equipped with RFID reader is proposed. Then, in view of the problem that the greedy strategy in the traditional differential evolution (DE) algorithm will cause the location information retained by other individuals to be lost, a hybrid DE algorithm based on the lion swarm optimization is proposed. Finally, the proposed algorithm was verified by environmental modeling based on the data of the tobacco enterprise warehouse.

This paper proposes an adaptive memetic differential evolution with multi-niche sampling and neighborhood crossover strategies for global optimization. In the proposed algorithm, a multi-niche sampling strategy is designed to sample a subpopulation for evolution at each generation. In this strategy, the entire population is firstly divided into multiple niches by employing a certain niching strategy at each generation. A subpopulation is then dynamically sampled from the resulting niches such that supporting a diverse search at the early stage of evolution while an intensive search towards the end of evolution. The above strategy will be further coupled with a neighborhood crossover, which is devised to encourage high potential solutions for exploitation while low potential solutions for exploration, thus appropriately searching the solution space. Additionally, an adaptive local search (ALS) scheme along with an adaptive elimination operation (AEO) have been designed. The ALS aims to appropriately fine-tune promising solutions in the sampled subpopulation while the AEO tends to adaptively eliminate unpromising individuals in the population during evolution. The performance of the proposed algorithm has been evaluated on CEC’2015 benchmark functions and compared with related methods. Experimental results show that our algorithm can achieve a superior performance and outperform related methods. The results also confirm the significance of devised strategies in the proposed algorithm.