5G networks apply adaptive modulation and coding according to the channel condition reported by the user in order to keep the mobile communication quality.However,the delay incurred by the feedback may make the channe...5G networks apply adaptive modulation and coding according to the channel condition reported by the user in order to keep the mobile communication quality.However,the delay incurred by the feedback may make the channel quality indicator(CQI)obsolete.This paper addresses this issue by proposing two approaches,one based on machine learning and another on evolutionary computing,which considers the user context and signal-to-interference-plus-noise ratio(SINR)besides the delay length to estimate the updated SINR to be mapped into a CQI value.Our proposals are designed to run at the user equipment(UE)side,neither requiring any change in the signalling between the base station(gNB)and UE nor overloading the gNB.They are evaluated in terms of mean squared error by adopting 5G network simulation data and the results show their high accuracy and feasibility to be employed in 5G/6G systems.展开更多
Most of the neural network architectures are based on human experience,which requires a long and tedious trial-and-error process.Neural architecture search(NAS)attempts to detect effective architectures without human ...Most of the neural network architectures are based on human experience,which requires a long and tedious trial-and-error process.Neural architecture search(NAS)attempts to detect effective architectures without human intervention.Evolutionary algorithms(EAs)for NAS can find better solutions than human-designed architectures by exploring a large search space for possible architectures.Using multiobjective EAs for NAS,optimal neural architectures that meet various performance criteria can be explored and discovered efficiently.Furthermore,hardware-accelerated NAS methods can improve the efficiency of the NAS.While existing reviews have mainly focused on different strategies to complete NAS,a few studies have explored the use of EAs for NAS.In this paper,we summarize and explore the use of EAs for NAS,as well as large-scale multiobjective optimization strategies and hardware-accelerated NAS methods.NAS performs well in healthcare applications,such as medical image analysis,classification of disease diagnosis,and health monitoring.EAs for NAS can automate the search process and optimize multiple objectives simultaneously in a given healthcare task.Deep neural network has been successfully used in healthcare,but it lacks interpretability.Medical data is highly sensitive,and privacy leaks are frequently reported in the healthcare industry.To solve these problems,in healthcare,we propose an interpretable neuroevolution framework based on federated learning to address search efficiency and privacy protection.Moreover,we also point out future research directions for evolutionary NAS.Overall,for researchers who want to use EAs to optimize NNs in healthcare,we analyze the advantages and disadvantages of doing so to provide detailed guidance,and propose an interpretable privacy-preserving framework for healthcare applications.展开更多
Deep learning has emerged in many practical applications,such as image classification,fault diagnosis,and object detection.More recently,convolutional neural networks(CNNs),representative models of deep learning,have ...Deep learning has emerged in many practical applications,such as image classification,fault diagnosis,and object detection.More recently,convolutional neural networks(CNNs),representative models of deep learning,have been used to solve fault detection.However,the current design of CNNs for fault detection of wind turbine blades is highly dependent on domain knowledge and requires a large amount of trial and error.For this reason,an evolutionary YOLOv8 network has been developed to automatically find the network architecture for wind turbine blade-based fault detection.YOLOv8 is a CNN-backed object detection model.Specifically,to reduce the parameter count,we first design an improved FasterNet module based on the Partial Convolution(PConv)operator.Then,to enhance convergence performance,we improve the loss function based on the efficient complete intersection over the union.Based on this,a flexible variable-length encoding is proposed,and the corresponding reproduction operators are designed.Related experimental results confirmthat the proposed approach can achieve better fault detection results and improve by 2.6%in mean precision at 50(mAP50)compared to the existing methods.Additionally,compared to training with the YOLOv8n model,the YOLOBFE model reduces the training parameters by 933,937 and decreases the GFLOPS(Giga Floating Point Operations Per Second)by 1.1.展开更多
With the rapid advancements in technology and science,optimization theory and algorithms have become increasingly important.A wide range of real-world problems is classified as optimization challenges,and meta-heurist...With the rapid advancements in technology and science,optimization theory and algorithms have become increasingly important.A wide range of real-world problems is classified as optimization challenges,and meta-heuristic algorithms have shown remarkable effectiveness in solving these challenges across diverse domains,such as machine learning,process control,and engineering design,showcasing their capability to address complex optimization problems.The Stochastic Fractal Search(SFS)algorithm is one of the most popular meta-heuristic optimization methods inspired by the fractal growth patterns of natural materials.Since its introduction by Hamid Salimi in 2015,SFS has garnered significant attention from researchers and has been applied to diverse optimization problems acrossmultiple disciplines.Its popularity can be attributed to several factors,including its simplicity,practical computational efficiency,ease of implementation,rapid convergence,high effectiveness,and ability to address singleandmulti-objective optimization problems,often outperforming other established algorithms.This review paper offers a comprehensive and detailed analysis of the SFS algorithm,covering its standard version,modifications,hybridization,and multi-objective implementations.The paper also examines several SFS applications across diverse domains,including power and energy systems,image processing,machine learning,wireless sensor networks,environmental modeling,economics and finance,and numerous engineering challenges.Furthermore,the paper critically evaluates the SFS algorithm’s performance,benchmarking its effectiveness against recently published meta-heuristic algorithms.In conclusion,the review highlights key findings and suggests potential directions for future developments and modifications of the SFS algorithm.展开更多
We use evolutionaly computing to synthesize Boolean functions randomly Byusing specific crossover and mutation operator,in evolving process and modifying search space andfitness function,we get some high non-linearity...We use evolutionaly computing to synthesize Boolean functions randomly Byusing specific crossover and mutation operator,in evolving process and modifying search space andfitness function,we get some high non-linearity functions which have other good cryptographycharacteristics such as autocorrelation etc Comparing to other heuristic search techniques,evolutionary computing approach is more effective because of global search strategy and implicitparallelism.展开更多
The coordinated route planning problem for multiple unmanned air vehicles （UAVs）, a cooperative optimization problem, also a non-cooperative game, is addressed in the framework of game theory, A Nash equilibrium bas...The coordinated route planning problem for multiple unmanned air vehicles （UAVs）, a cooperative optimization problem, also a non-cooperative game, is addressed in the framework of game theory, A Nash equilibrium based route planner is proposed. The rational is that the structure of UAV subteam usually provides some inherent and implicit preference information, which help to find the optimum coordinated routes and the optimum combination of the various objective functions. The route planner combines the concepts of evolutionary computation with problem-specific chromosome structures and evolutionary operators and handles different kinds of mission constraints in hierarchical style. Cooperation and competition among UAVs are reflected by the definition of fitness function. Simulations validate the feasibility and superiority of the game-theoretic coordinated routes planner.展开更多
During the last three decades,evolutionary algorithms(EAs)have shown superiority in solving complex optimization problems,especially those with multiple objectives and non-differentiable landscapes.However,due to the ...During the last three decades,evolutionary algorithms(EAs)have shown superiority in solving complex optimization problems,especially those with multiple objectives and non-differentiable landscapes.However,due to the stochastic search strategies,the performance of most EAs deteriorates drastically when handling a large number of decision variables.To tackle the curse of dimensionality,this work proposes an efficient EA for solving super-large-scale multi-objective optimization problems with sparse optimal solutions.The proposed algorithm estimates the sparse distribution of optimal solutions by optimizing a binary vector for each solution,and provides a fast clustering method to highly reduce the dimensionality of the search space.More importantly,all the operations related to the decision variables only contain several matrix calculations,which can be directly accelerated by GPUs.While existing EAs are capable of handling fewer than 10000 real variables,the proposed algorithm is verified to be effective in handling 1000000 real variables.Furthermore,since the proposed algorithm handles the large number of variables via accelerated matrix calculations,its runtime can be reduced to less than 10%of the runtime of existing EAs.展开更多
Large-scale multi-objective optimization problems(LSMOPs)pose challenges to existing optimizers since a set of well-converged and diverse solutions should be found in huge search spaces.While evolutionary algorithms a...Large-scale multi-objective optimization problems(LSMOPs)pose challenges to existing optimizers since a set of well-converged and diverse solutions should be found in huge search spaces.While evolutionary algorithms are good at solving small-scale multi-objective optimization problems,they are criticized for low efficiency in converging to the optimums of LSMOPs.By contrast,mathematical programming methods offer fast convergence speed on large-scale single-objective optimization problems,but they have difficulties in finding diverse solutions for LSMOPs.Currently,how to integrate evolutionary algorithms with mathematical programming methods to solve LSMOPs remains unexplored.In this paper,a hybrid algorithm is tailored for LSMOPs by coupling differential evolution and a conjugate gradient method.On the one hand,conjugate gradients and differential evolution are used to update different decision variables of a set of solutions,where the former drives the solutions to quickly converge towards the Pareto front and the latter promotes the diversity of the solutions to cover the whole Pareto front.On the other hand,objective decomposition strategy of evolutionary multi-objective optimization is used to differentiate the conjugate gradients of solutions,and the line search strategy of mathematical programming is used to ensure the higher quality of each offspring than its parent.In comparison with state-of-the-art evolutionary algorithms,mathematical programming methods,and hybrid algorithms,the proposed algorithm exhibits better convergence and diversity performance on a variety of benchmark and real-world LSMOPs.展开更多
Large-scale multi-objective optimization problems(MOPs)that involve a large number of decision variables,have emerged from many real-world applications.While evolutionary algorithms(EAs)have been widely acknowledged a...Large-scale multi-objective optimization problems(MOPs)that involve a large number of decision variables,have emerged from many real-world applications.While evolutionary algorithms(EAs)have been widely acknowledged as a mainstream method for MOPs,most research progress and successful applications of EAs have been restricted to MOPs with small-scale decision variables.More recently,it has been reported that traditional multi-objective EAs(MOEAs)suffer severe deterioration with the increase of decision variables.As a result,and motivated by the emergence of real-world large-scale MOPs,investigation of MOEAs in this aspect has attracted much more attention in the past decade.This paper reviews the progress of evolutionary computation for large-scale multi-objective optimization from two angles.From the key difficulties of the large-scale MOPs,the scalability analysis is discussed by focusing on the performance of existing MOEAs and the challenges induced by the increase of the number of decision variables.From the perspective of methodology,the large-scale MOEAs are categorized into three classes and introduced respectively:divide and conquer based,dimensionality reduction based and enhanced search-based approaches.Several future research directions are also discussed.展开更多
Evolutionary Computation(EC)has strengths in terms of computation for gait optimization.However,conventional evolutionary algorithms use typical gait parameters such as step length and swing height,which limit the tra...Evolutionary Computation(EC)has strengths in terms of computation for gait optimization.However,conventional evolutionary algorithms use typical gait parameters such as step length and swing height,which limit the trajectory deformation for optimization of the foot trajectory.Furthermore,the quantitative index of fitness convergence is insufficient.In this paper,we perform gait optimization of a quadruped robot using foot placement perturbation based on EC.The proposed algorithm has an atypical solution search range,which is generated by independent manipulation of each placement that forms the foot trajectory.A convergence index is also introduced to prevent premature cessation of learning.The conventional algorithm and the proposed algorithm are applied to a quadruped robot;walking performances are then compared by gait simulation.Although the two algorithms exhibit similar computation rates,the proposed algorithm shows better fitness and a wider search range.The evolutionary tendency of the walking trajectory is analyzed using the optimized results,and the findings provide insight into reliable leg trajectory design.展开更多
This paper addresses evolutionary multi-objective portfolio optimization in the practical context by incorporating realistic constraints into the problem model and preference criterion into the optimization search pro...This paper addresses evolutionary multi-objective portfolio optimization in the practical context by incorporating realistic constraints into the problem model and preference criterion into the optimization search process. The former is essential to enhance the realism of the classical mean-variance model proposed by Harry Markowitz, since portfolio managers often face a number of realistic constraints arising from business and industry regulations, while the latter reflects the fact that portfolio managers are ultimately interested in specific regions or points along the efficient frontier during the actual execution of their investment orders. For the former, this paper proposes an order-based representation that can be easily extended to handle various realistic constraints like floor and ceiling constraints and cardinality constraint. An experimental study, based on benchmark problems obtained from the OR-library, demonstrates its capability to attain a better approximation of the efficient frontier in terms of proximity and diversity with respect to other conventional representations. The experimental results also illustrated its viability and practicality in handling the various realistic constraints. A simple strategy to incorporate preferences into the multi-objective optimization process is highlighted and the experimental study demonstrates its capability in driving the evolutionary search towards specific regions of the efficient frontier.展开更多
Computational time complexity analyzes of evolutionary algorithms （EAs） have been performed since the mid-nineties. The first results were related to very simple algorithms, such as the （1＋1）-EA, on toy problems....Computational time complexity analyzes of evolutionary algorithms （EAs） have been performed since the mid-nineties. The first results were related to very simple algorithms, such as the （1＋1）-EA, on toy problems. These efforts produced a deeper understanding of how EAs perform on different kinds of fitness landscapes and general mathematical tools that may be extended to the analysis of more complicated EAs on more realistic problems. In fact, in recent years, it has been possible to analyze the （1＋1）-EA on combinatorial optimization problems with practical applications and more realistic population-based EAs on structured toy problems. This paper presents a survey of the results obtained in the last decade along these two research lines. The most common mathematical techniques are introduced, the basic ideas behind them are discussed and their elective applications are highlighted. Solved problems that were still open are enumerated as are those still awaiting for a solution. New questions and problems arisen in the meantime are also considered.展开更多
Field penetration index(FPI) is one of the representative key parameters to examine the tunnel boring machine(TBM) performance.Lack of accurate FPI prediction can be responsible for numerous disastrous incidents assoc...Field penetration index(FPI) is one of the representative key parameters to examine the tunnel boring machine(TBM) performance.Lack of accurate FPI prediction can be responsible for numerous disastrous incidents associated with rock mechanics and engineering.This study aims to predict TBM performance(i.e.FPI) by an efficient and improved adaptive neuro-fuzzy inference system(ANFIS) model.This was done using an evolutionary algorithm,i.e.artificial bee colony(ABC) algorithm mixed with the ANFIS model.The role of ABC algorithm in this system is to find the optimum membership functions(MFs) of ANFIS model to achieve a higher degree of accuracy.The procedure and modeling were conducted on a tunnelling database comprising of more than 150 data samples where brittleness index(BI),fracture spacing,α angle between the plane of weakness and the TBM driven direction,and field single cutter load were assigned as model inputs to approximate FPI values.According to the results obtained by performance indices,the proposed ANFISABC model was able to receive the highest accuracy level in predicting FPI values compared with ANFIS model.In terms of coefficient of determination(R^(2)),the values of 0.951 and 0.901 were obtained for training and testing stages of the proposed ANFISABC model,respectively,which confirm its power and capability in solving TBM performance problem.The proposed model can be used in the other areas of rock mechanics and underground space technologies with similar conditions.展开更多
The paper proposes an on-line signature verification algorithm, through which test sample and template signatures can be optimizedly matched, based on evolutionary computation （EC）. Firstly, the similarity of signat...The paper proposes an on-line signature verification algorithm, through which test sample and template signatures can be optimizedly matched, based on evolutionary computation （EC）. Firstly, the similarity of signature curve segment is defined, and shift and scale transforms are also introduced due to the randoness of on-line signature. Secondly, this paper puts forward signature verification matching algorithm after establishment of the mathematical model. Thirdly, the concrete realization of the algorithm based on EC is discussed as well. In addition, the influence of shift and scale on the matching result is fully considered in the algorithm. Finally, a computation example is given, and the matching results between the test sample curve and the template signature curve are analyzed in detail, The preliminary experiments reveal that the type of signature verification problem can be solved by EC.展开更多
Social propagation denotes the spread phenomena directly correlated to the human world and society, which includes but is not limited to the diffusion of human epidemics, human-made malicious viruses, fake news, socia...Social propagation denotes the spread phenomena directly correlated to the human world and society, which includes but is not limited to the diffusion of human epidemics, human-made malicious viruses, fake news, social innovation, viral marketing, etc. Simulation and optimization are two major themes in social propagation, where network-based simulation helps to analyze and understand the social contagion, and problem-oriented optimization is devoted to contain or improve the infection results. Though there have been many models and optimization techniques, the matter of concern is that the increasing complexity and scales of propagation processes continuously refresh the former conclusions. Recently, evolutionary computation(EC) shows its potential in alleviating the concerns by introducing an evolving and developing perspective. With this insight, this paper intends to develop a comprehensive view of how EC takes effect in social propagation. Taxonomy is provided for classifying the propagation problems, and the applications of EC in solving these problems are reviewed. Furthermore, some open issues of social propagation and the potential applications of EC are discussed.This paper contributes to recognizing the problems in application-oriented EC design and paves the way for the development of evolving propagation dynamics.展开更多
This paper studies evolutionary mechanism of parameter selection in the construction of weight function for Nearest Neighbour Estimate in nonparametric regression. Construct an algorithm which adaptively evolves fine ...This paper studies evolutionary mechanism of parameter selection in the construction of weight function for Nearest Neighbour Estimate in nonparametric regression. Construct an algorithm which adaptively evolves fine weight and makes good prediction about unknown points. The numerical experiments indicate that this method is effective. It is a meaningful discussion about practicability of nonparametric regression and methodology of adaptive model-building.展开更多
This paper presents a new approach to the delineation of local labor markets based on evolutionary computation. The aim of the exercise is the division of a given territory into functional regions based on travel-to-w...This paper presents a new approach to the delineation of local labor markets based on evolutionary computation. The aim of the exercise is the division of a given territory into functional regions based on travel-to-work flows. Such regions are defined so that a high degree of inter-regional separation and of intra-regional integration in both cases in terms of commuting flows is guaranteed. Additional requirements include the absence of overlap between delineated regions and the exhaustive coverage of the whole territory. The procedure is based on the maximization of a fitness function that measures aggregate intra-region interaction under constraints of inter-region separation and minimum size. In the experimentation stage, two variations of the fitness function are used, and the process is also applied as a final stage for the optimization of the results from one of the most successful existing methods, which are used by the British authorities for the delineation of travel-to-work areas （TTWAs）. The empirical exercise is conducted using real data for a sufficiently large territory that is considered to be representative given the density and variety of travel-to-work patterns that it embraces. The paper includes the quantitative comparison with alternative traditional methods, the assessment of the performance of the set of operators which has been specifically designed to handle the regionalization problem and the evaluation of the convergence process. The robustness of the solutions, something crucial in a research and policy-making context, is also discussed in the paper.展开更多
A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not ...A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By using problem-specific chromosome structure and genetic operators, the routes are generated in real time, with different mission constraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving angle and route distance constraint taken into account.展开更多
Multi-objective optimization is a new focus of evolutionary computation research. This paper puts forward a new algorithm, which can not only converge quickly, but also keep diversity among population efficiently, in ...Multi-objective optimization is a new focus of evolutionary computation research. This paper puts forward a new algorithm, which can not only converge quickly, but also keep diversity among population efficiently, in order to find the Pareto-optimal set. This new algorithm replaces the worst individual with a newly-created one by 'multi-parent crossover' , so that the population could converge near the true Pareto-optimal solutions in the end. At the same time, this new algorithm adopts niching and fitness-sharing techniques to keep the population in a good distribution. Numerical experiments show that the algorithm is rather effective in solving some Benchmarks. No matter whether the Pareto front of problems is convex or non-convex, continuous or discontinuous, and the problems are with constraints or not, the program turns out to do well.展开更多
This paper attempts to set a unified scene for various linear time-invariant (LTI) control system design schemes, by transforming the existing concept of “computer-aided control system design” (CACSD) to novel “com...This paper attempts to set a unified scene for various linear time-invariant (LTI) control system design schemes, by transforming the existing concept of “computer-aided control system design” (CACSD) to novel “computer-automated control system design” (CAutoCSD). The first step towards this goal is to accommodate, under practical constraints, various design objectives that are desirable in both time and frequency domains. Such performance-prioritised unification is aimed at relieving practising engineers from having to select a particular control scheme and from sacrificing certain performance goals resulting from pre-commitment to such schemes. With recent progress in evolutionary computing based extra-numeric, multi-criterion search and optimisation techniques, such unification of LTI control schemes becomes feasible, analytical and practical, and the resultant designs can be creative. The techniques developed are applied to, and illustrated by, three design problems. The unified approach automatically provides an integrator for zero-steady state error in velocity control of a DC motor, and meets multiple objectives in the design of an LTI controller for a non-minimum phase plant and offers a high-performance LTI controller network for a non-linear chemical process.展开更多
基金supported by the Motorola Mobility,the National Council for Scientific and Technological Development(No.433142/2018-9)Research Productivity Fellowship(No.312831/2020-0)the Pernambuco Research Foundation(FACEPE)。
文摘5G networks apply adaptive modulation and coding according to the channel condition reported by the user in order to keep the mobile communication quality.However,the delay incurred by the feedback may make the channel quality indicator(CQI)obsolete.This paper addresses this issue by proposing two approaches,one based on machine learning and another on evolutionary computing,which considers the user context and signal-to-interference-plus-noise ratio(SINR)besides the delay length to estimate the updated SINR to be mapped into a CQI value.Our proposals are designed to run at the user equipment(UE)side,neither requiring any change in the signalling between the base station(gNB)and UE nor overloading the gNB.They are evaluated in terms of mean squared error by adopting 5G network simulation data and the results show their high accuracy and feasibility to be employed in 5G/6G systems.
基金supported in part by the National Natural Science Foundation of China (NSFC) under Grant No.61976242in part by the Natural Science Fund of Hebei Province for Distinguished Young Scholars under Grant No.F2021202010+2 种基金in part by the Fundamental Scientific Research Funds for Interdisciplinary Team of Hebei University of Technology under Grant No.JBKYTD2002funded by Science and Technology Project of Hebei Education Department under Grant No.JZX2023007supported by 2022 Interdisciplinary Postgraduate Training Program of Hebei University of Technology under Grant No.HEBUT-YXKJC-2022122.
文摘Most of the neural network architectures are based on human experience,which requires a long and tedious trial-and-error process.Neural architecture search(NAS)attempts to detect effective architectures without human intervention.Evolutionary algorithms(EAs)for NAS can find better solutions than human-designed architectures by exploring a large search space for possible architectures.Using multiobjective EAs for NAS,optimal neural architectures that meet various performance criteria can be explored and discovered efficiently.Furthermore,hardware-accelerated NAS methods can improve the efficiency of the NAS.While existing reviews have mainly focused on different strategies to complete NAS,a few studies have explored the use of EAs for NAS.In this paper,we summarize and explore the use of EAs for NAS,as well as large-scale multiobjective optimization strategies and hardware-accelerated NAS methods.NAS performs well in healthcare applications,such as medical image analysis,classification of disease diagnosis,and health monitoring.EAs for NAS can automate the search process and optimize multiple objectives simultaneously in a given healthcare task.Deep neural network has been successfully used in healthcare,but it lacks interpretability.Medical data is highly sensitive,and privacy leaks are frequently reported in the healthcare industry.To solve these problems,in healthcare,we propose an interpretable neuroevolution framework based on federated learning to address search efficiency and privacy protection.Moreover,we also point out future research directions for evolutionary NAS.Overall,for researchers who want to use EAs to optimize NNs in healthcare,we analyze the advantages and disadvantages of doing so to provide detailed guidance,and propose an interpretable privacy-preserving framework for healthcare applications.
基金supported by the Liaoning Province Applied Basic Research Program Project of China(Grant:2023JH2/101300065)the Liaoning Province Science and Technology Plan Joint Fund(2023-MSLH-221).
文摘Deep learning has emerged in many practical applications,such as image classification,fault diagnosis,and object detection.More recently,convolutional neural networks(CNNs),representative models of deep learning,have been used to solve fault detection.However,the current design of CNNs for fault detection of wind turbine blades is highly dependent on domain knowledge and requires a large amount of trial and error.For this reason,an evolutionary YOLOv8 network has been developed to automatically find the network architecture for wind turbine blade-based fault detection.YOLOv8 is a CNN-backed object detection model.Specifically,to reduce the parameter count,we first design an improved FasterNet module based on the Partial Convolution(PConv)operator.Then,to enhance convergence performance,we improve the loss function based on the efficient complete intersection over the union.Based on this,a flexible variable-length encoding is proposed,and the corresponding reproduction operators are designed.Related experimental results confirmthat the proposed approach can achieve better fault detection results and improve by 2.6%in mean precision at 50(mAP50)compared to the existing methods.Additionally,compared to training with the YOLOv8n model,the YOLOBFE model reduces the training parameters by 933,937 and decreases the GFLOPS(Giga Floating Point Operations Per Second)by 1.1.
基金supported by Prince Sattam bin Abdulaziz University for funding this research work through the project number(2024/RV/06).
文摘With the rapid advancements in technology and science,optimization theory and algorithms have become increasingly important.A wide range of real-world problems is classified as optimization challenges,and meta-heuristic algorithms have shown remarkable effectiveness in solving these challenges across diverse domains,such as machine learning,process control,and engineering design,showcasing their capability to address complex optimization problems.The Stochastic Fractal Search(SFS)algorithm is one of the most popular meta-heuristic optimization methods inspired by the fractal growth patterns of natural materials.Since its introduction by Hamid Salimi in 2015,SFS has garnered significant attention from researchers and has been applied to diverse optimization problems acrossmultiple disciplines.Its popularity can be attributed to several factors,including its simplicity,practical computational efficiency,ease of implementation,rapid convergence,high effectiveness,and ability to address singleandmulti-objective optimization problems,often outperforming other established algorithms.This review paper offers a comprehensive and detailed analysis of the SFS algorithm,covering its standard version,modifications,hybridization,and multi-objective implementations.The paper also examines several SFS applications across diverse domains,including power and energy systems,image processing,machine learning,wireless sensor networks,environmental modeling,economics and finance,and numerous engineering challenges.Furthermore,the paper critically evaluates the SFS algorithm’s performance,benchmarking its effectiveness against recently published meta-heuristic algorithms.In conclusion,the review highlights key findings and suggests potential directions for future developments and modifications of the SFS algorithm.
基金Supported by the National Natural Science Foun-dation of China(69973034,60373087,60473023)the Ph.D Pro-grams Foundation of Ministry of Education of China(20020486046)
文摘We use evolutionaly computing to synthesize Boolean functions randomly Byusing specific crossover and mutation operator,in evolving process and modifying search space andfitness function,we get some high non-linearity functions which have other good cryptographycharacteristics such as autocorrelation etc Comparing to other heuristic search techniques,evolutionary computing approach is more effective because of global search strategy and implicitparallelism.
文摘The coordinated route planning problem for multiple unmanned air vehicles （UAVs）, a cooperative optimization problem, also a non-cooperative game, is addressed in the framework of game theory, A Nash equilibrium based route planner is proposed. The rational is that the structure of UAV subteam usually provides some inherent and implicit preference information, which help to find the optimum coordinated routes and the optimum combination of the various objective functions. The route planner combines the concepts of evolutionary computation with problem-specific chromosome structures and evolutionary operators and handles different kinds of mission constraints in hierarchical style. Cooperation and competition among UAVs are reflected by the definition of fitness function. Simulations validate the feasibility and superiority of the game-theoretic coordinated routes planner.
基金This work was supported in part by the National Key Research and Development Program of China(2018AAA0100100)the National Natural Science Foundation of China(61822301,61876123,61906001)+2 种基金the Collaborative Innovation Program of Universities in Anhui Province(GXXT-2020-051)the Hong Kong Scholars Program(XJ2019035)Anhui Provincial Natural Science Foundation(1908085QF271).
文摘During the last three decades,evolutionary algorithms(EAs)have shown superiority in solving complex optimization problems,especially those with multiple objectives and non-differentiable landscapes.However,due to the stochastic search strategies,the performance of most EAs deteriorates drastically when handling a large number of decision variables.To tackle the curse of dimensionality,this work proposes an efficient EA for solving super-large-scale multi-objective optimization problems with sparse optimal solutions.The proposed algorithm estimates the sparse distribution of optimal solutions by optimizing a binary vector for each solution,and provides a fast clustering method to highly reduce the dimensionality of the search space.More importantly,all the operations related to the decision variables only contain several matrix calculations,which can be directly accelerated by GPUs.While existing EAs are capable of handling fewer than 10000 real variables,the proposed algorithm is verified to be effective in handling 1000000 real variables.Furthermore,since the proposed algorithm handles the large number of variables via accelerated matrix calculations,its runtime can be reduced to less than 10%of the runtime of existing EAs.
基金supported in part by the National Key Research and Development Program of China(2018AAA0100100)the National Natural Science Foundation of China(61906001,62136008,U21A20512)+1 种基金the Key Program of Natural Science Project of Educational Commission of Anhui Province(KJ2020A0036)Alexander von Humboldt Professorship for Artificial Intelligence Funded by the Federal Ministry of Education and Research,Germany。
文摘Large-scale multi-objective optimization problems(LSMOPs)pose challenges to existing optimizers since a set of well-converged and diverse solutions should be found in huge search spaces.While evolutionary algorithms are good at solving small-scale multi-objective optimization problems,they are criticized for low efficiency in converging to the optimums of LSMOPs.By contrast,mathematical programming methods offer fast convergence speed on large-scale single-objective optimization problems,but they have difficulties in finding diverse solutions for LSMOPs.Currently,how to integrate evolutionary algorithms with mathematical programming methods to solve LSMOPs remains unexplored.In this paper,a hybrid algorithm is tailored for LSMOPs by coupling differential evolution and a conjugate gradient method.On the one hand,conjugate gradients and differential evolution are used to update different decision variables of a set of solutions,where the former drives the solutions to quickly converge towards the Pareto front and the latter promotes the diversity of the solutions to cover the whole Pareto front.On the other hand,objective decomposition strategy of evolutionary multi-objective optimization is used to differentiate the conjugate gradients of solutions,and the line search strategy of mathematical programming is used to ensure the higher quality of each offspring than its parent.In comparison with state-of-the-art evolutionary algorithms,mathematical programming methods,and hybrid algorithms,the proposed algorithm exhibits better convergence and diversity performance on a variety of benchmark and real-world LSMOPs.
基金This work was supported by the Natural Science Foundation of China(Nos.61672478 and 61806090)the National Key Research and Development Program of China(No.2017YFB1003102)+4 种基金the Guangdong Provincial Key Laboratory(No.2020B121201001)the Shenzhen Peacock Plan(No.KQTD2016112514355531)the Guangdong-Hong Kong-Macao Greater Bay Area Center for Brain Science and Brain-inspired Intelligence Fund(No.2019028)the Fellowship of China Postdoctoral Science Foundation(No.2020M671900)the National Leading Youth Talent Support Program of China.
文摘Large-scale multi-objective optimization problems(MOPs)that involve a large number of decision variables,have emerged from many real-world applications.While evolutionary algorithms(EAs)have been widely acknowledged as a mainstream method for MOPs,most research progress and successful applications of EAs have been restricted to MOPs with small-scale decision variables.More recently,it has been reported that traditional multi-objective EAs(MOEAs)suffer severe deterioration with the increase of decision variables.As a result,and motivated by the emergence of real-world large-scale MOPs,investigation of MOEAs in this aspect has attracted much more attention in the past decade.This paper reviews the progress of evolutionary computation for large-scale multi-objective optimization from two angles.From the key difficulties of the large-scale MOPs,the scalability analysis is discussed by focusing on the performance of existing MOEAs and the challenges induced by the increase of the number of decision variables.From the perspective of methodology,the large-scale MOEAs are categorized into three classes and introduced respectively:divide and conquer based,dimensionality reduction based and enhanced search-based approaches.Several future research directions are also discussed.
基金This work was supported in part by the National Research Foundation of Korea(NRF)Grant funded by the Korean Government(MSIT)(No.NRF-2019R1A2C2084677)the 2021 Research Fund(1.210052.01)of UNIST(Ulsan National Institute of Science and Technology).
文摘Evolutionary Computation(EC)has strengths in terms of computation for gait optimization.However,conventional evolutionary algorithms use typical gait parameters such as step length and swing height,which limit the trajectory deformation for optimization of the foot trajectory.Furthermore,the quantitative index of fitness convergence is insufficient.In this paper,we perform gait optimization of a quadruped robot using foot placement perturbation based on EC.The proposed algorithm has an atypical solution search range,which is generated by independent manipulation of each placement that forms the foot trajectory.A convergence index is also introduced to prevent premature cessation of learning.The conventional algorithm and the proposed algorithm are applied to a quadruped robot;walking performances are then compared by gait simulation.Although the two algorithms exhibit similar computation rates,the proposed algorithm shows better fitness and a wider search range.The evolutionary tendency of the walking trajectory is analyzed using the optimized results,and the findings provide insight into reliable leg trajectory design.
文摘This paper addresses evolutionary multi-objective portfolio optimization in the practical context by incorporating realistic constraints into the problem model and preference criterion into the optimization search process. The former is essential to enhance the realism of the classical mean-variance model proposed by Harry Markowitz, since portfolio managers often face a number of realistic constraints arising from business and industry regulations, while the latter reflects the fact that portfolio managers are ultimately interested in specific regions or points along the efficient frontier during the actual execution of their investment orders. For the former, this paper proposes an order-based representation that can be easily extended to handle various realistic constraints like floor and ceiling constraints and cardinality constraint. An experimental study, based on benchmark problems obtained from the OR-library, demonstrates its capability to attain a better approximation of the efficient frontier in terms of proximity and diversity with respect to other conventional representations. The experimental results also illustrated its viability and practicality in handling the various realistic constraints. A simple strategy to incorporate preferences into the multi-objective optimization process is highlighted and the experimental study demonstrates its capability in driving the evolutionary search towards specific regions of the efficient frontier.
基金This work was supported by an EPSRC grant (No.EP/C520696/1).
文摘Computational time complexity analyzes of evolutionary algorithms （EAs） have been performed since the mid-nineties. The first results were related to very simple algorithms, such as the （1＋1）-EA, on toy problems. These efforts produced a deeper understanding of how EAs perform on different kinds of fitness landscapes and general mathematical tools that may be extended to the analysis of more complicated EAs on more realistic problems. In fact, in recent years, it has been possible to analyze the （1＋1）-EA on combinatorial optimization problems with practical applications and more realistic population-based EAs on structured toy problems. This paper presents a survey of the results obtained in the last decade along these two research lines. The most common mathematical techniques are introduced, the basic ideas behind them are discussed and their elective applications are highlighted. Solved problems that were still open are enumerated as are those still awaiting for a solution. New questions and problems arisen in the meantime are also considered.
基金supported by the Faculty Development Competitive Research Grant program of Nazarbayev University(Grant No.021220FD5151)。
文摘Field penetration index(FPI) is one of the representative key parameters to examine the tunnel boring machine(TBM) performance.Lack of accurate FPI prediction can be responsible for numerous disastrous incidents associated with rock mechanics and engineering.This study aims to predict TBM performance(i.e.FPI) by an efficient and improved adaptive neuro-fuzzy inference system(ANFIS) model.This was done using an evolutionary algorithm,i.e.artificial bee colony(ABC) algorithm mixed with the ANFIS model.The role of ABC algorithm in this system is to find the optimum membership functions(MFs) of ANFIS model to achieve a higher degree of accuracy.The procedure and modeling were conducted on a tunnelling database comprising of more than 150 data samples where brittleness index(BI),fracture spacing,α angle between the plane of weakness and the TBM driven direction,and field single cutter load were assigned as model inputs to approximate FPI values.According to the results obtained by performance indices,the proposed ANFISABC model was able to receive the highest accuracy level in predicting FPI values compared with ANFIS model.In terms of coefficient of determination(R^(2)),the values of 0.951 and 0.901 were obtained for training and testing stages of the proposed ANFISABC model,respectively,which confirm its power and capability in solving TBM performance problem.The proposed model can be used in the other areas of rock mechanics and underground space technologies with similar conditions.
基金Supported by the National Natural Science Foun-dation of China (60496315)
文摘The paper proposes an on-line signature verification algorithm, through which test sample and template signatures can be optimizedly matched, based on evolutionary computation （EC）. Firstly, the similarity of signature curve segment is defined, and shift and scale transforms are also introduced due to the randoness of on-line signature. Secondly, this paper puts forward signature verification matching algorithm after establishment of the mathematical model. Thirdly, the concrete realization of the algorithm based on EC is discussed as well. In addition, the influence of shift and scale on the matching result is fully considered in the algorithm. Finally, a computation example is given, and the matching results between the test sample curve and the template signature curve are analyzed in detail, The preliminary experiments reveal that the type of signature verification problem can be solved by EC.
基金by National Key Research and Development Project,Ministry of Science and Technology,China(No.2018AAA0101300)National Natural Science Foundation of China(Nos.61976093 and 61873097)+1 种基金Guangdong-Hong Kong Joint Innovative Platform of Big Data and Computational Intelligence(No.2018B050502006)Guangdong Natural Science Foundation Research Team(No.2018B030312003).
文摘Social propagation denotes the spread phenomena directly correlated to the human world and society, which includes but is not limited to the diffusion of human epidemics, human-made malicious viruses, fake news, social innovation, viral marketing, etc. Simulation and optimization are two major themes in social propagation, where network-based simulation helps to analyze and understand the social contagion, and problem-oriented optimization is devoted to contain or improve the infection results. Though there have been many models and optimization techniques, the matter of concern is that the increasing complexity and scales of propagation processes continuously refresh the former conclusions. Recently, evolutionary computation(EC) shows its potential in alleviating the concerns by introducing an evolving and developing perspective. With this insight, this paper intends to develop a comprehensive view of how EC takes effect in social propagation. Taxonomy is provided for classifying the propagation problems, and the applications of EC in solving these problems are reviewed. Furthermore, some open issues of social propagation and the potential applications of EC are discussed.This paper contributes to recognizing the problems in application-oriented EC design and paves the way for the development of evolving propagation dynamics.
文摘This paper studies evolutionary mechanism of parameter selection in the construction of weight function for Nearest Neighbour Estimate in nonparametric regression. Construct an algorithm which adaptively evolves fine weight and makes good prediction about unknown points. The numerical experiments indicate that this method is effective. It is a meaningful discussion about practicability of nonparametric regression and methodology of adaptive model-building.
基金This work was supported by Spanish National Plan of R+D+i from Spanish Ministry of Education and Science(Ministerio de Educación y Ciencia)for the project Local Labour Markets:New Methods of Delineation and Analysis(No.8EJ2007-67767-C04-02)the European Social Fund(ESF)and the University of Alicante.
文摘This paper presents a new approach to the delineation of local labor markets based on evolutionary computation. The aim of the exercise is the division of a given territory into functional regions based on travel-to-work flows. Such regions are defined so that a high degree of inter-regional separation and of intra-regional integration in both cases in terms of commuting flows is guaranteed. Additional requirements include the absence of overlap between delineated regions and the exhaustive coverage of the whole territory. The procedure is based on the maximization of a fitness function that measures aggregate intra-region interaction under constraints of inter-region separation and minimum size. In the experimentation stage, two variations of the fitness function are used, and the process is also applied as a final stage for the optimization of the results from one of the most successful existing methods, which are used by the British authorities for the delineation of travel-to-work areas （TTWAs）. The empirical exercise is conducted using real data for a sufficiently large territory that is considered to be representative given the density and variety of travel-to-work patterns that it embraces. The paper includes the quantitative comparison with alternative traditional methods, the assessment of the performance of the set of operators which has been specifically designed to handle the regionalization problem and the evaluation of the convergence process. The robustness of the solutions, something crucial in a research and policy-making context, is also discussed in the paper.
文摘A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By using problem-specific chromosome structure and genetic operators, the routes are generated in real time, with different mission constraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving angle and route distance constraint taken into account.
基金Supported by the National Natural Science Foundation of China (6013301,60073043,70071042)
文摘Multi-objective optimization is a new focus of evolutionary computation research. This paper puts forward a new algorithm, which can not only converge quickly, but also keep diversity among population efficiently, in order to find the Pareto-optimal set. This new algorithm replaces the worst individual with a newly-created one by 'multi-parent crossover' , so that the population could converge near the true Pareto-optimal solutions in the end. At the same time, this new algorithm adopts niching and fitness-sharing techniques to keep the population in a good distribution. Numerical experiments show that the algorithm is rather effective in solving some Benchmarks. No matter whether the Pareto front of problems is convex or non-convex, continuous or discontinuous, and the problems are with constraints or not, the program turns out to do well.
文摘This paper attempts to set a unified scene for various linear time-invariant (LTI) control system design schemes, by transforming the existing concept of “computer-aided control system design” (CACSD) to novel “computer-automated control system design” (CAutoCSD). The first step towards this goal is to accommodate, under practical constraints, various design objectives that are desirable in both time and frequency domains. Such performance-prioritised unification is aimed at relieving practising engineers from having to select a particular control scheme and from sacrificing certain performance goals resulting from pre-commitment to such schemes. With recent progress in evolutionary computing based extra-numeric, multi-criterion search and optimisation techniques, such unification of LTI control schemes becomes feasible, analytical and practical, and the resultant designs can be creative. The techniques developed are applied to, and illustrated by, three design problems. The unified approach automatically provides an integrator for zero-steady state error in velocity control of a DC motor, and meets multiple objectives in the design of an LTI controller for a non-minimum phase plant and offers a high-performance LTI controller network for a non-linear chemical process.
