In a wide range of engineering applications,complex constrained multi-objective optimization problems(CMOPs)present significant challenges,as the complexity of constraints often hampers algorithmic convergence and red...In a wide range of engineering applications,complex constrained multi-objective optimization problems(CMOPs)present significant challenges,as the complexity of constraints often hampers algorithmic convergence and reduces population diversity.To address these challenges,we propose a novel algorithm named Constraint IntensityDriven Evolutionary Multitasking(CIDEMT),which employs a two-stage,tri-task framework to dynamically integrates problem structure and knowledge transfer.In the first stage,three cooperative tasks are designed to explore the Constrained Pareto Front(CPF),the Unconstrained Pareto Front(UPF),and theε-relaxed constraint boundary,respectively.A CPF-UPF relationship classifier is employed to construct a problem-type-aware evolutionary strategy pool.At the end of the first stage,each task selects strategies from this strategy pool based on the specific type of problem,thereby guiding the subsequent evolutionary process.In the second stage,while each task continues to evolve,aτ-driven knowledge transfer mechanism is introduced to selectively incorporate effective solutions across tasks.enhancing the convergence and feasibility of the main task.Extensive experiments conducted on 32 benchmark problems from three test suites(LIRCMOP,DASCMOP,and DOC)demonstrate that CIDEMT achieves the best Inverted Generational Distance(IGD)values on 24 problems and the best Hypervolume values(HV)on 22 problems.Furthermore,CIDEMT significantly outperforms six state-of-the-art constrained multi-objective evolutionary algorithms(CMOEAs).These results confirm CIDEMT’s superiority in promoting convergence,diversity,and robustness in solving complex CMOPs.展开更多
Evolutionary multi-task optimization(EMTO)presents an efficient way to solve multiple tasks simultaneously.However,difficulties they face in curbing the performance degradation caused by unmatched knowledge transfer a...Evolutionary multi-task optimization(EMTO)presents an efficient way to solve multiple tasks simultaneously.However,difficulties they face in curbing the performance degradation caused by unmatched knowledge transfer and inefficient evolutionary strategies become more severe as the number of iterations increases.Motivated by this,a novel self-adjusting dualmode evolutionary framework,which integrates variable classification evolution and knowledge dynamic transfer strategies,is designed to compensate for this deficiency.First,a dual-mode evolutionary framework is designed to meet the needs of evolution in different states.Then,a self-adjusting strategy based on spatial-temporal information is adopted to guide the selection of evolutionary modes.Second,a classification mechanism for decision variables is proposed to achieve the grouping of variables with different attributes.Then,the evolutionary algorithm with a multi-operator mechanism is employed to conduct classified evolution of decision variables.Third,an evolutionary strategy based on multi-source knowledge sharing is presented to realize the cross-domain transfer of knowledge.Then,a dynamic weighting strategy is developed for efficient utilization of knowledge.Finally,by conducting experiments and comparing the designed method with several existing algorithms,the empirical results confirm that it significantly outperforms its peers in tackling benchmark instances.展开更多
Time series clustering is a challenging problem due to the large-volume,high-dimensional,and warping characteristics of time series data.Traditional clustering methods often use a single criterion or distance measure,...Time series clustering is a challenging problem due to the large-volume,high-dimensional,and warping characteristics of time series data.Traditional clustering methods often use a single criterion or distance measure,which may not capture all the features of the data.This paper proposes a novel method for time series clustering based on evolutionary multi-tasking optimization,termed i-MFEA,which uses an improved multifactorial evolutionary algorithm to optimize multiple clustering tasks simultaneously,each with a different validity index or distance measure.Therefore,i-MFEA can produce diverse and robust clustering solutions that satisfy various preferences of decision-makers.Experiments on two artificial datasets show that i-MFEA outperforms single-objective evolutionary algorithms and traditional clustering methods in terms of convergence speed and clustering quality.The paper also discusses how i-MFEA can address two long-standing issues in time series clustering:the choice of appropriate similarity measure and the number of clusters.展开更多
Unmanned aircraft are highly vulnerable to crosswind-induced turbulence during complex maneuvers such as turning,which can significantly compromise control and reduce autopilot effectiveness.This paper presents a nove...Unmanned aircraft are highly vulnerable to crosswind-induced turbulence during complex maneuvers such as turning,which can significantly compromise control and reduce autopilot effectiveness.This paper presents a novel control strategy to improve the controllability of unmanned aircraft in challenging wind conditions.First,the equations of motion for the aircraft are reformulated as a system of stochastic differential equations,which are subsequently transformed into a deterministic form.By modeling turbulence as a Gaussian random process and incorporating it directly into the control system,the proposed method proactively compensates for the adverse effects of turbulence.The transformation is achieved using semi-invariant techniques.Second,the control problem is formulated as an optimization task,aiming to minimize the deviation between the actual and desired turn characteristics,specifically the angular velocity.Finally,a new numerical method with proven global convergence is employed to compute the optimal autopilot parameters.Simulation results using a medium-range unmanned aircraft model under continuous turbulent gusts demonstrate that the proposed method significantly outperforms existing approaches,ensuring both stability and precision in turbulent wind conditions.展开更多
To realize Industry 5.0,manufacturers face various optimization problems that seldom appear in isolation.Evolutionary MultiTasking(EMT)is an effective method to solve multiple related problems by extracting and utiliz...To realize Industry 5.0,manufacturers face various optimization problems that seldom appear in isolation.Evolutionary MultiTasking(EMT)is an effective method to solve multiple related problems by extracting and utilizing common knowledge.Knowledge transfer is the key to the effectiveness of EMT.Existing EMT methods mainly focus on designing effective intertask learning methods and ignore the fact that provided knowledge's appropriateness also has a significant effect on EMT's performance.There is plentiful knowledge in assistant tasks,and knowledge transfer may not work well and even lead to a negative effect if useless knowledge is selected to guide target tasks.EMT is thus confronted with a challenge to find appropriate knowledge.This work proposes an efficient knowledge classification-assisted EMT framework to identify and select valuable knowledge from assistant tasks.During the evolution process,better-performing candidates are supposed to have advantages in exploitation.Therefore,assistant individuals that are similar to better-performing target individuals are used to provide positive knowledge.Specifically,the target sub-population is divided into different levels and then a classifier is trained to divide assistant sub-population.Considering that target and assistant sub-populations have different characteristics,we use domain adaptation to reduce their distribution discrepancies.In this way,the trained classifier can classify assistant individuals more accurately,and truly useful knowledge can be selected for target tasks.The superior performance of our proposed framework over state-of-the-art algorithms is verified via a series of benchmark problems.展开更多
Current topology optimization methods for nonlinear continuum structures often suffer from low computational efficiency and limited applicability to complex nonlinear problems.To address these issues,this paper propos...Current topology optimization methods for nonlinear continuum structures often suffer from low computational efficiency and limited applicability to complex nonlinear problems.To address these issues,this paper proposes an improved bi-directional evolutionary structural optimization(BESO)method tailored for maximizing stiffness in nonlinear structures.The optimization program is developed in Python and can be combined with Abaqus software to facilitate finite element analysis(FEA).To accelerate the speed of optimization,a novel adaptive evolutionary ratio(ER)strategy based on the BESO method is introduced,with four distinct adaptive ER functions proposed.The Newton-Raphson method is utilized for iteratively solving nonlinear equilibrium equations,and the sensitivity information for updating design variables is derived using the adjoint method.Additionally,this study extends topology optimization to account for both material nonlinearity and geometric nonlinearity,analyzing the effects of various nonlinearities.A series of comparative studies are conducted using benchmark cases to validate the effectiveness of the proposed method.The results show that the BESO method with adaptive ER significantly improves the optimization efficiency.Compared to the BESO method with a fixed ER,the convergence speed of the four adaptive ER BESO methods is increased by 37.3%,26.7%,12%and 18.7%,respectively.Given that Abaqus is a powerful FEA platform,this method has the potential to be extended to large-scale engineering structures and to address more complex optimization problems.This research proposes an improved BESO method with novel adaptive ER,which significantly accelerates the optimization process and enables its application to topology optimization of nonlinear structures.展开更多
Expensive multiobjective optimization problems(EMOPs)are complex optimization problems exacted from realworld applications,where each objective function evaluation(FE)involves expensive computations or physical experi...Expensive multiobjective optimization problems(EMOPs)are complex optimization problems exacted from realworld applications,where each objective function evaluation(FE)involves expensive computations or physical experiments.Many surrogate-assisted evolutionary algorithms(SAEAs)have been designed to solve EMOPs.Nevertheless,EMOPs with large-scale decision variables remain challenging for existing SAEAs,leading to difficulties in maintaining convergence and diversity.To address this deficiency,we proposed a variable reconstructionbased SAEA(VREA)to balance convergence enhancement and diversity maintenance.Generally,a cluster-based variable reconstruction strategy reconstructs the original large-scale decision variables into low-dimensional weight variables.Thus,the population can be rapidly pushed towards the Pareto set(PS)by optimizing low-dimensional weight variables with the assistance of surrogate models.Population diversity is improved due to the cluster-based variable reconstruction strategy.An adaptive search step size strategy is proposed to balance exploration and exploitation further.Experimental comparisons with four state-of-the-art SAEAs are conducted on benchmark EMOPs with up to 1000 decision variables and an aerodynamic design task.Experimental results demonstrate that VREA obtains well-converged and diverse solutions with limited real FEs.展开更多
Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and eco...Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and economic viability of wind farm,where the wake effect,wind speed,types of wind turbines,etc.,have an impact on the output power of the wind farm.To solve the optimization problem of wind farm layout under complex terrain conditions,this paper proposes wind turbine layout optimization using different types of wind turbines,the aim is to reduce the influence of the wake effect and maximize economic benefits.The linear wake model is used for wake flow calculation over complex terrain.Minimizing the unit energy cost is taken as the objective function,considering that the objective function is affected by cost and output power,which influence each other.The cost function includes construction cost,installation cost,maintenance cost,etc.Therefore,a bi-level constrained optimization model is established,in which the upper-level objective function is to minimize the unit energy cost,and the lower-level objective function is to maximize the output power.Then,a hybrid evolutionary algorithm is designed according to the characteristics of the decision variables.The improved genetic algorithm and differential evolution are used to optimize the upper-level and lower-level objective functions,respectively,these evolutionary operations search for the optimal solution as much as possible.Finally,taking the roughness of different terrain,wind farms of different scales and different types of wind turbines as research scenarios,the optimal deployment is solved by using the algorithm in this paper,and four algorithms are compared to verify the effectiveness of the proposed algorithm.展开更多
When dealing with expensive multiobjective optimization problems,majority of existing surrogate-assisted evolutionary algorithms(SAEAs)generate solutions in decision space and screen candidate solutions mostly by usin...When dealing with expensive multiobjective optimization problems,majority of existing surrogate-assisted evolutionary algorithms(SAEAs)generate solutions in decision space and screen candidate solutions mostly by using designed surrogate models.The generated solutions exhibit excessive randomness,which tends to reduce the likelihood of generating good-quality solutions and cause a long evolution to the optima.To improve SAEAs greatly,this work proposes an evolutionary algorithm based on surrogate and inverse surrogate models by 1)Employing a surrogate model in lieu of expensive(true)function evaluations;and 2)Proposing and using an inverse surrogate model to generate new solutions.By using the same training data but with its inputs and outputs being reversed,the latter is simple to train.It is then used to generate new vectors in objective space,which are mapped into decision space to obtain their corresponding solutions.Using a particular example,this work shows its advantages over existing SAEAs.The results of comparing it with state-of-the-art algorithms on expensive optimization problems show that it is highly competitive in both solution performance and efficiency.展开更多
The evolutionary strategy with a dynamic weighting schedule is proposed to find all the compromised solutions of the multi-objective integrated structure and control optimization problem, where the optimal system perf...The evolutionary strategy with a dynamic weighting schedule is proposed to find all the compromised solutions of the multi-objective integrated structure and control optimization problem, where the optimal system performance and control cost are defined by H2 or H∞ norms. During this optimization process, the weights are varying with the increasing generation instead of fixed values. The proposed strategy together with the linear matrix inequality （LMI） or the Riccati controller design method can find a series of uniformly distributed nondominated solutions in a single run. Therefore, this method can greatly reduce the computation intensity of the integrated optimization problem compared with the weight-based single objective genetic algorithm. Active automotive suspension is adopted as an example to illustrate the effectiveness of the proposed method.展开更多
A new algorithm based on genetic algorithm(GA) is developed for solving function optimization problems with inequality constraints. This algorithm has been used to a series of standard test problems and exhibited good...A new algorithm based on genetic algorithm(GA) is developed for solving function optimization problems with inequality constraints. This algorithm has been used to a series of standard test problems and exhibited good performance. The computation results show that its generality, precision, robustness, simplicity and performance are all satisfactory.展开更多
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.展开更多
Evolutionary algorithms have been shown to be very successful in solving multi-objective optimization problems(MOPs).However,their performance often deteriorates when solving MOPs with irregular Pareto fronts.To remed...Evolutionary algorithms have been shown to be very successful in solving multi-objective optimization problems(MOPs).However,their performance often deteriorates when solving MOPs with irregular Pareto fronts.To remedy this issue,a large body of research has been performed in recent years and many new algorithms have been proposed.This paper provides a comprehensive survey of the research on MOPs with irregular Pareto fronts.We start with a brief introduction to the basic concepts,followed by a summary of the benchmark test problems with irregular problems,an analysis of the causes of the irregularity,and real-world optimization problems with irregular Pareto fronts.Then,a taxonomy of the existing methodologies for handling irregular problems is given and representative algorithms are reviewed with a discussion of their strengths and weaknesses.Finally,open challenges are pointed out and a few promising future directions are suggested.展开更多
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.展开更多
The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the Kmeans algorithm depends highly on initial cluster centers and converges to local minima. This paper prop...The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the Kmeans algorithm depends highly on initial cluster centers and converges to local minima. This paper proposes a hybrid evolutionary programming based clustering algorithm, called PSO-SA, by combining particle swarm optimization (PSO) and simulated annealing (SA). The basic idea is to search around the global solution by SA and to increase the information exchange among particles using a mutation operator to escape local optima. Three datasets, Iris, Wisconsin Breast Cancer, and Ripley's Glass, have been considered to show the effectiveness of the proposed clustering algorithm in providing optimal clusters. The simulation results show that the PSO-SA clustering algorithm not only has a better response but also converges more quickly than the K-means, PSO, and SA algorithms.展开更多
This paper presents a parallel two-level evolutionary algorithm based on domain decomposition for solving function optimization problem containing multiple solutions. By combining the characteristics of the global sea...This paper presents a parallel two-level evolutionary algorithm based on domain decomposition for solving function optimization problem containing multiple solutions. By combining the characteristics of the global search and local search in each sub-domain, the former enables individual to draw closer to each optima and keeps the diversity of individuals, while the latter selects local optimal solutions known as latent solutions in sub-domain. In the end, by selecting the global optimal solutions from latent solutions in each sub-domain, we can discover all the optimal solutions easily and quickly.展开更多
Application of the multiobjective evolutionary algorithms to the aerodynamicoptimization design of a centrifugal impeller is presented. The aerodynamic performance of acentrifugal impeller is evaluated by using the th...Application of the multiobjective evolutionary algorithms to the aerodynamicoptimization design of a centrifugal impeller is presented. The aerodynamic performance of acentrifugal impeller is evaluated by using the three-dimensional Navier-Stokes solutions. Thetypical centrifugal impeller is redesigned for maximization of the pressure rise and blade load andminimization of the rotational total pressure loss at the given flow conditions. The Bezier curvesare used to parameterize the three-dimensional impeller blade shape. The present method obtains manyreasonable Pareto optimal designs that outperform the original centrifugal impeller. Detailedobservation of the certain Pareto optimal design demonstrates the feasibility of the presentmultiobjective optimization method tool for turbomachinery design.展开更多
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.展开更多
Weight reduction has attracted much attention among ship designers and ship owners.In the present work,based on an improved bi-directional evolutionary structural optimization(BESO) method and surrogate model method,w...Weight reduction has attracted much attention among ship designers and ship owners.In the present work,based on an improved bi-directional evolutionary structural optimization(BESO) method and surrogate model method,we propose a hybrid optimization method for the structural design optimization of beam-plate structures,which covers three optimization levels:dimension optimization,topology optimization and section optimization.The objective of the proposed optimization method is to minimize the weight of design object under a group of constraints.The kernel optimization procedure(KOP) uses BESO to obtain the optimal topology from a ground structure.To deal with beam-plate structures,the traditional BESO method is improved by using cubic box as the unit cell instead of solid unit to construct periodic lattice structure.In the first optimization level,a series of ground structures are generated based on different dimensional parameter combinations,the KOP is performed to all the ground structures,the response surface model of optimal objective values and dimension parameters is created,and then the optimal dimension parameters can be obtained.In the second optimization level,the optimal topology is obtained by using the KOP according to the optimal dimension parameters.In the third optimization level,response surface method(RSM) is used to determine the section parameters.The proposed method is applied to a hatch cover structure design.The locations and shapes of all the structural members are determined from an oversized ground structure.The results show that the proposed method leads to a greater weight saving,compared with the original design and genetic algorithm(GA) based optimization results.展开更多
基金supported by the National Natural Science Foundation of China under Grant No.61972040the Science and Technology Research and Development Project funded by China Railway Material Trade Group Luban Company.
文摘In a wide range of engineering applications,complex constrained multi-objective optimization problems(CMOPs)present significant challenges,as the complexity of constraints often hampers algorithmic convergence and reduces population diversity.To address these challenges,we propose a novel algorithm named Constraint IntensityDriven Evolutionary Multitasking(CIDEMT),which employs a two-stage,tri-task framework to dynamically integrates problem structure and knowledge transfer.In the first stage,three cooperative tasks are designed to explore the Constrained Pareto Front(CPF),the Unconstrained Pareto Front(UPF),and theε-relaxed constraint boundary,respectively.A CPF-UPF relationship classifier is employed to construct a problem-type-aware evolutionary strategy pool.At the end of the first stage,each task selects strategies from this strategy pool based on the specific type of problem,thereby guiding the subsequent evolutionary process.In the second stage,while each task continues to evolve,aτ-driven knowledge transfer mechanism is introduced to selectively incorporate effective solutions across tasks.enhancing the convergence and feasibility of the main task.Extensive experiments conducted on 32 benchmark problems from three test suites(LIRCMOP,DASCMOP,and DOC)demonstrate that CIDEMT achieves the best Inverted Generational Distance(IGD)values on 24 problems and the best Hypervolume values(HV)on 22 problems.Furthermore,CIDEMT significantly outperforms six state-of-the-art constrained multi-objective evolutionary algorithms(CMOEAs).These results confirm CIDEMT’s superiority in promoting convergence,diversity,and robustness in solving complex CMOPs.
基金supported in part by the Plan of Key Scientific Research Projects of Colleges and Universities in Henan Province(25A413005,24A120005)the National Science and Technology Major Project(2021ZD0112302)the National Natural Science Foundation of China(62222301,61890930-5,62021003).
文摘Evolutionary multi-task optimization(EMTO)presents an efficient way to solve multiple tasks simultaneously.However,difficulties they face in curbing the performance degradation caused by unmatched knowledge transfer and inefficient evolutionary strategies become more severe as the number of iterations increases.Motivated by this,a novel self-adjusting dualmode evolutionary framework,which integrates variable classification evolution and knowledge dynamic transfer strategies,is designed to compensate for this deficiency.First,a dual-mode evolutionary framework is designed to meet the needs of evolution in different states.Then,a self-adjusting strategy based on spatial-temporal information is adopted to guide the selection of evolutionary modes.Second,a classification mechanism for decision variables is proposed to achieve the grouping of variables with different attributes.Then,the evolutionary algorithm with a multi-operator mechanism is employed to conduct classified evolution of decision variables.Third,an evolutionary strategy based on multi-source knowledge sharing is presented to realize the cross-domain transfer of knowledge.Then,a dynamic weighting strategy is developed for efficient utilization of knowledge.Finally,by conducting experiments and comparing the designed method with several existing algorithms,the empirical results confirm that it significantly outperforms its peers in tackling benchmark instances.
基金supported by the Open Project of Xiangjiang Laboratory(No.22XJ02003)the National Natural Science Foundation of China(No.62122093).
文摘Time series clustering is a challenging problem due to the large-volume,high-dimensional,and warping characteristics of time series data.Traditional clustering methods often use a single criterion or distance measure,which may not capture all the features of the data.This paper proposes a novel method for time series clustering based on evolutionary multi-tasking optimization,termed i-MFEA,which uses an improved multifactorial evolutionary algorithm to optimize multiple clustering tasks simultaneously,each with a different validity index or distance measure.Therefore,i-MFEA can produce diverse and robust clustering solutions that satisfy various preferences of decision-makers.Experiments on two artificial datasets show that i-MFEA outperforms single-objective evolutionary algorithms and traditional clustering methods in terms of convergence speed and clustering quality.The paper also discusses how i-MFEA can address two long-standing issues in time series clustering:the choice of appropriate similarity measure and the number of clusters.
基金co-supported by the Fund of Robot Technology Used for Special Environment Key Laboratory of Sichuan Province(No.22kftk01)the Key Research and Development Program of Heilongjiang,China(No.2024ZXJ07B05)the National Natural Science Foundation of China(No.92471103)。
文摘Unmanned aircraft are highly vulnerable to crosswind-induced turbulence during complex maneuvers such as turning,which can significantly compromise control and reduce autopilot effectiveness.This paper presents a novel control strategy to improve the controllability of unmanned aircraft in challenging wind conditions.First,the equations of motion for the aircraft are reformulated as a system of stochastic differential equations,which are subsequently transformed into a deterministic form.By modeling turbulence as a Gaussian random process and incorporating it directly into the control system,the proposed method proactively compensates for the adverse effects of turbulence.The transformation is achieved using semi-invariant techniques.Second,the control problem is formulated as an optimization task,aiming to minimize the deviation between the actual and desired turn characteristics,specifically the angular velocity.Finally,a new numerical method with proven global convergence is employed to compute the optimal autopilot parameters.Simulation results using a medium-range unmanned aircraft model under continuous turbulent gusts demonstrate that the proposed method significantly outperforms existing approaches,ensuring both stability and precision in turbulent wind conditions.
基金supported in part by the National Natural Science Foundation of China(51775385)the Natural Science Foundation of Shanghai(23ZR1466000)+2 种基金the Shanghai Industrial Collaborative Science and Technology Innovation Project(2021-cyxt2-kj10)the Innovation Program of Shanghai Municipal Education Commission(202101070007E00098)Tongxiang Institute of Artificial General Intelligence(TAGI2-A-2024-0006).
文摘To realize Industry 5.0,manufacturers face various optimization problems that seldom appear in isolation.Evolutionary MultiTasking(EMT)is an effective method to solve multiple related problems by extracting and utilizing common knowledge.Knowledge transfer is the key to the effectiveness of EMT.Existing EMT methods mainly focus on designing effective intertask learning methods and ignore the fact that provided knowledge's appropriateness also has a significant effect on EMT's performance.There is plentiful knowledge in assistant tasks,and knowledge transfer may not work well and even lead to a negative effect if useless knowledge is selected to guide target tasks.EMT is thus confronted with a challenge to find appropriate knowledge.This work proposes an efficient knowledge classification-assisted EMT framework to identify and select valuable knowledge from assistant tasks.During the evolution process,better-performing candidates are supposed to have advantages in exploitation.Therefore,assistant individuals that are similar to better-performing target individuals are used to provide positive knowledge.Specifically,the target sub-population is divided into different levels and then a classifier is trained to divide assistant sub-population.Considering that target and assistant sub-populations have different characteristics,we use domain adaptation to reduce their distribution discrepancies.In this way,the trained classifier can classify assistant individuals more accurately,and truly useful knowledge can be selected for target tasks.The superior performance of our proposed framework over state-of-the-art algorithms is verified via a series of benchmark problems.
基金Supported by National Natural Science Foundation of China(Grant No.52105271).
文摘Current topology optimization methods for nonlinear continuum structures often suffer from low computational efficiency and limited applicability to complex nonlinear problems.To address these issues,this paper proposes an improved bi-directional evolutionary structural optimization(BESO)method tailored for maximizing stiffness in nonlinear structures.The optimization program is developed in Python and can be combined with Abaqus software to facilitate finite element analysis(FEA).To accelerate the speed of optimization,a novel adaptive evolutionary ratio(ER)strategy based on the BESO method is introduced,with four distinct adaptive ER functions proposed.The Newton-Raphson method is utilized for iteratively solving nonlinear equilibrium equations,and the sensitivity information for updating design variables is derived using the adjoint method.Additionally,this study extends topology optimization to account for both material nonlinearity and geometric nonlinearity,analyzing the effects of various nonlinearities.A series of comparative studies are conducted using benchmark cases to validate the effectiveness of the proposed method.The results show that the BESO method with adaptive ER significantly improves the optimization efficiency.Compared to the BESO method with a fixed ER,the convergence speed of the four adaptive ER BESO methods is increased by 37.3%,26.7%,12%and 18.7%,respectively.Given that Abaqus is a powerful FEA platform,this method has the potential to be extended to large-scale engineering structures and to address more complex optimization problems.This research proposes an improved BESO method with novel adaptive ER,which significantly accelerates the optimization process and enables its application to topology optimization of nonlinear structures.
基金supported by the National Natural Science Foundation of China(U20A20306,62276191)the Fundamental Research Funds for the Central Universities(HUST2023JYCXJJ011).
文摘Expensive multiobjective optimization problems(EMOPs)are complex optimization problems exacted from realworld applications,where each objective function evaluation(FE)involves expensive computations or physical experiments.Many surrogate-assisted evolutionary algorithms(SAEAs)have been designed to solve EMOPs.Nevertheless,EMOPs with large-scale decision variables remain challenging for existing SAEAs,leading to difficulties in maintaining convergence and diversity.To address this deficiency,we proposed a variable reconstructionbased SAEA(VREA)to balance convergence enhancement and diversity maintenance.Generally,a cluster-based variable reconstruction strategy reconstructs the original large-scale decision variables into low-dimensional weight variables.Thus,the population can be rapidly pushed towards the Pareto set(PS)by optimizing low-dimensional weight variables with the assistance of surrogate models.Population diversity is improved due to the cluster-based variable reconstruction strategy.An adaptive search step size strategy is proposed to balance exploration and exploitation further.Experimental comparisons with four state-of-the-art SAEAs are conducted on benchmark EMOPs with up to 1000 decision variables and an aerodynamic design task.Experimental results demonstrate that VREA obtains well-converged and diverse solutions with limited real FEs.
基金supported by the National Natural Science Foundation of China[Grant No.12461035]Qinghai University Students Innovative Training Program Project[2024-QX-57].
文摘Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and economic viability of wind farm,where the wake effect,wind speed,types of wind turbines,etc.,have an impact on the output power of the wind farm.To solve the optimization problem of wind farm layout under complex terrain conditions,this paper proposes wind turbine layout optimization using different types of wind turbines,the aim is to reduce the influence of the wake effect and maximize economic benefits.The linear wake model is used for wake flow calculation over complex terrain.Minimizing the unit energy cost is taken as the objective function,considering that the objective function is affected by cost and output power,which influence each other.The cost function includes construction cost,installation cost,maintenance cost,etc.Therefore,a bi-level constrained optimization model is established,in which the upper-level objective function is to minimize the unit energy cost,and the lower-level objective function is to maximize the output power.Then,a hybrid evolutionary algorithm is designed according to the characteristics of the decision variables.The improved genetic algorithm and differential evolution are used to optimize the upper-level and lower-level objective functions,respectively,these evolutionary operations search for the optimal solution as much as possible.Finally,taking the roughness of different terrain,wind farms of different scales and different types of wind turbines as research scenarios,the optimal deployment is solved by using the algorithm in this paper,and four algorithms are compared to verify the effectiveness of the proposed algorithm.
基金supported in part by the National Natural Science Foundation of China(51775385)the Natural Science Foundation of Shanghai(23ZR1466000)+2 种基金the Shanghai Industrial Collaborative Science and Technology Innovation Project(2021-cyxt2-kj10)the Innovation Program of Shanghai Municipal Education Commission(202101070007E00098)Fundo para o Desenvolvimento das Ciencias e da Tecnologia(FDCT)(0147/2024/AFJ).
文摘When dealing with expensive multiobjective optimization problems,majority of existing surrogate-assisted evolutionary algorithms(SAEAs)generate solutions in decision space and screen candidate solutions mostly by using designed surrogate models.The generated solutions exhibit excessive randomness,which tends to reduce the likelihood of generating good-quality solutions and cause a long evolution to the optima.To improve SAEAs greatly,this work proposes an evolutionary algorithm based on surrogate and inverse surrogate models by 1)Employing a surrogate model in lieu of expensive(true)function evaluations;and 2)Proposing and using an inverse surrogate model to generate new solutions.By using the same training data but with its inputs and outputs being reversed,the latter is simple to train.It is then used to generate new vectors in objective space,which are mapped into decision space to obtain their corresponding solutions.Using a particular example,this work shows its advantages over existing SAEAs.The results of comparing it with state-of-the-art algorithms on expensive optimization problems show that it is highly competitive in both solution performance and efficiency.
文摘The evolutionary strategy with a dynamic weighting schedule is proposed to find all the compromised solutions of the multi-objective integrated structure and control optimization problem, where the optimal system performance and control cost are defined by H2 or H∞ norms. During this optimization process, the weights are varying with the increasing generation instead of fixed values. The proposed strategy together with the linear matrix inequality （LMI） or the Riccati controller design method can find a series of uniformly distributed nondominated solutions in a single run. Therefore, this method can greatly reduce the computation intensity of the integrated optimization problem compared with the weight-based single objective genetic algorithm. Active automotive suspension is adopted as an example to illustrate the effectiveness of the proposed method.
文摘A new algorithm based on genetic algorithm(GA) is developed for solving function optimization problems with inequality constraints. This algorithm has been used to a series of standard test problems and exhibited good performance. The computation results show that its generality, precision, robustness, simplicity and performance are all satisfactory.
文摘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 in part by the National Natural Science Foundation of China(61806051,61903078)Natural Science Foundation of Shanghai(20ZR1400400)+2 种基金Agricultural Project of the Shanghai Committee of Science and Technology(16391902800)the Fundamental Research Funds for the Central Universities(2232020D-48)the Project of the Humanities and Social Sciences on Young Fund of the Ministry of Education in China(Research on swarm intelligence collaborative robust optimization scheduling for high-dimensional dynamic decisionmaking system(20YJCZH052))。
文摘Evolutionary algorithms have been shown to be very successful in solving multi-objective optimization problems(MOPs).However,their performance often deteriorates when solving MOPs with irregular Pareto fronts.To remedy this issue,a large body of research has been performed in recent years and many new algorithms have been proposed.This paper provides a comprehensive survey of the research on MOPs with irregular Pareto fronts.We start with a brief introduction to the basic concepts,followed by a summary of the benchmark test problems with irregular problems,an analysis of the causes of the irregularity,and real-world optimization problems with irregular Pareto fronts.Then,a taxonomy of the existing methodologies for handling irregular problems is given and representative algorithms are reviewed with a discussion of their strengths and weaknesses.Finally,open challenges are pointed out and a few promising future directions are suggested.
基金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.
文摘The K-means algorithm is one of the most popular techniques in clustering. Nevertheless, the performance of the Kmeans algorithm depends highly on initial cluster centers and converges to local minima. This paper proposes a hybrid evolutionary programming based clustering algorithm, called PSO-SA, by combining particle swarm optimization (PSO) and simulated annealing (SA). The basic idea is to search around the global solution by SA and to increase the information exchange among particles using a mutation operator to escape local optima. Three datasets, Iris, Wisconsin Breast Cancer, and Ripley's Glass, have been considered to show the effectiveness of the proposed clustering algorithm in providing optimal clusters. The simulation results show that the PSO-SA clustering algorithm not only has a better response but also converges more quickly than the K-means, PSO, and SA algorithms.
基金Supported by the National Natural Science Foundation of China(60133010,60073043,70071042)
文摘This paper presents a parallel two-level evolutionary algorithm based on domain decomposition for solving function optimization problem containing multiple solutions. By combining the characteristics of the global search and local search in each sub-domain, the former enables individual to draw closer to each optima and keeps the diversity of individuals, while the latter selects local optimal solutions known as latent solutions in sub-domain. In the end, by selecting the global optimal solutions from latent solutions in each sub-domain, we can discover all the optimal solutions easily and quickly.
文摘Application of the multiobjective evolutionary algorithms to the aerodynamicoptimization design of a centrifugal impeller is presented. The aerodynamic performance of acentrifugal impeller is evaluated by using the three-dimensional Navier-Stokes solutions. Thetypical centrifugal impeller is redesigned for maximization of the pressure rise and blade load andminimization of the rotational total pressure loss at the given flow conditions. The Bezier curvesare used to parameterize the three-dimensional impeller blade shape. The present method obtains manyreasonable Pareto optimal designs that outperform the original centrifugal impeller. Detailedobservation of the certain Pareto optimal design demonstrates the feasibility of the presentmultiobjective optimization method tool for turbomachinery design.
基金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.
基金the National Natural Science Foundation of China(No.51509033)
文摘Weight reduction has attracted much attention among ship designers and ship owners.In the present work,based on an improved bi-directional evolutionary structural optimization(BESO) method and surrogate model method,we propose a hybrid optimization method for the structural design optimization of beam-plate structures,which covers three optimization levels:dimension optimization,topology optimization and section optimization.The objective of the proposed optimization method is to minimize the weight of design object under a group of constraints.The kernel optimization procedure(KOP) uses BESO to obtain the optimal topology from a ground structure.To deal with beam-plate structures,the traditional BESO method is improved by using cubic box as the unit cell instead of solid unit to construct periodic lattice structure.In the first optimization level,a series of ground structures are generated based on different dimensional parameter combinations,the KOP is performed to all the ground structures,the response surface model of optimal objective values and dimension parameters is created,and then the optimal dimension parameters can be obtained.In the second optimization level,the optimal topology is obtained by using the KOP according to the optimal dimension parameters.In the third optimization level,response surface method(RSM) is used to determine the section parameters.The proposed method is applied to a hatch cover structure design.The locations and shapes of all the structural members are determined from an oversized ground structure.The results show that the proposed method leads to a greater weight saving,compared with the original design and genetic algorithm(GA) based optimization results.
