Deterministic optimization methods are combined with the Pareto front concept to solve multi-criterion design problems. The algorithm and the numerical implementation are applied to aerodynamic designs. Evolutionary a...Deterministic optimization methods are combined with the Pareto front concept to solve multi-criterion design problems. The algorithm and the numerical implementation are applied to aerodynamic designs. Evolutionary algorithms （EAs） and the Pareto front concept are used to solve practical design problems in industry for its robustness in capturing convex, concave, discrete or discontinuous Pareto fronts of multi-objective optimization problems. However, the process is time-consuming. Therefore, deterministic optimization methods are introduced to capture the Pareto front, and the types of the captured Pareto front are explained. Numerical experiments show that the deterministic optimization method is a good alternative to EAs for capturing any convex and some concave Pareto fronts in multi-criterion aerodynamic optimization problems due to its efficiency.展开更多
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.展开更多
In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized pr...In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized problem extends the objective-constraint problem. It is demonstrated that how adding variables to the scalarized problem, can lead to find conditions for (weakly, properly) Pareto optimal solutions. Applying the obtained necessary and sufficient conditions, two algorithms for generating the Pareto front approximation of bi-objective and three-objective programming problems are designed. These algorithms are easy to implement and can achieve an even approximation of (weakly, properly) Pareto optimal solutions. These algorithms can be generalized for optimization problems with more than three criterion functions, too. The effectiveness and capability of the algorithms are demonstrated in test problems.展开更多
The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly...The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly focus on objectives,treating decision variables as a total variable to solve the problem without consideringthe critical role of decision variables in objective optimization.As seen,a variety of decision variable groupingalgorithms have been proposed.However,these algorithms are relatively broad for the changes of most decisionvariables in the evolution process and are time-consuming in the process of finding the Pareto frontier.To solvethese problems,a multi-objective optimization algorithm for grouping decision variables based on extreme pointPareto frontier(MOEA-DV/EPF)is proposed.This algorithm adopts a preprocessing rule to solve the Paretooptimal solution set of extreme points generated by simultaneous evolution in various target directions,obtainsthe basic Pareto front surface to determine the convergence effect,and analyzes the convergence and distributioneffects of decision variables.In the later stages of algorithm optimization,different mutation strategies are adoptedaccording to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals,thusenhancing the performance of the algorithm.Evaluation validation of the test functions shows that this algorithmcan solve the multi-objective optimization problem more efficiently.展开更多
Over the years, a number of methods have been proposed for the generation of uniform and globally optimal Pareto frontiers in multi-objective optimization problems. This has been the case irrespective of the problem d...Over the years, a number of methods have been proposed for the generation of uniform and globally optimal Pareto frontiers in multi-objective optimization problems. This has been the case irrespective of the problem definition. The most commonly applied methods are the normal constraint method and the normal boundary intersection method. The former suffers from the deficiency of an uneven Pareto set distribution in the case of vertical （or horizontal） sections in the Pareto frontier, whereas the latter suffers from a sparsely populated Pareto frontier when the optimization problem is numerically demanding （ill-conditioned）. The method proposed in this paper, coupled with a simple Pareto filter, addresses these two deficiencies to generate a uniform, globally optimal, well-populated Pareto frontier for any feasible bi-objective optimization problem. A number of examples are provided to demonstrate the performance of the algorithm.展开更多
The approaches to discrete approximation of Pareto front using multi-objective evolutionary algorithms have the problems of heavy computation burden, long running time and missing Pareto optimal points. In order to ov...The approaches to discrete approximation of Pareto front using multi-objective evolutionary algorithms have the problems of heavy computation burden, long running time and missing Pareto optimal points. In order to overcome these problems, an approach to continuous approximation of Pareto front using geometric support vector regression is presented. The regression model of the small size approximate discrete Pareto front is constructed by geometric support vector regression modeling and is described as the approximate continuous Pareto front. In the process of geometric support vector regression modeling, considering the distribution characteristic of Pareto optimal points, the separable augmented training sample sets are constructed by shifting original training sample points along multiple coordinated axes. Besides, an interactive decision-making(DM)procedure, in which the continuous approximation of Pareto front and decision-making is performed interactively, is designed for improving the accuracy of the preferred Pareto optimal point. The correctness of the continuous approximation of Pareto front is demonstrated with a typical multi-objective optimization problem. In addition,combined with the interactive decision-making procedure, the continuous approximation of Pareto front is applied in the multi-objective optimization for an industrial fed-batch yeast fermentation process. The experimental results show that the generated approximate continuous Pareto front has good accuracy and completeness. Compared with the multi-objective evolutionary algorithm with large size population, a more accurate preferred Pareto optimal point can be obtained from the approximate continuous Pareto front with less computation and shorter running time. The operation strategy corresponding to the final preferred Pareto optimal point generated by the interactive DM procedure can improve the production indexes of the fermentation process effectively.展开更多
Photovoltaic(PV)inverter-based volt/var control(VVC)is highly promising to tackle the emerging voltage regulation challenges brought by increasing PV penetration.However,PV inverter operational reliability has arisen ...Photovoltaic(PV)inverter-based volt/var control(VVC)is highly promising to tackle the emerging voltage regulation challenges brought by increasing PV penetration.However,PV inverter operational reliability has arisen as a critical concern for practical VVC implementation.This paper proposes a new PV inverter based VVC optimization model and a Pareto front analysis method for maintaining a satisfactory inverter lifetime.First,reliability of the vulnerable DC-link capacitor inside a PV inverter is analyzed,and long-term VVC impact on inverter operational reliability is identified.Second,a multi-objective PV inverter based VVC optimization model is proposed for minimizing both inverter apparent power output and network power loss with a weighting factor.Third,a Pareto front analysis method is developed to visualize the impact of the weighting factor on VVC performance and inverter reliability,thus determining the effective weighting factor to reduce network power loss with expected inverter lifetime.Effectiveness of the proposed VVC optimization model and Pareto front analysis method are verified in a case study.展开更多
This paper investigates a multiplayer Pareto game for affine nonlinear stochastic systems disturbed by both external and the internal multiplicative noises.The Pareto cooperative optimal strategies with the H_(∞) con...This paper investigates a multiplayer Pareto game for affine nonlinear stochastic systems disturbed by both external and the internal multiplicative noises.The Pareto cooperative optimal strategies with the H_(∞) constraint are resolved by integrating H_(2)/H_(∞) theory with Pareto game theory.First,a nonlinear stochastic bounded real lemma(SBRL)is derived,explicitly accounting for non-zero initial conditions.Through the analysis of four cross-coupled Hamilton-Jacobi equations(HJEs),we establish necessary and sufficient conditions for the existence of Pareto optimal strategies with the H_(∞) constraint.Secondly,to address the complexity of solving these nonlinear partial differential HJEs,we propose a neural network(NN)framework with synchronous tuning rules for the actor,critic,and disturbance components,based on a reinforcement learning(RL)approach.The designed tuning rules ensure convergence of the actor-critic-disturbance components to the desired values,enabling the realization of robust Pareto control strategies.The convergence of the proposed algorithm is rigorously analyzed using a constructed Lyapunov function for the NN weight errors.Finally,a numerical simulation example is provided to demonstrate the effectiveness of the proposed methods and main results.展开更多
文摘Deterministic optimization methods are combined with the Pareto front concept to solve multi-criterion design problems. The algorithm and the numerical implementation are applied to aerodynamic designs. Evolutionary algorithms （EAs） and the Pareto front concept are used to solve practical design problems in industry for its robustness in capturing convex, concave, discrete or discontinuous Pareto fronts of multi-objective optimization problems. However, the process is time-consuming. Therefore, deterministic optimization methods are introduced to capture the Pareto front, and the types of the captured Pareto front are explained. Numerical experiments show that the deterministic optimization method is a good alternative to EAs for capturing any convex and some concave Pareto fronts in multi-criterion aerodynamic optimization problems due to its efficiency.
基金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.
文摘In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized problem extends the objective-constraint problem. It is demonstrated that how adding variables to the scalarized problem, can lead to find conditions for (weakly, properly) Pareto optimal solutions. Applying the obtained necessary and sufficient conditions, two algorithms for generating the Pareto front approximation of bi-objective and three-objective programming problems are designed. These algorithms are easy to implement and can achieve an even approximation of (weakly, properly) Pareto optimal solutions. These algorithms can be generalized for optimization problems with more than three criterion functions, too. The effectiveness and capability of the algorithms are demonstrated in test problems.
基金the Liaoning Province Nature Fundation Project(2022-MS-291)the National Programme for Foreign Expert Projects(G2022006008L)+2 种基金the Basic Research Projects of Liaoning Provincial Department of Education(LJKMZ20220781,LJKMZ20220783,LJKQZ20222457)King Saud University funded this study through theResearcher Support Program Number(RSPD2023R704)King Saud University,Riyadh,Saudi Arabia.
文摘The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly focus on objectives,treating decision variables as a total variable to solve the problem without consideringthe critical role of decision variables in objective optimization.As seen,a variety of decision variable groupingalgorithms have been proposed.However,these algorithms are relatively broad for the changes of most decisionvariables in the evolution process and are time-consuming in the process of finding the Pareto frontier.To solvethese problems,a multi-objective optimization algorithm for grouping decision variables based on extreme pointPareto frontier(MOEA-DV/EPF)is proposed.This algorithm adopts a preprocessing rule to solve the Paretooptimal solution set of extreme points generated by simultaneous evolution in various target directions,obtainsthe basic Pareto front surface to determine the convergence effect,and analyzes the convergence and distributioneffects of decision variables.In the later stages of algorithm optimization,different mutation strategies are adoptedaccording to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals,thusenhancing the performance of the algorithm.Evaluation validation of the test functions shows that this algorithmcan solve the multi-objective optimization problem more efficiently.
文摘Over the years, a number of methods have been proposed for the generation of uniform and globally optimal Pareto frontiers in multi-objective optimization problems. This has been the case irrespective of the problem definition. The most commonly applied methods are the normal constraint method and the normal boundary intersection method. The former suffers from the deficiency of an uneven Pareto set distribution in the case of vertical （or horizontal） sections in the Pareto frontier, whereas the latter suffers from a sparsely populated Pareto frontier when the optimization problem is numerically demanding （ill-conditioned）. The method proposed in this paper, coupled with a simple Pareto filter, addresses these two deficiencies to generate a uniform, globally optimal, well-populated Pareto frontier for any feasible bi-objective optimization problem. A number of examples are provided to demonstrate the performance of the algorithm.
基金Supported by the National Natural Science Foundation of China(20676013,61240047)
文摘The approaches to discrete approximation of Pareto front using multi-objective evolutionary algorithms have the problems of heavy computation burden, long running time and missing Pareto optimal points. In order to overcome these problems, an approach to continuous approximation of Pareto front using geometric support vector regression is presented. The regression model of the small size approximate discrete Pareto front is constructed by geometric support vector regression modeling and is described as the approximate continuous Pareto front. In the process of geometric support vector regression modeling, considering the distribution characteristic of Pareto optimal points, the separable augmented training sample sets are constructed by shifting original training sample points along multiple coordinated axes. Besides, an interactive decision-making(DM)procedure, in which the continuous approximation of Pareto front and decision-making is performed interactively, is designed for improving the accuracy of the preferred Pareto optimal point. The correctness of the continuous approximation of Pareto front is demonstrated with a typical multi-objective optimization problem. In addition,combined with the interactive decision-making procedure, the continuous approximation of Pareto front is applied in the multi-objective optimization for an industrial fed-batch yeast fermentation process. The experimental results show that the generated approximate continuous Pareto front has good accuracy and completeness. Compared with the multi-objective evolutionary algorithm with large size population, a more accurate preferred Pareto optimal point can be obtained from the approximate continuous Pareto front with less computation and shorter running time. The operation strategy corresponding to the final preferred Pareto optimal point generated by the interactive DM procedure can improve the production indexes of the fermentation process effectively.
基金This work was supported in part by NTU Grant No.021542-00001in part by Australian Government Research Training Program Scholarship。
文摘Photovoltaic(PV)inverter-based volt/var control(VVC)is highly promising to tackle the emerging voltage regulation challenges brought by increasing PV penetration.However,PV inverter operational reliability has arisen as a critical concern for practical VVC implementation.This paper proposes a new PV inverter based VVC optimization model and a Pareto front analysis method for maintaining a satisfactory inverter lifetime.First,reliability of the vulnerable DC-link capacitor inside a PV inverter is analyzed,and long-term VVC impact on inverter operational reliability is identified.Second,a multi-objective PV inverter based VVC optimization model is proposed for minimizing both inverter apparent power output and network power loss with a weighting factor.Third,a Pareto front analysis method is developed to visualize the impact of the weighting factor on VVC performance and inverter reliability,thus determining the effective weighting factor to reduce network power loss with expected inverter lifetime.Effectiveness of the proposed VVC optimization model and Pareto front analysis method are verified in a case study.
基金supported by the National Natural Science Foundation of China(12426609,62203220,62373229)the Taishan Scholar Project Foundation of Shandong Province(tsqnz20230619,tsqn202408110)+2 种基金the Fundamental Research Foundation of the Central Universities(23Cx06024A)the Natural Science Foundation of Shandong Province(ZR2024QF096)the Outstanding Youth Innovation Team in Shandong Higher Education Institutions(2023KJ061).
文摘This paper investigates a multiplayer Pareto game for affine nonlinear stochastic systems disturbed by both external and the internal multiplicative noises.The Pareto cooperative optimal strategies with the H_(∞) constraint are resolved by integrating H_(2)/H_(∞) theory with Pareto game theory.First,a nonlinear stochastic bounded real lemma(SBRL)is derived,explicitly accounting for non-zero initial conditions.Through the analysis of four cross-coupled Hamilton-Jacobi equations(HJEs),we establish necessary and sufficient conditions for the existence of Pareto optimal strategies with the H_(∞) constraint.Secondly,to address the complexity of solving these nonlinear partial differential HJEs,we propose a neural network(NN)framework with synchronous tuning rules for the actor,critic,and disturbance components,based on a reinforcement learning(RL)approach.The designed tuning rules ensure convergence of the actor-critic-disturbance components to the desired values,enabling the realization of robust Pareto control strategies.The convergence of the proposed algorithm is rigorously analyzed using a constructed Lyapunov function for the NN weight errors.Finally,a numerical simulation example is provided to demonstrate the effectiveness of the proposed methods and main results.
