A self-adaptive differential evolution neutron spectrum unfolding algorithm(SDENUA)is established in this study to unfold the neutron spectra obtained from a water-pumping-injection multilayered concentric sphere neut...A self-adaptive differential evolution neutron spectrum unfolding algorithm(SDENUA)is established in this study to unfold the neutron spectra obtained from a water-pumping-injection multilayered concentric sphere neutron spectrometer(WMNS).Specifically,the neutron fluence bounds are estimated to accelerate the algorithm convergence,and the minimum error between the optimal solution and input neutron counts with relative uncertainties is limited to 10^(-6)to avoid unnecessary calculations.Furthermore,the crossover probability and scaling factor are self-adaptively controlled.FLUKA Monte Carlo is used to simulate the readings of the WMNS under(1)a spectrum of Cf-252 and(2)its spectrum after being moderated,(3)a spectrum used for boron neutron capture therapy,and(4)a reactor spectrum.Subsequently,the measured neutron counts are unfolded using the SDENUA.The uncertainties of the measured neutron count and the response matrix are considered in the SDENUA,which does not require complex parameter tuning or an a priori default spectrum.The results indicate that the solutions of the SDENUA agree better with the IAEA spectra than those of MAXED and GRAVEL in UMG 3.1,and the errors of the final results calculated using the SDENUA are less than 12%.The established SDENUA can be used to unfold spectra from the WMNS.展开更多
In the fed-batch cultivation of Saccharomyces cerevisiae,excessive glucose addition leads to increased ethanol accumulation,which will reduce the efficiency of glucose utilization and inhibit product synthesis.Insuffi...In the fed-batch cultivation of Saccharomyces cerevisiae,excessive glucose addition leads to increased ethanol accumulation,which will reduce the efficiency of glucose utilization and inhibit product synthesis.Insufficient glucose addition limits cell growth.To properly regulate glucose feed,a different evolution algorithm based on self-adaptive control strategy was proposed,consisting of three modules(PID,system identification and parameter optimization).Performance of the proposed and conventional PID controllers was validated and compared in simulated and experimental cultivations.In the simulation,cultivation with the self-adaptive control strategy had a more stable glucose feed rate and concentration,more stable ethanol concentration around the set-point(1.0 g·L^(-1)),and final biomass concentration of 34.5 g-DCW·L^(-1),29.2%higher than that with a conventional PID control strategy.In the experiment,the cultivation with the self-adaptive control strategy also had more stable glucose and ethanol concentrations,as well as a final biomass concentration that was 37.4%higher than that using the conventional strategy.展开更多
There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced se...There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm （ESEA） to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.展开更多
In this paper, the authors show that the general linear second order ordinary Differential Equation can be formulated as an optimization problem and that evolutionary algorithms for solving optimization problems can a...In this paper, the authors show that the general linear second order ordinary Differential Equation can be formulated as an optimization problem and that evolutionary algorithms for solving optimization problems can also be adapted for solving the formulated problem. The authors propose a polynomial based scheme for achieving the above objectives. The coefficients of the proposed scheme are approximated by an evolutionary algorithm known as Differential Evolution (DE). Numerical examples with good results show the accuracy of the proposed method compared with some existing methods.展开更多
In this paper, a new hybrid algorithm based on exploration power of a new improvement self-adaptive strategy for controlling parameters in DE （differential evolution） algorithm and exploitation capability of Nelder-...In this paper, a new hybrid algorithm based on exploration power of a new improvement self-adaptive strategy for controlling parameters in DE （differential evolution） algorithm and exploitation capability of Nelder-Mead simplex method is presented （HISADE-NMS）. The DE has been used in many practical cases and has demonstrated good convergence properties. It has only a few control parameters as number of particles （NP）, scaling factor （F） and crossover control （CR）, which are kept fixed throughout the entire evolutionary process. However, these control parameters are very sensitive to the setting of the control parameters based on their experiments. The value of control parameters depends on the characteristics of each objective function, therefore, we have to tune their value in each problem that mean it will take too long time to perform. In the new manner, we present a new version of the DE algorithm for obtaining self-adaptive control parameter settings. Some modifications are imposed on DE to improve its capability and efficiency while being hybridized with Nelder-Mead simplex method. To valid the robustness of new hybrid algorithm, we apply it to solve some examples of structural optimization constraints.展开更多
Robust and efficient AUV path planning is a key element for persistence AUV maneuvering in variable underwater environments. To develop such a path planning system, in this study, differential evolution(DE) algorithm ...Robust and efficient AUV path planning is a key element for persistence AUV maneuvering in variable underwater environments. To develop such a path planning system, in this study, differential evolution(DE) algorithm is employed. The performance of the DE-based planner in generating time-efficient paths to direct the AUV from its initial conditions to the target of interest is investigated within a complexed 3D underwater environment incorporated with turbulent current vector fields, coastal area,islands, and static/dynamic obstacles. The results of simulations indicate the inherent efficiency of the DE-based path planner as it is capable of extracting feasible areas of a real map to determine the allowed spaces for the vehicle deployment while coping undesired current disturbances, exploiting desirable currents, and avoiding collision boundaries in directing the vehicle to its destination. The results are implementable for a realistic scenario and on-board real AUV as the DE planner satisfies all vehicular and environmental constraints while minimizing the travel time/distance, in a computationally efficient manner.展开更多
To solve dynamic optimization problem of chemical process (CPDOP), a hybrid differential evolution algorithm, which is integrated with Alopex and named as Alopex-DE, was proposed. In Alopex-DE, each original individua...To solve dynamic optimization problem of chemical process (CPDOP), a hybrid differential evolution algorithm, which is integrated with Alopex and named as Alopex-DE, was proposed. In Alopex-DE, each original individual has its own symbiotic individual, which consists of control parameters. Differential evolution operator is applied for the original individuals to search the global optimization solution. Alopex algorithm is used to co-evolve the symbiotic individuals during the original individual evolution and enhance the fitness of the original individuals. Thus, control parameters are self-adaptively adjusted by Alopex to obtain the real-time optimum values for the original population. To illustrate the whole performance of Alopex-DE, several varietal DEs were applied to optimize 13 benchmark functions. The results show that the whole performance of Alopex-DE is the best. Further, Alopex-DE was applied to solve 4 typical CPDOPs, and the effect of the discrete time degree on the optimization solution was analyzed. The satisfactory result is obtained.展开更多
The performance of network equipments, such as firewall, router, etc., is decided by the efficiency of patch matching. It is difficult to adapt the speed of packet matching with packets linear forwarding by traditiona...The performance of network equipments, such as firewall, router, etc., is decided by the efficiency of patch matching. It is difficult to adapt the speed of packet matching with packets linear forwarding by traditional algorithms. The purpose of this paper is to develop a novel algorithm of packet matching based on improving differential evolutionary algorithm, which also combines with classic packets matching algorithms to improve the performance of algorithm. For the sake of objectivity, the statistics method was used to compute the fitting value. Experiments showed that this new algorithm effectively improved the performance in the speed and storage space, as compared with the traditional one. For the first time, evolutionary algorithm is used to solve the network data packet forwarding, and packets can be forwarded at the linear speed. In addition, this new algorithm is universal, so it can be adapted for many equipment.展开更多
Differential evolution (DE) algorithm has been shown to be a simple and efficient evolutionary algorithm for global optimization over continuous spaces, and has been widely used in both benchmark test functions and re...Differential evolution (DE) algorithm has been shown to be a simple and efficient evolutionary algorithm for global optimization over continuous spaces, and has been widely used in both benchmark test functions and real-world applications. This paper introduces a novel mutation operator, without using the scaling factor F, a conventional control parameter, and this mutation can generate multiple trial vectors by incorporating different weighted values at each generation, which can make the best of the selected multiple parents to improve the probability of generating a better offspring. In addition, in order to enhance the capacity of adaptation, a new and adaptive control parameter, i.e. the crossover rate CR, is presented and when one variable is beyond its boundary, a repair rule is also applied in this paper. The proposed algorithm ADE is validated on several constrained engineering design optimization problems reported in the specialized literature. Compared with respect to algorithms representative of the state-of-the-art in the area, the experimental results show that ADE can obtain good solutions on a test set of constrained optimization problems in engineering design.展开更多
We introduce a new parallel evolutionary algorithm in modeling dynamic systems by nonlinear higher-order ordinary differential equations (NHODEs). The NHODEs models are much more universal than the traditional linear ...We introduce a new parallel evolutionary algorithm in modeling dynamic systems by nonlinear higher-order ordinary differential equations (NHODEs). The NHODEs models are much more universal than the traditional linear models. In order to accelerate the modeling process, we propose and realize a parallel evolutionary algorithm using distributed CORBA object on the heterogeneous networking. Some numerical experiments show that the new algorithm is feasible and efficient.展开更多
To implement self-adaptive control parameters, a hybrid differential evolution algorithm integrated with particle swarm optimization （PSODE） is proposed. In the PSODE, control parameters are encoded to be a symbioti...To implement self-adaptive control parameters, a hybrid differential evolution algorithm integrated with particle swarm optimization （PSODE） is proposed. In the PSODE, control parameters are encoded to be a symbiotic individual of original individual, and each original individual has its own symbiotic individual. Differential evolution （ DE） operators are used to evolve the original population. And, particle swarm optimization （PSO） is applied to co-evolving the symbiotic population. Thus, with the evolution of the original population in PSODE, the symbiotic population is dynamically and self-adaptively adjusted and the realtime optimum control parameters are obtained. The proposed algorithm is compared with some DE variants on nine functious. The results show that the average performance of PSODE is the best.展开更多
Differential evolution algorithm based on the covariance matrix learning can adjust the coordinate system according to the characteristics of the population, which make<span style="font-family:Verdana;"&g...Differential evolution algorithm based on the covariance matrix learning can adjust the coordinate system according to the characteristics of the population, which make<span style="font-family:Verdana;">s</span><span style="font-family:Verdana;"> the search move in a more favorable direction. In order to obtain more accurate information about the function shape, this paper propose</span><span style="font-family:Verdana;">s</span><span style="font-family:;" "=""> <span style="font-family:Verdana;">covariance</span><span style="font-family:Verdana;"> matrix learning differential evolution algorithm based on correlation (denoted as RCLDE)</span></span><span style="font-family:;" "=""> </span><span style="font-family:Verdana;">to improve the search efficiency of the algorithm. First, a hybrid mutation strategy is designed to balance the diversity and convergence of the population;secondly, the covariance learning matrix is constructed by selecting the individual with the less correlation;then, a comprehensive learning mechanism is comprehensively designed by two covariance matrix learning mechanisms based on the principle of probability. Finally,</span><span style="font-family:;" "=""> </span><span style="font-family:;" "=""><span style="font-family:Verdana;">the algorithm is tested on the CEC2005, and the experimental results are compared with other effective differential evolution algorithms. The experimental results show that the algorithm proposed in this paper is </span><span style="font-family:Verdana;">an effective algorithm</span><span style="font-family:Verdana;">.</span></span>展开更多
A novel and simple technique to control the search direction of the differential mutation was proposed.In order to verify the performance of this method,ten widely used benchmark functions were chosen and the results ...A novel and simple technique to control the search direction of the differential mutation was proposed.In order to verify the performance of this method,ten widely used benchmark functions were chosen and the results were compared with the original differential evolution(DE)algorithm.Experimental results indicate that the search direction controlled DE algorithm obtains better results than the original DE algorithm in term of the solution quality and convergence rate.展开更多
Since traditional fault tolerance methods of electronic systems are based on redundant fault tolerance technique,and their structures are fixed when circuits are designed,the self-adaptive ability is limited.In order ...Since traditional fault tolerance methods of electronic systems are based on redundant fault tolerance technique,and their structures are fixed when circuits are designed,the self-adaptive ability is limited.In order to solve these problems,a novel circuit self-adaptive design technique based on evolvable hardware(EHW)is proposed.It features robustness,self-organization and self-adaption.It can be adapted to a complex environment through dynamic configuration of the circuit.In this paper,the proposed technique simulated.The consumption of hardware resources and the number of convergence iterations researched.The effectiveness and superiority of the proposed technique are verified.The designed circuit has the ability of resistible redundant-state interference(RRSI).The proposed technique has a broad application prospect,and it has great significance.展开更多
Radial Basis Function Neural Network(RBFNN)ensembles have long suffered from non-efficient training,where incorrect parameter settings can be computationally disastrous.This paper examines different evolutionary algor...Radial Basis Function Neural Network(RBFNN)ensembles have long suffered from non-efficient training,where incorrect parameter settings can be computationally disastrous.This paper examines different evolutionary algorithms for training the Symbolic Radial Basis Function Neural Network(SRBFNN)through the behavior’s integration of satisfiability programming.Inspired by evolutionary algorithms,which can iteratively find the nearoptimal solution,different Evolutionary Algorithms(EAs)were designed to optimize the producer output weight of the SRBFNN that corresponds to the embedded logic programming 2Satisfiability representation(SRBFNN-2SAT).The SRBFNN’s objective function that corresponds to Satisfiability logic programming can be minimized by different algorithms,including Genetic Algorithm(GA),Evolution Strategy Algorithm(ES),Differential Evolution Algorithm(DE),and Evolutionary Programming Algorithm(EP).Each of these methods is presented in the steps in the flowchart form which can be used for its straightforward implementation in any programming language.With the use of SRBFNN-2SAT,a training method based on these algorithms has been presented,then training has been compared among algorithms,which were applied in Microsoft Visual C++software using multiple metrics of performance,including Mean Absolute Relative Error(MARE),Root Mean Square Error(RMSE),Mean Absolute Percentage Error(MAPE),Mean Bias Error(MBE),Systematic Error(SD),Schwarz Bayesian Criterion(SBC),and Central Process Unit time(CPU time).Based on the results,the EP algorithm achieved a higher training rate and simple structure compared with the rest of the algorithms.It has been confirmed that the EP algorithm is quite effective in training and obtaining the best output weight,accompanied by the slightest iteration error,which minimizes the objective function of SRBFNN-2SAT.展开更多
In this paper, an improved Differential Evolution (DE) that incorporates double wavelet-based operations is proposed to solve the Economic Load Dispatch (ELD) problem. The double wavelet mutations are applied in order...In this paper, an improved Differential Evolution (DE) that incorporates double wavelet-based operations is proposed to solve the Economic Load Dispatch (ELD) problem. The double wavelet mutations are applied in order to enhance DE in exploring the solution space more effectively for better solution quality and stability. The first stage of wavelet operation is embedded in the DE mutation operation, in which the scaling factor is governed by a wavelet function. In the second stage, a wavelet-based mutation operation is embedded in the DE crossover operation. The trial population vectors are modified by the wavelet function. A suite of benchmark test functions is employed to evaluate the performance of the proposed DE in different problems. The result shows empirically that the proposed method out-performs signifycantly the conventional methods in terms of convergence speed, solution quality and solution stability. Then the proposed method is applied to the Economic Load Dispatch with Valve-Point Loading (ELD-VPL) problem, which is a process to share the power demand among the online generators in a power system for minimum fuel cost. Two different conditions of the ELD problem have been tested in this paper. It is observed that the proposed method gives satisfactory optimal costs when compared with the other techniques in the literature.展开更多
The Differential Evolution (DE) algorithm is arguably one of the most powerful stochastic optimization algorithms, which has been widely applied in various fields. Global numerical optimization is a very important and...The Differential Evolution (DE) algorithm is arguably one of the most powerful stochastic optimization algorithms, which has been widely applied in various fields. Global numerical optimization is a very important and extremely dif-ficult task in optimization domain, and it is also a great need for many practical applications. This paper proposes an opposition-based DE algorithm for global numerical optimization, which is called GNO2DE. In GNO2DE, firstly, the opposite point method is employed to utilize the existing search space to improve the convergence speed. Secondly, two candidate DE strategies “DE/rand/1/bin” and “DE/current to best/2/bin” are randomly chosen to make the most of their respective advantages to enhance the search ability. In order to reduce the number of control parameters, this algorithm uses an adaptive crossover rate dynamically tuned during the evolutionary process. Finally, it is validated on a set of benchmark test functions for global numerical optimization. Compared with several existing algorithms, the performance of GNO2DE is superior to or not worse than that of these algorithms in terms of final accuracy, convergence speed, and robustness. In addition, we also especially compare the opposition-based DE algorithm with the DE algorithm without using the opposite point method, and the DE algorithm using “DE/rand/1/bin” or “DE/current to best/2/bin”, respectively.展开更多
Gene regulatory network inference helps understand the regulatory mechanism among genes, predict the functions of unknown genes, comprehend the pathogenesis of disease and speed up drug development. In this paper, a H...Gene regulatory network inference helps understand the regulatory mechanism among genes, predict the functions of unknown genes, comprehend the pathogenesis of disease and speed up drug development. In this paper, a Hill function-based ordinary differential equation (ODE) model is proposed to infer gene regulatory network (GRN). A hybrid evolutionary algorithm based on binary grey wolf optimization (BGWO) and grey wolf optimization (GWO) is proposed to identify the structure and parameters of the Hill function-based model. In order to restrict the search space and eliminate the redundant regulatory relationships, L1 regularizer was added to the fitness function. SOS repair network was used to test the proposed method. The experimental results show that this method can infer gene regulatory network more accurately than state of the art methods.展开更多
The current Whale Optimization Algorithm(WOA)has several drawbacks,such as slow convergence,low solution accuracy and easy to fall into the local optimal solution.To overcome these drawbacks,an improved Whale Optimiza...The current Whale Optimization Algorithm(WOA)has several drawbacks,such as slow convergence,low solution accuracy and easy to fall into the local optimal solution.To overcome these drawbacks,an improved Whale Optimization Algorithm(IWOA)is proposed in this study.IWOA can enhance the global search capability by two measures.First,the crossover and mutation operations in Differential Evolutionary algorithm(DE)are combined with the whale optimization algorithm.Second,the cloud adaptive inertia weight is introduced in the position update phase of WOA to divide the population into two subgroups,so as to balance the global search ability and local development ability.ANSYS and Matlab are used to establish the structure model.To demonstrate the application of the IWOA,truss structural optimizations on 52-bar plane truss and 25-bar space truss were performed,and the results were are compared with that obtained by other optimization algorithm.It is verified that,compared with WOA,the IWOA has higher efficiency,fast convergence speed,better solution accuracy and stability.So IWOA can be used in the optimization design of large truss structures.展开更多
基金supported by the National Key R&D Program of the MOST of China(No.2016YFA0300204)the National Natural Science Foundation of China(Nos.11227902)as part of the Si PáME2beamline project+1 种基金supported by the National Natural Science Foundation of China(No.41774120)the Sichuan Science and Technology Program(No.2021YJ0329)。
文摘A self-adaptive differential evolution neutron spectrum unfolding algorithm(SDENUA)is established in this study to unfold the neutron spectra obtained from a water-pumping-injection multilayered concentric sphere neutron spectrometer(WMNS).Specifically,the neutron fluence bounds are estimated to accelerate the algorithm convergence,and the minimum error between the optimal solution and input neutron counts with relative uncertainties is limited to 10^(-6)to avoid unnecessary calculations.Furthermore,the crossover probability and scaling factor are self-adaptively controlled.FLUKA Monte Carlo is used to simulate the readings of the WMNS under(1)a spectrum of Cf-252 and(2)its spectrum after being moderated,(3)a spectrum used for boron neutron capture therapy,and(4)a reactor spectrum.Subsequently,the measured neutron counts are unfolded using the SDENUA.The uncertainties of the measured neutron count and the response matrix are considered in the SDENUA,which does not require complex parameter tuning or an a priori default spectrum.The results indicate that the solutions of the SDENUA agree better with the IAEA spectra than those of MAXED and GRAVEL in UMG 3.1,and the errors of the final results calculated using the SDENUA are less than 12%.The established SDENUA can be used to unfold spectra from the WMNS.
文摘In the fed-batch cultivation of Saccharomyces cerevisiae,excessive glucose addition leads to increased ethanol accumulation,which will reduce the efficiency of glucose utilization and inhibit product synthesis.Insufficient glucose addition limits cell growth.To properly regulate glucose feed,a different evolution algorithm based on self-adaptive control strategy was proposed,consisting of three modules(PID,system identification and parameter optimization).Performance of the proposed and conventional PID controllers was validated and compared in simulated and experimental cultivations.In the simulation,cultivation with the self-adaptive control strategy had a more stable glucose feed rate and concentration,more stable ethanol concentration around the set-point(1.0 g·L^(-1)),and final biomass concentration of 34.5 g-DCW·L^(-1),29.2%higher than that with a conventional PID control strategy.In the experiment,the cultivation with the self-adaptive control strategy also had more stable glucose and ethanol concentrations,as well as a final biomass concentration that was 37.4%higher than that using the conventional strategy.
基金supported by the Aviation Science Funds of China(2010ZC13012)the Fund of Jiangsu Innovation Program for Graduate Education (CXLX11 0203)
文摘There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm （ESEA） to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.
文摘In this paper, the authors show that the general linear second order ordinary Differential Equation can be formulated as an optimization problem and that evolutionary algorithms for solving optimization problems can also be adapted for solving the formulated problem. The authors propose a polynomial based scheme for achieving the above objectives. The coefficients of the proposed scheme are approximated by an evolutionary algorithm known as Differential Evolution (DE). Numerical examples with good results show the accuracy of the proposed method compared with some existing methods.
文摘In this paper, a new hybrid algorithm based on exploration power of a new improvement self-adaptive strategy for controlling parameters in DE （differential evolution） algorithm and exploitation capability of Nelder-Mead simplex method is presented （HISADE-NMS）. The DE has been used in many practical cases and has demonstrated good convergence properties. It has only a few control parameters as number of particles （NP）, scaling factor （F） and crossover control （CR）, which are kept fixed throughout the entire evolutionary process. However, these control parameters are very sensitive to the setting of the control parameters based on their experiments. The value of control parameters depends on the characteristics of each objective function, therefore, we have to tune their value in each problem that mean it will take too long time to perform. In the new manner, we present a new version of the DE algorithm for obtaining self-adaptive control parameter settings. Some modifications are imposed on DE to improve its capability and efficiency while being hybridized with Nelder-Mead simplex method. To valid the robustness of new hybrid algorithm, we apply it to solve some examples of structural optimization constraints.
文摘Robust and efficient AUV path planning is a key element for persistence AUV maneuvering in variable underwater environments. To develop such a path planning system, in this study, differential evolution(DE) algorithm is employed. The performance of the DE-based planner in generating time-efficient paths to direct the AUV from its initial conditions to the target of interest is investigated within a complexed 3D underwater environment incorporated with turbulent current vector fields, coastal area,islands, and static/dynamic obstacles. The results of simulations indicate the inherent efficiency of the DE-based path planner as it is capable of extracting feasible areas of a real map to determine the allowed spaces for the vehicle deployment while coping undesired current disturbances, exploiting desirable currents, and avoiding collision boundaries in directing the vehicle to its destination. The results are implementable for a realistic scenario and on-board real AUV as the DE planner satisfies all vehicular and environmental constraints while minimizing the travel time/distance, in a computationally efficient manner.
基金Project(2013CB733600) supported by the National Basic Research Program of ChinaProject(21176073) supported by the National Natural Science Foundation of China+2 种基金Project(20090074110005) supported by Doctoral Fund of Ministry of Education of ChinaProject(NCET-09-0346) supported by Program for New Century Excellent Talents in University of ChinaProject(09SG29) supported by "Shu Guang", China
文摘To solve dynamic optimization problem of chemical process (CPDOP), a hybrid differential evolution algorithm, which is integrated with Alopex and named as Alopex-DE, was proposed. In Alopex-DE, each original individual has its own symbiotic individual, which consists of control parameters. Differential evolution operator is applied for the original individuals to search the global optimization solution. Alopex algorithm is used to co-evolve the symbiotic individuals during the original individual evolution and enhance the fitness of the original individuals. Thus, control parameters are self-adaptively adjusted by Alopex to obtain the real-time optimum values for the original population. To illustrate the whole performance of Alopex-DE, several varietal DEs were applied to optimize 13 benchmark functions. The results show that the whole performance of Alopex-DE is the best. Further, Alopex-DE was applied to solve 4 typical CPDOPs, and the effect of the discrete time degree on the optimization solution was analyzed. The satisfactory result is obtained.
基金Supported by the National Natural Science Foundation of China(61070008)the Humanities and Social Science Youth Fund of the Ministry of Education(11YJC870012)+2 种基金the Youth Fund of Jiangxi Province Department of Education(GJJ11106)the Natural Science Foundation of Colleges and Universities of Anhui Province Department of Education(KJ2010B096)the Industrial Research Projects of Nanchang Scienceand Technology Bureau,Jiangxi(07110076)
文摘The performance of network equipments, such as firewall, router, etc., is decided by the efficiency of patch matching. It is difficult to adapt the speed of packet matching with packets linear forwarding by traditional algorithms. The purpose of this paper is to develop a novel algorithm of packet matching based on improving differential evolutionary algorithm, which also combines with classic packets matching algorithms to improve the performance of algorithm. For the sake of objectivity, the statistics method was used to compute the fitting value. Experiments showed that this new algorithm effectively improved the performance in the speed and storage space, as compared with the traditional one. For the first time, evolutionary algorithm is used to solve the network data packet forwarding, and packets can be forwarded at the linear speed. In addition, this new algorithm is universal, so it can be adapted for many equipment.
文摘Differential evolution (DE) algorithm has been shown to be a simple and efficient evolutionary algorithm for global optimization over continuous spaces, and has been widely used in both benchmark test functions and real-world applications. This paper introduces a novel mutation operator, without using the scaling factor F, a conventional control parameter, and this mutation can generate multiple trial vectors by incorporating different weighted values at each generation, which can make the best of the selected multiple parents to improve the probability of generating a better offspring. In addition, in order to enhance the capacity of adaptation, a new and adaptive control parameter, i.e. the crossover rate CR, is presented and when one variable is beyond its boundary, a repair rule is also applied in this paper. The proposed algorithm ADE is validated on several constrained engineering design optimization problems reported in the specialized literature. Compared with respect to algorithms representative of the state-of-the-art in the area, the experimental results show that ADE can obtain good solutions on a test set of constrained optimization problems in engineering design.
基金the National Natural Science Foundation of China(No.70 0 710 42 and No.60 0 73 0 43 )
文摘We introduce a new parallel evolutionary algorithm in modeling dynamic systems by nonlinear higher-order ordinary differential equations (NHODEs). The NHODEs models are much more universal than the traditional linear models. In order to accelerate the modeling process, we propose and realize a parallel evolutionary algorithm using distributed CORBA object on the heterogeneous networking. Some numerical experiments show that the new algorithm is feasible and efficient.
基金National Key Basic Research Project of China(973 program)(No.2013CB733600)National Natural Science Foundation of China(No.21176073)+1 种基金Program for New Century Excellent Talents in University,China(No.NCET-09-0346)the Fundamental Research Funds for the Central Universities,China
文摘To implement self-adaptive control parameters, a hybrid differential evolution algorithm integrated with particle swarm optimization （PSODE） is proposed. In the PSODE, control parameters are encoded to be a symbiotic individual of original individual, and each original individual has its own symbiotic individual. Differential evolution （ DE） operators are used to evolve the original population. And, particle swarm optimization （PSO） is applied to co-evolving the symbiotic population. Thus, with the evolution of the original population in PSODE, the symbiotic population is dynamically and self-adaptively adjusted and the realtime optimum control parameters are obtained. The proposed algorithm is compared with some DE variants on nine functious. The results show that the average performance of PSODE is the best.
文摘Differential evolution algorithm based on the covariance matrix learning can adjust the coordinate system according to the characteristics of the population, which make<span style="font-family:Verdana;">s</span><span style="font-family:Verdana;"> the search move in a more favorable direction. In order to obtain more accurate information about the function shape, this paper propose</span><span style="font-family:Verdana;">s</span><span style="font-family:;" "=""> <span style="font-family:Verdana;">covariance</span><span style="font-family:Verdana;"> matrix learning differential evolution algorithm based on correlation (denoted as RCLDE)</span></span><span style="font-family:;" "=""> </span><span style="font-family:Verdana;">to improve the search efficiency of the algorithm. First, a hybrid mutation strategy is designed to balance the diversity and convergence of the population;secondly, the covariance learning matrix is constructed by selecting the individual with the less correlation;then, a comprehensive learning mechanism is comprehensively designed by two covariance matrix learning mechanisms based on the principle of probability. Finally,</span><span style="font-family:;" "=""> </span><span style="font-family:;" "=""><span style="font-family:Verdana;">the algorithm is tested on the CEC2005, and the experimental results are compared with other effective differential evolution algorithms. The experimental results show that the algorithm proposed in this paper is </span><span style="font-family:Verdana;">an effective algorithm</span><span style="font-family:Verdana;">.</span></span>
基金Project(2011FJ3016)supported by the Research Foundation of Science & Technology Office of Hunan Province,China
文摘A novel and simple technique to control the search direction of the differential mutation was proposed.In order to verify the performance of this method,ten widely used benchmark functions were chosen and the results were compared with the original differential evolution(DE)algorithm.Experimental results indicate that the search direction controlled DE algorithm obtains better results than the original DE algorithm in term of the solution quality and convergence rate.
基金This work was supported by National Natural Science Foundation of China(Nos.61271153 and 61372039).
文摘Since traditional fault tolerance methods of electronic systems are based on redundant fault tolerance technique,and their structures are fixed when circuits are designed,the self-adaptive ability is limited.In order to solve these problems,a novel circuit self-adaptive design technique based on evolvable hardware(EHW)is proposed.It features robustness,self-organization and self-adaption.It can be adapted to a complex environment through dynamic configuration of the circuit.In this paper,the proposed technique simulated.The consumption of hardware resources and the number of convergence iterations researched.The effectiveness and superiority of the proposed technique are verified.The designed circuit has the ability of resistible redundant-state interference(RRSI).The proposed technique has a broad application prospect,and it has great significance.
基金This work is supported by Ministry of Higher Education(MOHE)through Fundamental Research Grant Scheme(FRGS)(FRGS/1/2020/STG06/UTHM/03/7).
文摘Radial Basis Function Neural Network(RBFNN)ensembles have long suffered from non-efficient training,where incorrect parameter settings can be computationally disastrous.This paper examines different evolutionary algorithms for training the Symbolic Radial Basis Function Neural Network(SRBFNN)through the behavior’s integration of satisfiability programming.Inspired by evolutionary algorithms,which can iteratively find the nearoptimal solution,different Evolutionary Algorithms(EAs)were designed to optimize the producer output weight of the SRBFNN that corresponds to the embedded logic programming 2Satisfiability representation(SRBFNN-2SAT).The SRBFNN’s objective function that corresponds to Satisfiability logic programming can be minimized by different algorithms,including Genetic Algorithm(GA),Evolution Strategy Algorithm(ES),Differential Evolution Algorithm(DE),and Evolutionary Programming Algorithm(EP).Each of these methods is presented in the steps in the flowchart form which can be used for its straightforward implementation in any programming language.With the use of SRBFNN-2SAT,a training method based on these algorithms has been presented,then training has been compared among algorithms,which were applied in Microsoft Visual C++software using multiple metrics of performance,including Mean Absolute Relative Error(MARE),Root Mean Square Error(RMSE),Mean Absolute Percentage Error(MAPE),Mean Bias Error(MBE),Systematic Error(SD),Schwarz Bayesian Criterion(SBC),and Central Process Unit time(CPU time).Based on the results,the EP algorithm achieved a higher training rate and simple structure compared with the rest of the algorithms.It has been confirmed that the EP algorithm is quite effective in training and obtaining the best output weight,accompanied by the slightest iteration error,which minimizes the objective function of SRBFNN-2SAT.
文摘In this paper, an improved Differential Evolution (DE) that incorporates double wavelet-based operations is proposed to solve the Economic Load Dispatch (ELD) problem. The double wavelet mutations are applied in order to enhance DE in exploring the solution space more effectively for better solution quality and stability. The first stage of wavelet operation is embedded in the DE mutation operation, in which the scaling factor is governed by a wavelet function. In the second stage, a wavelet-based mutation operation is embedded in the DE crossover operation. The trial population vectors are modified by the wavelet function. A suite of benchmark test functions is employed to evaluate the performance of the proposed DE in different problems. The result shows empirically that the proposed method out-performs signifycantly the conventional methods in terms of convergence speed, solution quality and solution stability. Then the proposed method is applied to the Economic Load Dispatch with Valve-Point Loading (ELD-VPL) problem, which is a process to share the power demand among the online generators in a power system for minimum fuel cost. Two different conditions of the ELD problem have been tested in this paper. It is observed that the proposed method gives satisfactory optimal costs when compared with the other techniques in the literature.
文摘The Differential Evolution (DE) algorithm is arguably one of the most powerful stochastic optimization algorithms, which has been widely applied in various fields. Global numerical optimization is a very important and extremely dif-ficult task in optimization domain, and it is also a great need for many practical applications. This paper proposes an opposition-based DE algorithm for global numerical optimization, which is called GNO2DE. In GNO2DE, firstly, the opposite point method is employed to utilize the existing search space to improve the convergence speed. Secondly, two candidate DE strategies “DE/rand/1/bin” and “DE/current to best/2/bin” are randomly chosen to make the most of their respective advantages to enhance the search ability. In order to reduce the number of control parameters, this algorithm uses an adaptive crossover rate dynamically tuned during the evolutionary process. Finally, it is validated on a set of benchmark test functions for global numerical optimization. Compared with several existing algorithms, the performance of GNO2DE is superior to or not worse than that of these algorithms in terms of final accuracy, convergence speed, and robustness. In addition, we also especially compare the opposition-based DE algorithm with the DE algorithm without using the opposite point method, and the DE algorithm using “DE/rand/1/bin” or “DE/current to best/2/bin”, respectively.
文摘Gene regulatory network inference helps understand the regulatory mechanism among genes, predict the functions of unknown genes, comprehend the pathogenesis of disease and speed up drug development. In this paper, a Hill function-based ordinary differential equation (ODE) model is proposed to infer gene regulatory network (GRN). A hybrid evolutionary algorithm based on binary grey wolf optimization (BGWO) and grey wolf optimization (GWO) is proposed to identify the structure and parameters of the Hill function-based model. In order to restrict the search space and eliminate the redundant regulatory relationships, L1 regularizer was added to the fitness function. SOS repair network was used to test the proposed method. The experimental results show that this method can infer gene regulatory network more accurately than state of the art methods.
基金This work was supported by the National Natural Science Foundation of China(Grant No.11872157 and 11532013)the graduate innovative research project of Heilongjiang University of Science and Technology(Grant No.YJSCX2020-214HKD).
文摘The current Whale Optimization Algorithm(WOA)has several drawbacks,such as slow convergence,low solution accuracy and easy to fall into the local optimal solution.To overcome these drawbacks,an improved Whale Optimization Algorithm(IWOA)is proposed in this study.IWOA can enhance the global search capability by two measures.First,the crossover and mutation operations in Differential Evolutionary algorithm(DE)are combined with the whale optimization algorithm.Second,the cloud adaptive inertia weight is introduced in the position update phase of WOA to divide the population into two subgroups,so as to balance the global search ability and local development ability.ANSYS and Matlab are used to establish the structure model.To demonstrate the application of the IWOA,truss structural optimizations on 52-bar plane truss and 25-bar space truss were performed,and the results were are compared with that obtained by other optimization algorithm.It is verified that,compared with WOA,the IWOA has higher efficiency,fast convergence speed,better solution accuracy and stability.So IWOA can be used in the optimization design of large truss structures.
