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.展开更多
In multimodal multiobjective optimization problems(MMOPs),there are several Pareto optimal solutions corre-sponding to the identical objective vector.This paper proposes a new differential evolution algorithm to solve...In multimodal multiobjective optimization problems(MMOPs),there are several Pareto optimal solutions corre-sponding to the identical objective vector.This paper proposes a new differential evolution algorithm to solve MMOPs with higher-dimensional decision variables.Due to the increase in the dimensions of decision variables in real-world MMOPs,it is diffi-cult for current multimodal multiobjective optimization evolu-tionary algorithms(MMOEAs)to find multiple Pareto optimal solutions.The proposed algorithm adopts a dual-population framework and an improved environmental selection method.It utilizes a convergence archive to help the first population improve the quality of solutions.The improved environmental selection method enables the other population to search the remaining decision space and reserve more Pareto optimal solutions through the information of the first population.The combination of these two strategies helps to effectively balance and enhance conver-gence and diversity performance.In addition,to study the per-formance of the proposed algorithm,a novel set of multimodal multiobjective optimization test functions with extensible decision variables is designed.The proposed MMOEA is certified to be effective through comparison with six state-of-the-art MMOEAs on the test functions.展开更多
This paper introduces a novel variant of particle swarm optimization that leverages local displacements through attractors for addressing multiobjective optimization problems. The method incorporates a square root dis...This paper introduces a novel variant of particle swarm optimization that leverages local displacements through attractors for addressing multiobjective optimization problems. The method incorporates a square root distance mechanism into the external archives to enhance the diversity. We evaluate the performance of the proposed approach on a set of constrained and unconstrained multiobjective test functions, establishing a benchmark for comparison. In order to gauge its effectiveness relative to established techniques, we conduct a comprehensive comparison with well-known approaches such as SMPSO, NSGA2 and SPEA2. The numerical results demonstrate that our method not only achieves efficiency but also exhibits competitiveness when compared to evolutionary algorithms. Particularly noteworthy is its superior performance in terms of convergence and diversification, surpassing the capabilities of its predecessors.展开更多
In this paper, a new approach for generating all or partly efficient solutions called the Combined Approach is developed. The property of efficient solutions generated by the combined approach and its relationships wi...In this paper, a new approach for generating all or partly efficient solutions called the Combined Approach is developed. The property of efficient solutions generated by the combined approach and its relationships with other four approaches: weighting approach, sequential approach, ε-constraint approach and hybrid approach, are discussed. Based on this combined approach, a decision-making support method called the Combined Decision-Making Method (CDMM) for multiobjective problems is developed, which is an interactive process with the decision maker. Only the aspiration levels, which reflect the decision maker's satisfying degrees for corresponding objectives, are needed to be supplied by the decision maker step by step as he will. This interactive way for objectives can easily be accepted. Finally, the application of the proposed decision making method in the resource allocation problem is discussed, and an example for the production decision analysis of the solar energy cells given.展开更多
In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficie...In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficient solutions of the same multiobjectiveprogramming problem, but the converse is not true. In a ceratin sense , these solutionsare in fact better than any other Pareto efficient solutions. Some basic theorems whichcharacterize major-efficient solutions and weakly major-efficient solutions of multiobjective programming are stated and proved. Furthermore,the existence and some geometricproperties of these solutions are studied.展开更多
A class of quasi-equilibrium problems and a class of constrained multiobjective games were introduced and studied in generalized convex spaces without linear structure. First, two existence theorems of solutions for q...A class of quasi-equilibrium problems and a class of constrained multiobjective games were introduced and studied in generalized convex spaces without linear structure. First, two existence theorems of solutions for quasi-equilibrium problems are proved in noncompact generalized convex spaces. Then, ar applications of the quasi-equilibrium existence theorem, several existence theorems of weighted Nash-equilibria and Pareto equilibria for the constrained multiobjective games are established in noncompact generalized convex spaces. These theorems improve, unify, and generalize the corresponding results of the multiobjective games in recent literatures.展开更多
The multitrip pickup and delivery problem with time windows and manpower planning(MTPDPTW-MP)determines a set of ambulance routes and finds staff assignment for a hospital. It involves different stakeholders with dive...The multitrip pickup and delivery problem with time windows and manpower planning(MTPDPTW-MP)determines a set of ambulance routes and finds staff assignment for a hospital. It involves different stakeholders with diverse interests and objectives. This study firstly introduces a multiobjective MTPDPTW-MP(MO-MTPDPTWMP) with three objectives to better describe the real-world scenario. A multiobjective iterated local search algorithm with adaptive neighborhood selection(MOILS-ANS) is proposed to solve the problem. MOILS-ANS can generate a diverse set of alternative solutions for decision makers to meet their requirements. To better explore the search space, problem-specific neighborhood structures and an adaptive neighborhood selection strategy are carefully designed in MOILS-ANS. Experimental results show that the proposed MOILS-ANS significantly outperforms the other two multiobjective algorithms. Besides, the nature of objective functions and the properties of the problem are analyzed. Finally, the proposed MOILS-ANS is compared with the previous single-objective algorithm and the benefits of multiobjective optimization are discussed.展开更多
In industrial amine plants the optimized operating conditions are obtained from the conclusion of occurred events and challenges that are normal in the working units. For the sake of reducing the costs, time consuming...In industrial amine plants the optimized operating conditions are obtained from the conclusion of occurred events and challenges that are normal in the working units. For the sake of reducing the costs, time consuming, and preventing unsuitable accidents, the optimization could be performed by a computer program. In this paper, simulation and parameter analysis of amine plant is performed at first. The optimization of this unit is studied using Non-Dominated Sorting Genetic Algorithm-II in order to produce sweet gas with CO 2 mole percentage less than 2.0% and H 2 S concentration less than 10 ppm for application in Fischer-Tropsch synthesis. The simulation of the plant in HYSYS v.3.1 software has been linked with MATLAB code for real-parameter NSGA-II to simulate and optimize the amine process. Three scenarios are selected to cover the effect of (DEA/MDEA) mass composition percent ratio at amine solution on objective functions. Results show that sour gas temperature and pressure of 33.98 ? C and 14.96 bar, DEA/CO 2 molar flow ratio of 12.58, regeneration gas temperature and pressure of 94.92 ? C and 3.0 bar, regenerator pressure of 1.53 bar, and ratio of DEA/MDEA = 20%/10% are the best values for minimizing plant energy consumption, amine circulation rate, and carbon dioxide recovery.展开更多
Resource allocation (RA) is the problem of allocating resources among various artifacts or business units to meet one or more expected goals, such a.s maximizing the profits, minimizing the costs, or achieving the b...Resource allocation (RA) is the problem of allocating resources among various artifacts or business units to meet one or more expected goals, such a.s maximizing the profits, minimizing the costs, or achieving the best qualities. A complex multiobjective RA is addressed, and a multiobjective mathematical model is used to find solutions efficiently. Then, all improved particie swarm algorithm (mO_PSO) is proposed combined with a new particle diversity controller policies and dissipation operation. Meanwhile, a modified Pareto methods used in PSO to deal with multiobjectives optimization is presented. The effectiveness of the provided algorithm is validated by its application to some illustrative example dealing with multiobjective RA problems and with the comparative experiment with other algorithm.展开更多
Owing to the rapid development of microgrids(MGs)and growing applications of renewable energy resources,multiobjective optimal dispatch of MGs need to be studied in detail.In this study,a multiobjective optimal dispat...Owing to the rapid development of microgrids(MGs)and growing applications of renewable energy resources,multiobjective optimal dispatch of MGs need to be studied in detail.In this study,a multiobjective optimal dispatch model is developed for a standalone MG composed of wind turbines,photovoltaics,diesel engine unit,load,and battery energy storage system.The economic cost,environmental concerns,and power supply consistency are expressed via subobjectives with varying priorities.Then,the analytic hierarchy process algorithm is employed to reasonably specify the weight coefficients of the subobjectives.The quantum particle swarm optimization algorithm is thereafter employed as a solution to achieve optimal dispatch of the MG.Finally,the validity of the proposed model and solution methodology are con firmed by case studies.This study provides refere nee for mathematical model of multiojective optimizati on of MG and can be widely used in current research field.展开更多
An application of the multiobjective fault detection and isolation(FDI) approach to an air-breathing hypersonic vehicle(HSV) longitudinal dynamics subject to disturbances is presented.Maintaining sustainable and s...An application of the multiobjective fault detection and isolation(FDI) approach to an air-breathing hypersonic vehicle(HSV) longitudinal dynamics subject to disturbances is presented.Maintaining sustainable and safe flight of HSV is a challenging task due to its strong coupling effects,variable operating conditions and possible failures of system components.A common type of system faults for aircraft including HSV is the loss of effectiveness of its actuators and sensors.To detect and isolate multiple actuator/sensor failures,a faulty linear parameter-varying(LPV) model of HSV is derived by converting actuator/system component faults into equivalent sensor faults.Then a bank of LPV FDI observers is designed to track individual fault with minimum error and suppress the effects of disturbances and other fault signals.The simulation results based on the nonlinear flexible HSV model and a nominal LPV controller demonstrate the effectiveness of the fault estimation technique for HSV.展开更多
This article presents a multiobjective approach to the design of the controller for the swing-up and handstand control of a general cart-double-pendulum system (CDPS). The designed controller, which is based on the ...This article presents a multiobjective approach to the design of the controller for the swing-up and handstand control of a general cart-double-pendulum system (CDPS). The designed controller, which is based on the human-simulated intelligent control (HSIC) method, builds up different control modes to monitor and control the CDPS during four kinetic phases consisting of an initial oscillation phase, a swing-up phase, a posture adjustment phase, and a balance control phase. For the approach, the original method of inequalities-based (MoI) multiobjective genetic algorithm (MMGA) is extended and applied to the case study which uses a set of performance indices that includes the cart displacement over the rail boundary, the number of swings, the settling time, the overshoot of the total energy, and the control effort. The simulation results show good responses of the CDPS with the controllers obtained by the proposed approach.展开更多
At present,most researches on the critical rainfall threshold of debris flow initiation use a linear model obtained through regression.With relatively weak fault tolerance,this method not only ignores nonlinear effect...At present,most researches on the critical rainfall threshold of debris flow initiation use a linear model obtained through regression.With relatively weak fault tolerance,this method not only ignores nonlinear effects but also is susceptible to singular noise samples,which makes it difficult to characterize the true quantization relationship of the rainfall threshold.Besides,the early warning threshold determined by statistical parameters is susceptible to negative samples(samples where no debris flow has occurred),which leads to uncertainty in the reliability of the early warning results by the regression curve.To overcome the above limitations,this study develops a data-driven multiobjective evolutionary optimization method that combines an artificial neural network(ANN)and a multiobjective evolutionary optimization implemented by particle swarm optimization(PSO).Firstly,the Pareto optimality method is used to represent the nonlinear and conflicting critical thresholds for the rainfall intensity I and the rainfall duration D.An ANN is used to construct a dual-target(dual-task)predictive surrogate model,and then a PSO-based multiobjective evolutionary optimization algorithm is applied to train the ANN and stochastically search the trained ANN for obtaining the Pareto front of the I-D surrogate prediction model,which is intended to overcome the limitations of the existing linear regression-based threshold methods.Finally,a double early warning curve model that can effectively control the false alarm rate and negative alarm rate of hazard warnings are proposed based on the decision space and target space maps.This study provides theoretical guidance for the early warning and forecasting of debris flows and has strong applicability.展开更多
New classes of functions namely (V, ρ)_(h,φ)-type I, quasi (V, ρ)_(h,φ)-type I and pseudo (V, ρ)_(h,φ)-type I functions are defined for multiobjective programming problem by using BenTal's generalized algebr...New classes of functions namely (V, ρ)_(h,φ)-type I, quasi (V, ρ)_(h,φ)-type I and pseudo (V, ρ)_(h,φ)-type I functions are defined for multiobjective programming problem by using BenTal's generalized algebraic operation. The examples of (V, ρ)_(h,φ)-type I functions are given. The sufficient optimality conditions are obtained for multi-objective programming problem involving above new generalized convexity.展开更多
Recently,multimodal multiobjective optimization problems(MMOPs)have received increasing attention.Their goal is to find a Pareto front and as many equivalent Pareto optimal solutions as possible.Although some evolutio...Recently,multimodal multiobjective optimization problems(MMOPs)have received increasing attention.Their goal is to find a Pareto front and as many equivalent Pareto optimal solutions as possible.Although some evolutionary algorithms for them have been proposed,they mainly focus on the convergence rate in the decision space while ignoring solutions diversity.In this paper,we propose a new multiobjective fireworks algorithm for them,which is able to balance exploitation and exploration in the decision space.We first extend a latest single-objective fireworks algorithm to handle MMOPs.Then we make improvements by incorporating an adaptive strategy and special archive guidance into it,where special archives are established for each firework,and two strategies(i.e.,explosion and random strategies)are adaptively selected to update the positions of sparks generated by fireworks with the guidance of special archives.Finally,we compare the proposed algorithm with eight state-of-the-art multimodal multiobjective algorithms on all 22 MMOPs from CEC2019 and several imbalanced distance minimization problems.Experimental results show that the proposed algorithm is superior to compared algorithms in solving them.Also,its runtime is less than its peers'.展开更多
A new concept of(Φ,ρ,α)-V-invexity for differentiable vector-valued functions is introduced,which is a generalization of differentiable scalar-valued(Φ,ρ)-invexity.Based upon the(Φ,ρ,α)-V-invex functions,suffi...A new concept of(Φ,ρ,α)-V-invexity for differentiable vector-valued functions is introduced,which is a generalization of differentiable scalar-valued(Φ,ρ)-invexity.Based upon the(Φ,ρ,α)-V-invex functions,sufficient optimality conditions and MondWeir type dual theorems are derived for a class of nondifferentiable multiobjective fractional programming problems in which every component of the objective function and each constraint function contain a term involving the support function of a compact convex set.展开更多
In this paper, we obtain some other properties of the majorly efficient points and solutions of the multiobjective optimization presellted in two previous papers of Hu. By decomposing the major cone, which is non-poin...In this paper, we obtain some other properties of the majorly efficient points and solutions of the multiobjective optimization presellted in two previous papers of Hu. By decomposing the major cone, which is non-pointed, non-convex and non-closed into a finite union of disjoint strictly supported pointed convex cones, we discuss the continuous perturbations of the decision space. Several sufficient conditions for the continuity of the sets of majorly efficiellt points and solutions are given.展开更多
A new class of generalized constrained multiobjective games is introduced and studied in locally FC-uniform spaces without convexity structure where the number of players may be finite or infinite and all payoff funct...A new class of generalized constrained multiobjective games is introduced and studied in locally FC-uniform spaces without convexity structure where the number of players may be finite or infinite and all payoff functions get their values in an infinite-dimensional space. By using a Himmelberg type fixed point theorem in locally FC-uniform spaces due to author, some existence theorems of weak Paxeto equilibria for the generalized constrained multiobjective games are established in locally FC-uniform spaces. These theorems improve, unify and generalize the corresponding results in recent literatures.展开更多
In this paper, the diversity information included by dominating number is analyzed, and the probabilistic relationship between dominating number and diversity in the space of objective function is proved. A ranking me...In this paper, the diversity information included by dominating number is analyzed, and the probabilistic relationship between dominating number and diversity in the space of objective function is proved. A ranking method based on dominating number is proposed to build the Pareto front. Without increasing basic Pareto method’s computation complexity and introducing new parameters, a new multiobjective genetic algorithm based on proposed ranking method (MOGA-DN) is presented. Simulation results on function optimization and parameters optimization of control system verify the efficiency of MOGA-DN.展开更多
This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators ...This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of (F, α, ρ, d)-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.展开更多
文摘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.
基金supported in part by National Natural Science Foundation of China(62106230,U23A20340,62376253,62176238)China Postdoctoral Science Foundation(2023M743185)Key Laboratory of Big Data Intelligent Computing,Chongqing University of Posts and Telecommunications Open Fundation(BDIC-2023-A-007)。
文摘In multimodal multiobjective optimization problems(MMOPs),there are several Pareto optimal solutions corre-sponding to the identical objective vector.This paper proposes a new differential evolution algorithm to solve MMOPs with higher-dimensional decision variables.Due to the increase in the dimensions of decision variables in real-world MMOPs,it is diffi-cult for current multimodal multiobjective optimization evolu-tionary algorithms(MMOEAs)to find multiple Pareto optimal solutions.The proposed algorithm adopts a dual-population framework and an improved environmental selection method.It utilizes a convergence archive to help the first population improve the quality of solutions.The improved environmental selection method enables the other population to search the remaining decision space and reserve more Pareto optimal solutions through the information of the first population.The combination of these two strategies helps to effectively balance and enhance conver-gence and diversity performance.In addition,to study the per-formance of the proposed algorithm,a novel set of multimodal multiobjective optimization test functions with extensible decision variables is designed.The proposed MMOEA is certified to be effective through comparison with six state-of-the-art MMOEAs on the test functions.
文摘This paper introduces a novel variant of particle swarm optimization that leverages local displacements through attractors for addressing multiobjective optimization problems. The method incorporates a square root distance mechanism into the external archives to enhance the diversity. We evaluate the performance of the proposed approach on a set of constrained and unconstrained multiobjective test functions, establishing a benchmark for comparison. In order to gauge its effectiveness relative to established techniques, we conduct a comprehensive comparison with well-known approaches such as SMPSO, NSGA2 and SPEA2. The numerical results demonstrate that our method not only achieves efficiency but also exhibits competitiveness when compared to evolutionary algorithms. Particularly noteworthy is its superior performance in terms of convergence and diversification, surpassing the capabilities of its predecessors.
文摘In this paper, a new approach for generating all or partly efficient solutions called the Combined Approach is developed. The property of efficient solutions generated by the combined approach and its relationships with other four approaches: weighting approach, sequential approach, ε-constraint approach and hybrid approach, are discussed. Based on this combined approach, a decision-making support method called the Combined Decision-Making Method (CDMM) for multiobjective problems is developed, which is an interactive process with the decision maker. Only the aspiration levels, which reflect the decision maker's satisfying degrees for corresponding objectives, are needed to be supplied by the decision maker step by step as he will. This interactive way for objectives can easily be accepted. Finally, the application of the proposed decision making method in the resource allocation problem is discussed, and an example for the production decision analysis of the solar energy cells given.
文摘In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficient solutions of the same multiobjectiveprogramming problem, but the converse is not true. In a ceratin sense , these solutionsare in fact better than any other Pareto efficient solutions. Some basic theorems whichcharacterize major-efficient solutions and weakly major-efficient solutions of multiobjective programming are stated and proved. Furthermore,the existence and some geometricproperties of these solutions are studied.
文摘A class of quasi-equilibrium problems and a class of constrained multiobjective games were introduced and studied in generalized convex spaces without linear structure. First, two existence theorems of solutions for quasi-equilibrium problems are proved in noncompact generalized convex spaces. Then, ar applications of the quasi-equilibrium existence theorem, several existence theorems of weighted Nash-equilibria and Pareto equilibria for the constrained multiobjective games are established in noncompact generalized convex spaces. These theorems improve, unify, and generalize the corresponding results of the multiobjective games in recent literatures.
基金supported by the National Key R&D Program of China(2018AAA0101203)the National Natural Science Foundation of China(61673403,71601191)the JSPS KAKENHI(JP17K12751)。
文摘The multitrip pickup and delivery problem with time windows and manpower planning(MTPDPTW-MP)determines a set of ambulance routes and finds staff assignment for a hospital. It involves different stakeholders with diverse interests and objectives. This study firstly introduces a multiobjective MTPDPTW-MP(MO-MTPDPTWMP) with three objectives to better describe the real-world scenario. A multiobjective iterated local search algorithm with adaptive neighborhood selection(MOILS-ANS) is proposed to solve the problem. MOILS-ANS can generate a diverse set of alternative solutions for decision makers to meet their requirements. To better explore the search space, problem-specific neighborhood structures and an adaptive neighborhood selection strategy are carefully designed in MOILS-ANS. Experimental results show that the proposed MOILS-ANS significantly outperforms the other two multiobjective algorithms. Besides, the nature of objective functions and the properties of the problem are analyzed. Finally, the proposed MOILS-ANS is compared with the previous single-objective algorithm and the benefits of multiobjective optimization are discussed.
文摘In industrial amine plants the optimized operating conditions are obtained from the conclusion of occurred events and challenges that are normal in the working units. For the sake of reducing the costs, time consuming, and preventing unsuitable accidents, the optimization could be performed by a computer program. In this paper, simulation and parameter analysis of amine plant is performed at first. The optimization of this unit is studied using Non-Dominated Sorting Genetic Algorithm-II in order to produce sweet gas with CO 2 mole percentage less than 2.0% and H 2 S concentration less than 10 ppm for application in Fischer-Tropsch synthesis. The simulation of the plant in HYSYS v.3.1 software has been linked with MATLAB code for real-parameter NSGA-II to simulate and optimize the amine process. Three scenarios are selected to cover the effect of (DEA/MDEA) mass composition percent ratio at amine solution on objective functions. Results show that sour gas temperature and pressure of 33.98 ? C and 14.96 bar, DEA/CO 2 molar flow ratio of 12.58, regeneration gas temperature and pressure of 94.92 ? C and 3.0 bar, regenerator pressure of 1.53 bar, and ratio of DEA/MDEA = 20%/10% are the best values for minimizing plant energy consumption, amine circulation rate, and carbon dioxide recovery.
基金the National Natural Science Foundation of China (60573159)
文摘Resource allocation (RA) is the problem of allocating resources among various artifacts or business units to meet one or more expected goals, such a.s maximizing the profits, minimizing the costs, or achieving the best qualities. A complex multiobjective RA is addressed, and a multiobjective mathematical model is used to find solutions efficiently. Then, all improved particie swarm algorithm (mO_PSO) is proposed combined with a new particle diversity controller policies and dissipation operation. Meanwhile, a modified Pareto methods used in PSO to deal with multiobjectives optimization is presented. The effectiveness of the provided algorithm is validated by its application to some illustrative example dealing with multiobjective RA problems and with the comparative experiment with other algorithm.
基金State Grid Corporation Science and Technology Project(520605190010).
文摘Owing to the rapid development of microgrids(MGs)and growing applications of renewable energy resources,multiobjective optimal dispatch of MGs need to be studied in detail.In this study,a multiobjective optimal dispatch model is developed for a standalone MG composed of wind turbines,photovoltaics,diesel engine unit,load,and battery energy storage system.The economic cost,environmental concerns,and power supply consistency are expressed via subobjectives with varying priorities.Then,the analytic hierarchy process algorithm is employed to reasonably specify the weight coefficients of the subobjectives.The quantum particle swarm optimization algorithm is thereafter employed as a solution to achieve optimal dispatch of the MG.Finally,the validity of the proposed model and solution methodology are con firmed by case studies.This study provides refere nee for mathematical model of multiojective optimizati on of MG and can be widely used in current research field.
文摘An application of the multiobjective fault detection and isolation(FDI) approach to an air-breathing hypersonic vehicle(HSV) longitudinal dynamics subject to disturbances is presented.Maintaining sustainable and safe flight of HSV is a challenging task due to its strong coupling effects,variable operating conditions and possible failures of system components.A common type of system faults for aircraft including HSV is the loss of effectiveness of its actuators and sensors.To detect and isolate multiple actuator/sensor failures,a faulty linear parameter-varying(LPV) model of HSV is derived by converting actuator/system component faults into equivalent sensor faults.Then a bank of LPV FDI observers is designed to track individual fault with minimum error and suppress the effects of disturbances and other fault signals.The simulation results based on the nonlinear flexible HSV model and a nominal LPV controller demonstrate the effectiveness of the fault estimation technique for HSV.
基金supported by the National Science Council, Taiwan(No. 96-2221-E-327-027, No. 96-2221-E-327-005-MY2, and No. 96-2628-E-327-004-MY3).
文摘This article presents a multiobjective approach to the design of the controller for the swing-up and handstand control of a general cart-double-pendulum system (CDPS). The designed controller, which is based on the human-simulated intelligent control (HSIC) method, builds up different control modes to monitor and control the CDPS during four kinetic phases consisting of an initial oscillation phase, a swing-up phase, a posture adjustment phase, and a balance control phase. For the approach, the original method of inequalities-based (MoI) multiobjective genetic algorithm (MMGA) is extended and applied to the case study which uses a set of performance indices that includes the cart displacement over the rail boundary, the number of swings, the settling time, the overshoot of the total energy, and the control effort. The simulation results show good responses of the CDPS with the controllers obtained by the proposed approach.
基金financially supported by the Second Tibetan Plateau Scientific Expedition and Research Program(STEP)(No.2019QZKK0906)National Natural Science Foundation of China(No.41901008 and No.61976046)+3 种基金National Key R&D Program of China(No.2017YFC1502504)the Fundamental Research Funds for the Central Universities(Grant No.2682018CX05)Beijing Municipal Science and Technology Project(Z191100001419015)financially supported by the China Scholarship Council。
文摘At present,most researches on the critical rainfall threshold of debris flow initiation use a linear model obtained through regression.With relatively weak fault tolerance,this method not only ignores nonlinear effects but also is susceptible to singular noise samples,which makes it difficult to characterize the true quantization relationship of the rainfall threshold.Besides,the early warning threshold determined by statistical parameters is susceptible to negative samples(samples where no debris flow has occurred),which leads to uncertainty in the reliability of the early warning results by the regression curve.To overcome the above limitations,this study develops a data-driven multiobjective evolutionary optimization method that combines an artificial neural network(ANN)and a multiobjective evolutionary optimization implemented by particle swarm optimization(PSO).Firstly,the Pareto optimality method is used to represent the nonlinear and conflicting critical thresholds for the rainfall intensity I and the rainfall duration D.An ANN is used to construct a dual-target(dual-task)predictive surrogate model,and then a PSO-based multiobjective evolutionary optimization algorithm is applied to train the ANN and stochastically search the trained ANN for obtaining the Pareto front of the I-D surrogate prediction model,which is intended to overcome the limitations of the existing linear regression-based threshold methods.Finally,a double early warning curve model that can effectively control the false alarm rate and negative alarm rate of hazard warnings are proposed based on the decision space and target space maps.This study provides theoretical guidance for the early warning and forecasting of debris flows and has strong applicability.
基金Supported by the NSF of Shaanxi Provincial Educational Department(06JK152)
文摘New classes of functions namely (V, ρ)_(h,φ)-type I, quasi (V, ρ)_(h,φ)-type I and pseudo (V, ρ)_(h,φ)-type I functions are defined for multiobjective programming problem by using BenTal's generalized algebraic operation. The examples of (V, ρ)_(h,φ)-type I functions are given. The sufficient optimality conditions are obtained for multi-objective programming problem involving above new generalized convexity.
基金supported in part by the National Natural Science Foundation of China(62071230,62061146002)the Natural Science Foundation of Jiangsu Province(BK20211567)the Deanship of Scientific Research(DSR)at King Abdulaziz University(KAU),Jeddah,Saudi Arabia(FP-147-43)。
文摘Recently,multimodal multiobjective optimization problems(MMOPs)have received increasing attention.Their goal is to find a Pareto front and as many equivalent Pareto optimal solutions as possible.Although some evolutionary algorithms for them have been proposed,they mainly focus on the convergence rate in the decision space while ignoring solutions diversity.In this paper,we propose a new multiobjective fireworks algorithm for them,which is able to balance exploitation and exploration in the decision space.We first extend a latest single-objective fireworks algorithm to handle MMOPs.Then we make improvements by incorporating an adaptive strategy and special archive guidance into it,where special archives are established for each firework,and two strategies(i.e.,explosion and random strategies)are adaptively selected to update the positions of sparks generated by fireworks with the guidance of special archives.Finally,we compare the proposed algorithm with eight state-of-the-art multimodal multiobjective algorithms on all 22 MMOPs from CEC2019 and several imbalanced distance minimization problems.Experimental results show that the proposed algorithm is superior to compared algorithms in solving them.Also,its runtime is less than its peers'.
基金National Natural Science Foundation of China(No.11071110)
文摘A new concept of(Φ,ρ,α)-V-invexity for differentiable vector-valued functions is introduced,which is a generalization of differentiable scalar-valued(Φ,ρ)-invexity.Based upon the(Φ,ρ,α)-V-invex functions,sufficient optimality conditions and MondWeir type dual theorems are derived for a class of nondifferentiable multiobjective fractional programming problems in which every component of the objective function and each constraint function contain a term involving the support function of a compact convex set.
文摘In this paper, we obtain some other properties of the majorly efficient points and solutions of the multiobjective optimization presellted in two previous papers of Hu. By decomposing the major cone, which is non-pointed, non-convex and non-closed into a finite union of disjoint strictly supported pointed convex cones, we discuss the continuous perturbations of the decision space. Several sufficient conditions for the continuity of the sets of majorly efficiellt points and solutions are given.
基金the Natural Science Foundation of Education Department of Sichuan Province of China(No.07ZA092)the Foundation of Taiwan Science Council
文摘A new class of generalized constrained multiobjective games is introduced and studied in locally FC-uniform spaces without convexity structure where the number of players may be finite or infinite and all payoff functions get their values in an infinite-dimensional space. By using a Himmelberg type fixed point theorem in locally FC-uniform spaces due to author, some existence theorems of weak Paxeto equilibria for the generalized constrained multiobjective games are established in locally FC-uniform spaces. These theorems improve, unify and generalize the corresponding results in recent literatures.
基金supported by the Academic Outstanding Youth Talented Person Fund of Anhui Province (No.2009SQR2014)
文摘In this paper, the diversity information included by dominating number is analyzed, and the probabilistic relationship between dominating number and diversity in the space of objective function is proved. A ranking method based on dominating number is proposed to build the Pareto front. Without increasing basic Pareto method’s computation complexity and introducing new parameters, a new multiobjective genetic algorithm based on proposed ranking method (MOGA-DN) is presented. Simulation results on function optimization and parameters optimization of control system verify the efficiency of MOGA-DN.
基金Supported by Chongqing Key Lab. of Operations Research and System Engineering
文摘This paper studies a class of multiobjective generalized fractional programming problems, where the numerators of objective functions are the sum of differentiable function and convex function, while the denominators are the difference of differentiable function and convex function. Under the assumption of Calmness Constraint Qualification the Kuhn-Tucker type necessary conditions for efficient solution are given, and the Kuhn-Tucker type sufficient conditions for efficient solution are presented under the assumptions of (F, α, ρ, d)-V-convexity. Subsequently, the optimality conditions for two kinds of duality models are formulated and duality theorems are proved.