Adaptive Cross-Generation Differential Evolution(ACGDE)is a recently-introduced algorithm for solving multiobjective problems with remarkable performance compared to other evolutionary algorithms(EAs).However,its conv...Adaptive Cross-Generation Differential Evolution(ACGDE)is a recently-introduced algorithm for solving multiobjective problems with remarkable performance compared to other evolutionary algorithms(EAs).However,its convergence and diversity are not satisfactory compared with the latest algorithms.In order to adapt to the current environment,ACGDE requires improvements in many aspects,such as its initialization and mutant operator.In this paper,an enhanced version is proposed,namely SIACGDE.It incorporates a strengthened initialization strategy and optimized parameters in contrast to its predecessor.These improvements make the direction of crossgeneration mutation more clearly and the ability of searching more efficiently.The experiments show that the new algorithm has better diversity and improves convergence to a certain extent.At the same time,SIACGDE outperforms other state-of-the-art algorithms on four metrics of 24 test problems.展开更多
One of the important geotechnical parameters required for designing of the civil engineering structure is the compressibility of the soil.In this study,the main purpose is to develop a novel hybrid Machine Learning(ML...One of the important geotechnical parameters required for designing of the civil engineering structure is the compressibility of the soil.In this study,the main purpose is to develop a novel hybrid Machine Learning(ML)model(ANFIS-DE),which used Differential Evolution(DE)algorithm to optimize the predictive capability of Adaptive-Network-based Fuzzy Inference System(ANFIS),for estimating soil Compression coefficient(Cc)from other geotechnical parameters namelyWater Content,Void Ratio,SpecificGravity,Liquid Limit,Plastic Limit,Clay content and Depth of Soil Samples.Validation of the predictive capability of the novel model was carried out using statistical indices:Root Mean Square Error(RMSE),Mean Absolute Error(MAE),and Correlation Coefficient(R).In addition,two popular ML models namely Reduced Error Pruning Trees(REPTree)and Decision Stump(Dstump)were used for comparison.Results showed that the performance of the novel model ANFIS-DE is the best(R=0.825,MAE=0.064 and RMSE=0.094)in comparison to other models such as REPTree(R=0.7802,MAE=0.068 and RMSE=0.0988)andDstump(R=0.7325,MAE=0.0785 and RMSE=0.1036).Therefore,the ANFIS-DE model can be used as a promising tool for the correct and quick estimation of the soil Cc,which can be employed in the design and construction of civil engineering structures.展开更多
Design constraints verification is the most computationally expensive task in evolutionary structural optimization due to a large number of structural analyses thatmust be conducted.Building a surrogatemodel to approx...Design constraints verification is the most computationally expensive task in evolutionary structural optimization due to a large number of structural analyses thatmust be conducted.Building a surrogatemodel to approximate the behavior of structures instead of the exact structural analyses is a possible solution to tackle this problem.However,most existing surrogate models have been designed based on regression techniques.This paper proposes a novel method,called CaDE,which adopts a machine learning classification technique for enhancing the performance of the Differential Evolution(DE)optimization.The proposed method is separated into two stages.During the first optimization stage,the original DE is implemented as usual,but all individuals produced in this phase are stored as inputs of the training data.Based on design constraints verification,these individuals are labeled as“safe”or“unsafe”and their labels are saved as outputs of the training data.When collecting enough data,an AdaBoost model is trained to evaluate the safety state of structures.This model is then used in the second stage to preliminarily assess new individuals,and unpromising ones are rejected without checking design constraints.This method reduces unnecessary structural analyses,thereby shortens the optimization process.Five benchmark truss sizing optimization problems are solved using the proposed method to demonstrate its effectiveness.The obtained results show that the CaDE finds good optimal designs with less structural analyses in comparison with the original DE and four other DE variants.The reduction rate of five examples ranges from 18 to over 50%.Moreover,the proposed method is applied to a real-size transmission tower design problem to exhibit its applicability in practice.展开更多
This brief paper reports a hybrid algorithm we developed recently to solve the global optimization problems of multimodal functions, by combining the advantages of two powerful population-based metaheuristics differen...This brief paper reports a hybrid algorithm we developed recently to solve the global optimization problems of multimodal functions, by combining the advantages of two powerful population-based metaheuristics differential evolution (DE) and particle swarm optimization (PSO). In the hybrid denoted by DEPSO, each individual in one generation chooses its evolution method, DE or PSO, in a statistical learning way. The choice depends on the relative success ratio of the two methods in a previous learning period. The proposed DEPSO is compared with its PSO and DE parents, two advanced DE variants one of which is suggested by the originators of DE, two advanced PSO variants one of which is acknowledged as a recent standard by PSO community, and also a previous DEPSO. Benchmark tests demonstrate that the DEPSO is more competent for the global optimization of multimodal functions due to its high optimization quality.展开更多
Learning control has been recognized as a powerful approach in quantum information technology. In this paper, we extend the application of differential evolution (DE) to design optimal control for various quantum sy...Learning control has been recognized as a powerful approach in quantum information technology. In this paper, we extend the application of differential evolution (DE) to design optimal control for various quantum systems. Various DE methods are introduced and analyzed, and EMSDE featuring in equally mixed strategies is employed for quantum control. Two classes of quantum control problems, including control of four-level open quantum ensembles and quantum superconducting systems, are investigated to demonstrate the performance of EMSDE for learning control of quantum systems. Numerical results verify the effectiveness of the FMSDE method for various quantum systems and show the potential for complex quantum control problems.展开更多
Nonlinear equations systems(NESs)arise in a wide range of domains.Solving NESs requires the algorithm to locate multiple roots simultaneously.To deal with NESs efficiently,this study presents an enhanced reinforcement...Nonlinear equations systems(NESs)arise in a wide range of domains.Solving NESs requires the algorithm to locate multiple roots simultaneously.To deal with NESs efficiently,this study presents an enhanced reinforcement learning based differential evolution with the following major characteristics:(1)the design of state function uses the information on the fitness alternation action;(2)different neighborhood sizes and mutation strategies are combined as optional actions;and(3)the unbalanced assignment method is adopted to change the reward value to select the optimal actions.To evaluate the performance of our approach,30 NESs test problems and 18 test instances with different features are selected as the test suite.The experimental results indicate that the proposed approach can improve the performance in solving NESs,and outperform several state-of-the-art methods.展开更多
To address complex single objective global optimization problems,a new Level-Based Learning Differential Evolution(LBLDE)is developed in this study.In this approach,the whole population is sorted from the best to the ...To address complex single objective global optimization problems,a new Level-Based Learning Differential Evolution(LBLDE)is developed in this study.In this approach,the whole population is sorted from the best to the worst at the beginning of each generation.Then,the population is partitioned into multiple levels,and different levels are used to exert different functions.In each level,a control parameter is used to select excellent exemplars from upper levels for learning.In this case,the poorer individuals can choose more learning exemplars to improve their exploration ability,and excellent individuals can directly learn from the several best individuals to improve the quality of solutions.To accelerate the convergence speed,a difference vector selection method based on the level is developed.Furthermore,specific crossover rates are assigned to individuals at the lowest level to guarantee that the population can continue to update during the later evolutionary process.A comprehensive experiment is organized and conducted to obtain a deep insight into LBLDE and demonstrates the superiority of LBLDE in comparison with seven peer DE variants.展开更多
The Differential Evolution(DE)algorithm,which is an efficient optimization algorithm,has been used to solve various optimization problems.In this paper,adaptive dimensional learning with a tolerance framework for DE i...The Differential Evolution(DE)algorithm,which is an efficient optimization algorithm,has been used to solve various optimization problems.In this paper,adaptive dimensional learning with a tolerance framework for DE is proposed.The population is divided into an elite subpopulation,an ordinary subpopulation,and an inferior subpopulation according to the fitness values.The ordinary and elite subpopulations are used to maintain the current evolution state and to guide the evolution direction of the population,respectively.The inferior subpopulation learns from the elite subpopulation through the dimensional learning strategy.If the global optimum is not improved in a specified number of iterations,a tolerance mechanism is applied.Under the tolerance mechanism,the inferior and elite subpopulations implement the restart strategy and the reverse dimensional learning strategy,respectively.In addition,the individual status and algorithm status are used to adaptively adjust the control parameters.To evaluate the performance of the proposed algorithm,six state-of-the-art DE algorithm variants are compared on the benchmark functions.The results of the simulation show that the proposed algorithm outperforms other variant algorithms regarding function convergence rate and solution accuracy.展开更多
This paper presents opposition-based differential evolution to determine the optimal hourly schedule of power generation in a hydrothermal system.Differential evolution(DE)is a population-based stochastic parallel sea...This paper presents opposition-based differential evolution to determine the optimal hourly schedule of power generation in a hydrothermal system.Differential evolution(DE)is a population-based stochastic parallel search evolutionary algorithm.Opposition-based differential evolution has been used here to improve the effectiveness and quality of the solution.The proposed opposition-based differential evolution(ODE)employs opposition-based learning(OBL)for population initialization and also for generation jumping.The effectiveness of the proposed method has been verified on two test problems,two fixed head hydrothermal test systems and three hydrothermal multi-reservoir cascaded hydroelectric test systems having prohibited operating zones and thermal units with valve point loading.The results of the proposed approach are compared with those obtained by other evolutionary methods.It is found that the proposed opposition-based differential evolution based approach is able to provide better solution.展开更多
Extensive studies on selecting recombination operators adaptively,namely,adaptive operator selection(AOS),during the search process of an evolutionary algorithm(EA),have shown that AOS is promising for improving EA...Extensive studies on selecting recombination operators adaptively,namely,adaptive operator selection(AOS),during the search process of an evolutionary algorithm(EA),have shown that AOS is promising for improving EA's performance.A variety of heuristic mechanisms for AOS have been proposed in recent decades,which usually contain two main components:the feature extraction and the policy setting.The feature extraction refers to as extracting relevant features from the information collected during the search process.The policy setting means to set a strategy(or policy)on how to select an operator from a pool of operators based on the extracted feature.Both components are designed by hand in existing studies,which may not be efficient for adapting optimization problems.In this paper,a generalized framework is proposed for learning the components of AOS for one of the main streams of EAs,namely,differential evolution(DE).In the framework,the feature extraction is parameterized as a deep neural network(DNN),while a Dirichlet distribution is considered to be the policy.A reinforcement learning method,named policy gradient,is used to train the DNN.As case studies,the proposed framework is applied to two DEs including the classic DE and a recently-proposed DE,which result in two new algorithms named PG-DE and PG-MPEDE,respectively.Experiments on the Congress of Evolutionary Computation(CEC)2018 test suite show that the proposed new algorithms perform significantly better than their counterparts.Finally,we prove theoretically that the considered classic methods are the special cases of the proposed framework.展开更多
文摘Adaptive Cross-Generation Differential Evolution(ACGDE)is a recently-introduced algorithm for solving multiobjective problems with remarkable performance compared to other evolutionary algorithms(EAs).However,its convergence and diversity are not satisfactory compared with the latest algorithms.In order to adapt to the current environment,ACGDE requires improvements in many aspects,such as its initialization and mutant operator.In this paper,an enhanced version is proposed,namely SIACGDE.It incorporates a strengthened initialization strategy and optimized parameters in contrast to its predecessor.These improvements make the direction of crossgeneration mutation more clearly and the ability of searching more efficiently.The experiments show that the new algorithm has better diversity and improves convergence to a certain extent.At the same time,SIACGDE outperforms other state-of-the-art algorithms on four metrics of 24 test problems.
基金Ministry of Education and Training of Vietnam,Grant No.B2020-GHA-03the University of Transport and Communications,Hanoi,Vietnam.
文摘One of the important geotechnical parameters required for designing of the civil engineering structure is the compressibility of the soil.In this study,the main purpose is to develop a novel hybrid Machine Learning(ML)model(ANFIS-DE),which used Differential Evolution(DE)algorithm to optimize the predictive capability of Adaptive-Network-based Fuzzy Inference System(ANFIS),for estimating soil Compression coefficient(Cc)from other geotechnical parameters namelyWater Content,Void Ratio,SpecificGravity,Liquid Limit,Plastic Limit,Clay content and Depth of Soil Samples.Validation of the predictive capability of the novel model was carried out using statistical indices:Root Mean Square Error(RMSE),Mean Absolute Error(MAE),and Correlation Coefficient(R).In addition,two popular ML models namely Reduced Error Pruning Trees(REPTree)and Decision Stump(Dstump)were used for comparison.Results showed that the performance of the novel model ANFIS-DE is the best(R=0.825,MAE=0.064 and RMSE=0.094)in comparison to other models such as REPTree(R=0.7802,MAE=0.068 and RMSE=0.0988)andDstump(R=0.7325,MAE=0.0785 and RMSE=0.1036).Therefore,the ANFIS-DE model can be used as a promising tool for the correct and quick estimation of the soil Cc,which can be employed in the design and construction of civil engineering structures.
基金funded by Hanoi University of Civil Engineering(HUCE)in Project Code 35-2021/KHXD-TD.
文摘Design constraints verification is the most computationally expensive task in evolutionary structural optimization due to a large number of structural analyses thatmust be conducted.Building a surrogatemodel to approximate the behavior of structures instead of the exact structural analyses is a possible solution to tackle this problem.However,most existing surrogate models have been designed based on regression techniques.This paper proposes a novel method,called CaDE,which adopts a machine learning classification technique for enhancing the performance of the Differential Evolution(DE)optimization.The proposed method is separated into two stages.During the first optimization stage,the original DE is implemented as usual,but all individuals produced in this phase are stored as inputs of the training data.Based on design constraints verification,these individuals are labeled as“safe”or“unsafe”and their labels are saved as outputs of the training data.When collecting enough data,an AdaBoost model is trained to evaluate the safety state of structures.This model is then used in the second stage to preliminarily assess new individuals,and unpromising ones are rejected without checking design constraints.This method reduces unnecessary structural analyses,thereby shortens the optimization process.Five benchmark truss sizing optimization problems are solved using the proposed method to demonstrate its effectiveness.The obtained results show that the CaDE finds good optimal designs with less structural analyses in comparison with the original DE and four other DE variants.The reduction rate of five examples ranges from 18 to over 50%.Moreover,the proposed method is applied to a real-size transmission tower design problem to exhibit its applicability in practice.
基金Supported by the National Natural Science Foundation of China (Grant No. 60374069)the Foundation of the Key Laboratory of Complex Systems and Intelligent Science, Institute of Automation, Chinese Academy of Sciences (Grant No. 20060104)
文摘This brief paper reports a hybrid algorithm we developed recently to solve the global optimization problems of multimodal functions, by combining the advantages of two powerful population-based metaheuristics differential evolution (DE) and particle swarm optimization (PSO). In the hybrid denoted by DEPSO, each individual in one generation chooses its evolution method, DE or PSO, in a statistical learning way. The choice depends on the relative success ratio of the two methods in a previous learning period. The proposed DEPSO is compared with its PSO and DE parents, two advanced DE variants one of which is suggested by the originators of DE, two advanced PSO variants one of which is acknowledged as a recent standard by PSO community, and also a previous DEPSO. Benchmark tests demonstrate that the DEPSO is more competent for the global optimization of multimodal functions due to its high optimization quality.
基金This paper is dedicated to Professor lan R. Petersen on the occasion of his 60th birthday. This work was supported by the National Natural Science Foundation of China (Nos. 61374092, 61432008), the National Key Research and Development Program of China (No. 2016YFD0702100) and the Australian Research Council's Discovery Projects funding scheme under Project DP130101658.
文摘Learning control has been recognized as a powerful approach in quantum information technology. In this paper, we extend the application of differential evolution (DE) to design optimal control for various quantum systems. Various DE methods are introduced and analyzed, and EMSDE featuring in equally mixed strategies is employed for quantum control. Two classes of quantum control problems, including control of four-level open quantum ensembles and quantum superconducting systems, are investigated to demonstrate the performance of EMSDE for learning control of quantum systems. Numerical results verify the effectiveness of the FMSDE method for various quantum systems and show the potential for complex quantum control problems.
基金This work was partly supported by the Natural Science Foundation of Guangxi Province(No.2020JJA170038)Special Talent Project of Guangxi Science and Technology Base(No.GuiKe AD21220119)the High-Level Talents Research Project of Beibu Gulf(No.2020KYQD06)。
文摘Nonlinear equations systems(NESs)arise in a wide range of domains.Solving NESs requires the algorithm to locate multiple roots simultaneously.To deal with NESs efficiently,this study presents an enhanced reinforcement learning based differential evolution with the following major characteristics:(1)the design of state function uses the information on the fitness alternation action;(2)different neighborhood sizes and mutation strategies are combined as optional actions;and(3)the unbalanced assignment method is adopted to change the reward value to select the optimal actions.To evaluate the performance of our approach,30 NESs test problems and 18 test instances with different features are selected as the test suite.The experimental results indicate that the proposed approach can improve the performance in solving NESs,and outperform several state-of-the-art methods.
基金This work was supported in part by the National Natural Science Fund for Outstanding Young Scholars of China(No.61922072)the National Natural Science Foundation of China(Nos.61876169,61276238,61806179,and 61976237)Key Research and Development and Promotion Projects in Henan Province(No.192102210098).
文摘To address complex single objective global optimization problems,a new Level-Based Learning Differential Evolution(LBLDE)is developed in this study.In this approach,the whole population is sorted from the best to the worst at the beginning of each generation.Then,the population is partitioned into multiple levels,and different levels are used to exert different functions.In each level,a control parameter is used to select excellent exemplars from upper levels for learning.In this case,the poorer individuals can choose more learning exemplars to improve their exploration ability,and excellent individuals can directly learn from the several best individuals to improve the quality of solutions.To accelerate the convergence speed,a difference vector selection method based on the level is developed.Furthermore,specific crossover rates are assigned to individuals at the lowest level to guarantee that the population can continue to update during the later evolutionary process.A comprehensive experiment is organized and conducted to obtain a deep insight into LBLDE and demonstrates the superiority of LBLDE in comparison with seven peer DE variants.
基金This work was supported by the National Natural Science Foundation of China(Nos.61903089 and 62066019)the Natural Science Foundation of Jiangxi Province(Nos.20202BABL202020 and 20202BAB202014)the National Key Research and Development Program of China(No.2020YFB1713700).
文摘The Differential Evolution(DE)algorithm,which is an efficient optimization algorithm,has been used to solve various optimization problems.In this paper,adaptive dimensional learning with a tolerance framework for DE is proposed.The population is divided into an elite subpopulation,an ordinary subpopulation,and an inferior subpopulation according to the fitness values.The ordinary and elite subpopulations are used to maintain the current evolution state and to guide the evolution direction of the population,respectively.The inferior subpopulation learns from the elite subpopulation through the dimensional learning strategy.If the global optimum is not improved in a specified number of iterations,a tolerance mechanism is applied.Under the tolerance mechanism,the inferior and elite subpopulations implement the restart strategy and the reverse dimensional learning strategy,respectively.In addition,the individual status and algorithm status are used to adaptively adjust the control parameters.To evaluate the performance of the proposed algorithm,six state-of-the-art DE algorithm variants are compared on the benchmark functions.The results of the simulation show that the proposed algorithm outperforms other variant algorithms regarding function convergence rate and solution accuracy.
文摘This paper presents opposition-based differential evolution to determine the optimal hourly schedule of power generation in a hydrothermal system.Differential evolution(DE)is a population-based stochastic parallel search evolutionary algorithm.Opposition-based differential evolution has been used here to improve the effectiveness and quality of the solution.The proposed opposition-based differential evolution(ODE)employs opposition-based learning(OBL)for population initialization and also for generation jumping.The effectiveness of the proposed method has been verified on two test problems,two fixed head hydrothermal test systems and three hydrothermal multi-reservoir cascaded hydroelectric test systems having prohibited operating zones and thermal units with valve point loading.The results of the proposed approach are compared with those obtained by other evolutionary methods.It is found that the proposed opposition-based differential evolution based approach is able to provide better solution.
基金supported by National Natural Science Foundation of China(Grant No.62076197)Key Research and Development Project of Shaanxi Province(Grant No.2022GXLH-01-15)。
文摘Extensive studies on selecting recombination operators adaptively,namely,adaptive operator selection(AOS),during the search process of an evolutionary algorithm(EA),have shown that AOS is promising for improving EA's performance.A variety of heuristic mechanisms for AOS have been proposed in recent decades,which usually contain two main components:the feature extraction and the policy setting.The feature extraction refers to as extracting relevant features from the information collected during the search process.The policy setting means to set a strategy(or policy)on how to select an operator from a pool of operators based on the extracted feature.Both components are designed by hand in existing studies,which may not be efficient for adapting optimization problems.In this paper,a generalized framework is proposed for learning the components of AOS for one of the main streams of EAs,namely,differential evolution(DE).In the framework,the feature extraction is parameterized as a deep neural network(DNN),while a Dirichlet distribution is considered to be the policy.A reinforcement learning method,named policy gradient,is used to train the DNN.As case studies,the proposed framework is applied to two DEs including the classic DE and a recently-proposed DE,which result in two new algorithms named PG-DE and PG-MPEDE,respectively.Experiments on the Congress of Evolutionary Computation(CEC)2018 test suite show that the proposed new algorithms perform significantly better than their counterparts.Finally,we prove theoretically that the considered classic methods are the special cases of the proposed framework.