Constrained multi-objective optimization problems(CMOPs) include the optimization of objective functions and the satisfaction of constraint conditions, which challenge the solvers.To solve CMOPs, constrained multi-obj...Constrained multi-objective optimization problems(CMOPs) include the optimization of objective functions and the satisfaction of constraint conditions, which challenge the solvers.To solve CMOPs, constrained multi-objective evolutionary algorithms(CMOEAs) have been developed. However, most of them tend to converge into local areas due to the loss of diversity. Evolutionary multitasking(EMT) is new model of solving complex optimization problems, through the knowledge transfer between the source task and other related tasks. Inspired by EMT, this paper develops a new EMT-based CMOEA to solve CMOPs, in which the main task, a global auxiliary task, and a local auxiliary task are created and optimized by one specific population respectively. The main task focuses on finding the feasible Pareto front(PF), and global and local auxiliary tasks are used to respectively enhance global and local diversity. Moreover, the global auxiliary task is used to implement the global search by ignoring constraints, so as to help the population of the main task pass through infeasible obstacles. The local auxiliary task is used to provide local diversity around the population of the main task, so as to exploit promising regions. Through the knowledge transfer among the three tasks, the search ability of the population of the main task will be significantly improved. Compared with other state-of-the-art CMOEAs, the experimental results on three benchmark test suites demonstrate the superior or competitive performance of the proposed CMOEA.展开更多
In recent years, a large number of approaches to constrained multi-objective optimization problems(CMOPs) have been proposed, focusing on developing tweaked strategies and techniques for handling constraints. However,...In recent years, a large number of approaches to constrained multi-objective optimization problems(CMOPs) have been proposed, focusing on developing tweaked strategies and techniques for handling constraints. However, an overly finetuned strategy or technique might overfit some problem types,resulting in a lack of versatility. In this article, we propose a generic search strategy that performs an even search in a promising region. The promising region, determined by obtained feasible non-dominated solutions, possesses two general properties.First, the constrained Pareto front(CPF) is included in the promising region. Second, as the number of feasible solutions increases or the convergence performance(i.e., approximation to the CPF) of these solutions improves, the promising region shrinks. Then we develop a new strategy named even search,which utilizes the non-dominated solutions to accelerate convergence and escape from local optima, and the feasible solutions under a constraint relaxation condition to exploit and detect feasible regions. Finally, a diversity measure is adopted to make sure that the individuals in the population evenly cover the valuable areas in the promising region. Experimental results on 45 instances from four benchmark test suites and 14 real-world CMOPs have demonstrated that searching evenly in the promising region can achieve competitive performance and excellent versatility compared to 11 most state-of-the-art methods tailored for CMOPs.展开更多
A constrained multi-objective biogeography-based optimization algorithm （CMBOA） was proposed to solve robot path planning （RPP）. For RPP, the length and smoothness of path were taken as the optimization objectives...A constrained multi-objective biogeography-based optimization algorithm （CMBOA） was proposed to solve robot path planning （RPP）. For RPP, the length and smoothness of path were taken as the optimization objectives, and the distance from the obstacles was constraint. In CMBOA, a new migration operator with disturbance factor was designed and applied to the feasible population to generate many more non-dominated feasible individuals; meanwhile, some infeasible individuals nearby feasible region were recombined with the nearest feasible ones to approach the feasibility. Compared with classical multi-objective evolutionary algorithms, the current study indicates that CM- BOA has better performance for RPP.展开更多
Constrained multi-objective optimization problems(CMOPs)generally contain multiple constraints,which not only form multiple discrete feasible regions but also reduce the size of optimal feasible regions,thus they prop...Constrained multi-objective optimization problems(CMOPs)generally contain multiple constraints,which not only form multiple discrete feasible regions but also reduce the size of optimal feasible regions,thus they propose serious challenges for solvers.Among all constraints,some constraints are highly correlated with optimal feasible regions;thus they can provide effective help to find feasible Pareto front.However,most of the existing constrained multi-objective evolutionary algorithms tackle constraints by regarding all constraints as a whole or directly ignoring all constraints,and do not consider judging the relations among constraints and do not utilize the information from promising single constraints.Therefore,this paper attempts to identify promising single constraints and utilize them to help solve CMOPs.To be specific,a CMOP is transformed into a multitasking optimization problem,where multiple auxiliary tasks are created to search for the Pareto fronts that only consider a single constraint respectively.Besides,an auxiliary task priority method is designed to identify and retain some high-related auxiliary tasks according to the information of relative positions and dominance relationships.Moreover,an improved tentative method is designed to find and transfer useful knowledge among tasks.Experimental results on three benchmark test suites and 11 realworld problems with different numbers of constraints show better or competitive performance of the proposed method when compared with eight state-of-the-art peer methods.展开更多
This work investigates one immune optimization approach for dynamic constrained multi-objective multimodal optimization in terms of biological immune inspirations and the concept of constraint dominance. Such approach...This work investigates one immune optimization approach for dynamic constrained multi-objective multimodal optimization in terms of biological immune inspirations and the concept of constraint dominance. Such approach includes mainly three functional modules, environmental detection, population initialization and immune evolution. The first, inspired by the function of immune surveillance, is designed to detect the change of such kind of problem and to decide the type of a new environment;the second generates an initial population for the current environment, relying upon the result of detection;the last evolves two sub-populations along multiple directions and searches those excellent and diverse candidates. Experimental results show that the proposed approach can adaptively track the environmental change and effectively find the global Pareto-optimal front in each environment.展开更多
Solving constrained multi-objective optimization problems with evolutionary algorithms has attracted considerable attention.Various constrained multi-objective optimization evolutionary algorithms(CMOEAs)have been dev...Solving constrained multi-objective optimization problems with evolutionary algorithms has attracted considerable attention.Various constrained multi-objective optimization evolutionary algorithms(CMOEAs)have been developed with the use of different algorithmic strategies,evolutionary operators,and constraint-handling techniques.The performance of CMOEAs may be heavily dependent on the operators used,however,it is usually difficult to select suitable operators for the problem at hand.Hence,improving operator selection is promising and necessary for CMOEAs.This work proposes an online operator selection framework assisted by Deep Reinforcement Learning.The dynamics of the population,including convergence,diversity,and feasibility,are regarded as the state;the candidate operators are considered as actions;and the improvement of the population state is treated as the reward.By using a Q-network to learn a policy to estimate the Q-values of all actions,the proposed approach can adaptively select an operator that maximizes the improvement of the population according to the current state and thereby improve the algorithmic performance.The framework is embedded into four popular CMOEAs and assessed on 42 benchmark problems.The experimental results reveal that the proposed Deep Reinforcement Learning-assisted operator selection significantly improves the performance of these CMOEAs and the resulting algorithm obtains better versatility compared to nine state-of-the-art CMOEAs.展开更多
To solve single-objective constrained optimization problems,a new population-based evolutionary algorithm with elite strategy(PEAES) is proposed with the concept of single and multi-objective optimization.Constrained ...To solve single-objective constrained optimization problems,a new population-based evolutionary algorithm with elite strategy(PEAES) is proposed with the concept of single and multi-objective optimization.Constrained functions are combined to be an objective function.During the evolutionary process,the current optimal solution is found and treated as the reference point to divide the population into three sub-populations:one feasible and two infeasible ones.Different evolutionary operations of single or multi-objective optimization are respectively performed in each sub-population with elite strategy.Thirteen famous benchmark functions are selected to evaluate the performance of PEAES in comparison of other three optimization methods.The results show the proposed method is valid in efficiency,precision and probability for solving single-objective constrained optimization problems.展开更多
Multi-objective optimization for the optimum shape design is introduced in aerodynamics using the Game theory. Based on the control theory, the employed optimizer and the negative feedback are used to implement the co...Multi-objective optimization for the optimum shape design is introduced in aerodynamics using the Game theory. Based on the control theory, the employed optimizer and the negative feedback are used to implement the constraints. All the constraints are satisfied implicitly and automatically in the design. Furthermore,the above methodology is combined with a formulation derived from the Game theory to treat multi-point airfoil optimization. Airfoil shapes are optimized according to various aerodynamics criteria. In the symmetric Nash game, each “player” is responsible for one criterion, and the Nash equilibrium provides a solution to the multipoint optimization. Design results confirm the efficiency of the method.展开更多
The shape approximation method has been proven to be rapid and practicable in resolving low-thrust trajectory;however,it still faces the challenges of large deviation from the optimal solution and inability to satisfy...The shape approximation method has been proven to be rapid and practicable in resolving low-thrust trajectory;however,it still faces the challenges of large deviation from the optimal solution and inability to satisfy the specific flight time and fuel mass constraints.In this paper,a modified shape approximation low-thrust model is presented,and a novel constrained optimization algorithm is developed to solve this problem.The proposed method aims at settling the bi-objective optimization orbit involving the twin objectives of minimum flight time and low fuel consumption and enhancing the accuracy of optimized orbit.In particular,a transformed high-order polynomial model based on finite Fourier series is proposed,which can be characterized as a multi-constraint optimization problem.Then,a novel optimization algorithm is specifically developed to optimize the large-scale multi-constraint dynamical equations of shape trajectory.The key performance indicators of the index include minimum flight time,low fuel consumption and bi-objective optimization of the two.Simulation results prove that this approach possesses both the high precision achievable by numerical methods and low computational complexity offered by shape approximation techniques.Besides,the Pareto front of the fuel-time bi-objective optimization orbit is firstly introduced to analyze an intact optimal solution set.Furthermore,we have demonstrated that our proposed approach is appropriate to generate the preliminary orbit for pseudo-spectral method.展开更多
Financial market has systemic complexity and uncertainty.For investors,return and risk often coexist.How to rationally allocate funds into different assets and achieve excess returns with effectively controlling risk ...Financial market has systemic complexity and uncertainty.For investors,return and risk often coexist.How to rationally allocate funds into different assets and achieve excess returns with effectively controlling risk are main problems to be solved in the field of portfolio optimization(PO).At present,due to the influence of modeling and algorithm solving,the PO models established by many researchers are still mainly focused on single-stage single-objective models or single-stage multiobjective models.PO is actually considered as a multi-stage multi-objective optimization problem in real investment scenarios.It is more difficult than the previous single-stage PO model for meeting the realistic requirements.In this paper,the authors proposed a mean-improved stable tail adjusted return ratio-maximum drawdown rate(M-ISTARR-MD)PO model which effectively characterizes the real investment scenario.In order to solve the multi-stage multi-objective PO model with complex multi-constraints,the authors designed a multi-stage constrained multi-objective evolutionary algorithm with orthogonal learning(MSCMOEA-OL).Comparing with four well-known intelligence algorithms,the MSCMOEA-OL algorithm has competitive advantages in solving the M-ISTARR-MD model on the proposed constructed carbon neutral stock dataset.This paper provides a new way to construct and solve the complex PO model.展开更多
The reliable and coordinated operation of energy systems is becoming increasingly important as renewable energy penetration grows and electricity and gas infrastructures become more interconnected.This study ad-dresse...The reliable and coordinated operation of energy systems is becoming increasingly important as renewable energy penetration grows and electricity and gas infrastructures become more interconnected.This study ad-dresses the challenge of aligning multiple stakeholders’objectives in integrated electricity and gas distribution systems by proposing a sequential constrained optimization method.The method solves the multi-objective optimization problem by sequentially prioritizing each entity’s objective while incorporating others as adaptive-weighted sub-objectives and constraints.This process ensures that all entities participate in a fair and balanced decision-making procedure,ultimately converging to a consensus-based solution.The algorithm is validated using IEEE 33-bus and 118-bus test systems coupled with gas networks.Results show that the proposed method improves optimal resource allocation effectiveness by up to 3.66 compared to individual-objective or aggregated-objective benchmarks.Specifically,the method achieves performance improvements ranging from 0.02 pu to 1.7 pu across four distinct entities,highlighting its superiority in balancing conflicting operational goals.Moreover,the method demonstrates low computational delay and converges in fewer than 15 iterations for all tested cases.The algorithm adapts flexibly to different system configurations and maintains solution stability even under asymmetric stakeholder preferences.These findings indicate that the proposed sequential constrained optimization framework is a scalable and effective approach for equitable,multi-agent coordination in integrated multi-energy systems.展开更多
The allocation of heterogeneous battlefield resources is crucial in Command and Control(C2).Balancing multiple competing objectives under complex constraints so as to provide decisionmakers with diverse feasible candi...The allocation of heterogeneous battlefield resources is crucial in Command and Control(C2).Balancing multiple competing objectives under complex constraints so as to provide decisionmakers with diverse feasible candidate decision schemes remains an urgent challenge.Based on these requirements,a constrained multi-objective multi-stage weapon-target assignment(CMOMWTA)model is established in this paper.To solve this problem,three constraint-feature-guided multi-objective evolutionary algorithms(CFG-MOEAs)are proposed under three typical multi-objective evolutionary frameworks(i.e.,NSGA-Ⅱ,NSGA-Ⅲ,and MOEA/D)to obtain various high-quality candidate decision schemes.Firstly,a constraint-feature-guided reproduction strategy incorporating crossover,mutation,and repair is developed to handle complex constraints.It extracts common row and column features from different linear constraints to generate the feasible offspring population.Then,a variable-length integer encoding method is adopted to concisely denote the decision schemes.Moreover,a hybrid initialization method incorporating both heuristic methods and random sampling is designed to better guide the population.Systemic experiments are conducted on three CFG-MOEAs to verify their effectiveness.The superior algorithm CFG-NSGA-Ⅱamong three CFG-MOEAs is compared with two state-of-the-art CMOMWTA algorithms,and extensive experimental results demonstrate the effectiveness and superiority of CFG-NSGA-Ⅱ.展开更多
Because of the randomness of wind power and photovoltaic(PV)output of new energy bases,the problem of peak regulation capability and voltage stability of ultra-high voltage direct current(UHVDC)transmission lines,we p...Because of the randomness of wind power and photovoltaic(PV)output of new energy bases,the problem of peak regulation capability and voltage stability of ultra-high voltage direct current(UHVDC)transmission lines,we proposed an optimum allocation method of installed capacity of the solar-thermal power station based on chance constrained programming in this work.Firstly,we established the uncertainty model of wind power and PV based on the chance constrained planning theory.Then we used the K-medoids clusteringmethod to cluster the scenarios considering the actual operation scenarios throughout the year.Secondly,we established the optimal configuration model based on the objective function of the strongest transient voltage stability and the lowest overall cost of operation.Finally,by quantitative analysis of actual wind power and photovoltaic new energy base,this work verified the feasibility of the proposed method.As a result of the simulations,we found that using the optimal configuration method of solar-thermal power stations could ensure an accurate allocation of installed capacity.When the installed capacity of the solar-thermal power station is 1×106 kW,the transient voltage recovery index(TVRI)is 0.359,which has a strong voltage support capacity for the system.Based on the results of this work,the optimal configuration of the installed capacity of the solar-thermal power plant can improve peak shaving performance,transient voltage support capability,and new energy consumption while satisfying the Direct Current(DC)outgoing transmission premise.展开更多
Combined sewer networks carry wastewater and stormwater together.Capacity limitation of these sewer networks results in combined sewer overflows(CSOs)during high-intensity storms.Untreated CSOs when directly discharge...Combined sewer networks carry wastewater and stormwater together.Capacity limitation of these sewer networks results in combined sewer overflows(CSOs)during high-intensity storms.Untreated CSOs when directly discharged to the nearby natural water bodies cause many environmental problems.Controlling existing urban sewer networks is one possible way of addressing the issues in urban wastewater systems.However,it is still a challenge,when considering the receiving water quality effects.This paper presents an evolutionary constrained multi-objective optimization approach to control the existing combined sewer networks.The control of online storage tanks was taken into account when controlling the combined sewer network.The developed multi-objective approach considers two important objectives,i.e.the pollution load to the receiving water from CSOs and the cost of the wastewater treatment.The proposed optimization algorithm is applied here to a realistic interceptor sewer system to demonstrate its effectiveness.展开更多
Feasible,smooth,and time-jerk optimal trajectory is essential for manipulators utilized in manufacturing process.A novel technique to generate trajectories in the joint space for robotic manipulators based on quintic ...Feasible,smooth,and time-jerk optimal trajectory is essential for manipulators utilized in manufacturing process.A novel technique to generate trajectories in the joint space for robotic manipulators based on quintic B-spline and constrained multi-objective student psychology based optimization(CMOSPBO)is proposed in this paper.In order to obtain the optimal trajectories,two objective functions including the total travelling time and the integral of the squared jerk along the whole trajectories are considered.The whole trajectories are interpolated by quintic B-spline and then optimized by CMOSPBO,while taking into account kinematic constraints of velocity,acceleration,and jerk.CMOSPBO mainly includes improved student psychology based optimization,archive management,and an adaptiveε-constraint handling method.Lévyflights and differential mutation are adopted to enhance the global exploration capacity of the improved SPBO.Theεvalue is varied with iterations and feasible solutions to prevent the premature convergence of CMOSPBO.Solution density estimation corresponding to the solution distribution in decision space and objective space is proposed to increase the diversity of solutions.The experimental results show that CMOSPBO outperforms than SQP,and NSGA-II in terms of the motion efficiency and jerk.The comparison results demonstrate the effectiveness of the proposed method to generate time-jerk optimal and jerk-continuous trajectories for manipulators.展开更多
In this paper,a new type of machinery which can enlarge the stroke of air cylinder is introduced. It is very useful when the original stroke of air cylinder cannot satisfy the work requirement.According to design requ...In this paper,a new type of machinery which can enlarge the stroke of air cylinder is introduced. It is very useful when the original stroke of air cylinder cannot satisfy the work requirement.According to design requirements,its multi-objective mathematic model with constrained conditions is built. In order to solve this model, some methods are discussed and used such as penalty function method,variable metric method,Newton tangent method and bisection method. Based on the optimal result,motion curves of enlarging stroke mechanism are obtained. Results show that the motion characteristic of enlarging stroke of air cylinder mechanism is satisfying. In addition,we also consider the influence of different initial values of link length to optimal results and two important laws are got in this paper on the basis of optimal results.展开更多
基金supported in part by the National Natural Science Fund for Outstanding Young Scholars of China (61922072)the National Natural Science Foundation of China (62176238, 61806179, 61876169, 61976237)+2 种基金China Postdoctoral Science Foundation (2020M682347)the Training Program of Young Backbone Teachers in Colleges and Universities in Henan Province (2020GGJS006)Henan Provincial Young Talents Lifting Project (2021HYTP007)。
文摘Constrained multi-objective optimization problems(CMOPs) include the optimization of objective functions and the satisfaction of constraint conditions, which challenge the solvers.To solve CMOPs, constrained multi-objective evolutionary algorithms(CMOEAs) have been developed. However, most of them tend to converge into local areas due to the loss of diversity. Evolutionary multitasking(EMT) is new model of solving complex optimization problems, through the knowledge transfer between the source task and other related tasks. Inspired by EMT, this paper develops a new EMT-based CMOEA to solve CMOPs, in which the main task, a global auxiliary task, and a local auxiliary task are created and optimized by one specific population respectively. The main task focuses on finding the feasible Pareto front(PF), and global and local auxiliary tasks are used to respectively enhance global and local diversity. Moreover, the global auxiliary task is used to implement the global search by ignoring constraints, so as to help the population of the main task pass through infeasible obstacles. The local auxiliary task is used to provide local diversity around the population of the main task, so as to exploit promising regions. Through the knowledge transfer among the three tasks, the search ability of the population of the main task will be significantly improved. Compared with other state-of-the-art CMOEAs, the experimental results on three benchmark test suites demonstrate the superior or competitive performance of the proposed CMOEA.
基金partly supported by the National Natural Science Foundation of China(62076225)。
文摘In recent years, a large number of approaches to constrained multi-objective optimization problems(CMOPs) have been proposed, focusing on developing tweaked strategies and techniques for handling constraints. However, an overly finetuned strategy or technique might overfit some problem types,resulting in a lack of versatility. In this article, we propose a generic search strategy that performs an even search in a promising region. The promising region, determined by obtained feasible non-dominated solutions, possesses two general properties.First, the constrained Pareto front(CPF) is included in the promising region. Second, as the number of feasible solutions increases or the convergence performance(i.e., approximation to the CPF) of these solutions improves, the promising region shrinks. Then we develop a new strategy named even search,which utilizes the non-dominated solutions to accelerate convergence and escape from local optima, and the feasible solutions under a constraint relaxation condition to exploit and detect feasible regions. Finally, a diversity measure is adopted to make sure that the individuals in the population evenly cover the valuable areas in the promising region. Experimental results on 45 instances from four benchmark test suites and 14 real-world CMOPs have demonstrated that searching evenly in the promising region can achieve competitive performance and excellent versatility compared to 11 most state-of-the-art methods tailored for CMOPs.
基金Supported by the National Natural Science Foundation of Chi- na（61075113） the Excellent Young Teacher Foundation of Heilongjiang Province of China （1155G18） the Fundamental Research Funds for the Central Universities （HEUCFZl209）
文摘A constrained multi-objective biogeography-based optimization algorithm （CMBOA） was proposed to solve robot path planning （RPP）. For RPP, the length and smoothness of path were taken as the optimization objectives, and the distance from the obstacles was constraint. In CMBOA, a new migration operator with disturbance factor was designed and applied to the feasible population to generate many more non-dominated feasible individuals; meanwhile, some infeasible individuals nearby feasible region were recombined with the nearest feasible ones to approach the feasibility. Compared with classical multi-objective evolutionary algorithms, the current study indicates that CM- BOA has better performance for RPP.
基金supported in part by the National Key Research and Development Program of China(2022YFD2001200)the National Natural Science Foundation of China(62176238,61976237,62206251,62106230)+3 种基金China Postdoctoral Science Foundation(2021T140616,2021M692920)the Natural Science Foundation of Henan Province(222300420088)the Program for Science&Technology Innovation Talents in Universities of Henan Province(23HASTIT023)the Program for Science&Technology Innovation Teams in Universities of Henan Province(23IRTSTHN010).
文摘Constrained multi-objective optimization problems(CMOPs)generally contain multiple constraints,which not only form multiple discrete feasible regions but also reduce the size of optimal feasible regions,thus they propose serious challenges for solvers.Among all constraints,some constraints are highly correlated with optimal feasible regions;thus they can provide effective help to find feasible Pareto front.However,most of the existing constrained multi-objective evolutionary algorithms tackle constraints by regarding all constraints as a whole or directly ignoring all constraints,and do not consider judging the relations among constraints and do not utilize the information from promising single constraints.Therefore,this paper attempts to identify promising single constraints and utilize them to help solve CMOPs.To be specific,a CMOP is transformed into a multitasking optimization problem,where multiple auxiliary tasks are created to search for the Pareto fronts that only consider a single constraint respectively.Besides,an auxiliary task priority method is designed to identify and retain some high-related auxiliary tasks according to the information of relative positions and dominance relationships.Moreover,an improved tentative method is designed to find and transfer useful knowledge among tasks.Experimental results on three benchmark test suites and 11 realworld problems with different numbers of constraints show better or competitive performance of the proposed method when compared with eight state-of-the-art peer methods.
文摘This work investigates one immune optimization approach for dynamic constrained multi-objective multimodal optimization in terms of biological immune inspirations and the concept of constraint dominance. Such approach includes mainly three functional modules, environmental detection, population initialization and immune evolution. The first, inspired by the function of immune surveillance, is designed to detect the change of such kind of problem and to decide the type of a new environment;the second generates an initial population for the current environment, relying upon the result of detection;the last evolves two sub-populations along multiple directions and searches those excellent and diverse candidates. Experimental results show that the proposed approach can adaptively track the environmental change and effectively find the global Pareto-optimal front in each environment.
基金the National Natural Science Foundation of China(62076225,62073300)the Natural Science Foundation for Distinguished Young Scholars of Hubei(2019CFA081)。
文摘Solving constrained multi-objective optimization problems with evolutionary algorithms has attracted considerable attention.Various constrained multi-objective optimization evolutionary algorithms(CMOEAs)have been developed with the use of different algorithmic strategies,evolutionary operators,and constraint-handling techniques.The performance of CMOEAs may be heavily dependent on the operators used,however,it is usually difficult to select suitable operators for the problem at hand.Hence,improving operator selection is promising and necessary for CMOEAs.This work proposes an online operator selection framework assisted by Deep Reinforcement Learning.The dynamics of the population,including convergence,diversity,and feasibility,are regarded as the state;the candidate operators are considered as actions;and the improvement of the population state is treated as the reward.By using a Q-network to learn a policy to estimate the Q-values of all actions,the proposed approach can adaptively select an operator that maximizes the improvement of the population according to the current state and thereby improve the algorithmic performance.The framework is embedded into four popular CMOEAs and assessed on 42 benchmark problems.The experimental results reveal that the proposed Deep Reinforcement Learning-assisted operator selection significantly improves the performance of these CMOEAs and the resulting algorithm obtains better versatility compared to nine state-of-the-art CMOEAs.
文摘To solve single-objective constrained optimization problems,a new population-based evolutionary algorithm with elite strategy(PEAES) is proposed with the concept of single and multi-objective optimization.Constrained functions are combined to be an objective function.During the evolutionary process,the current optimal solution is found and treated as the reference point to divide the population into three sub-populations:one feasible and two infeasible ones.Different evolutionary operations of single or multi-objective optimization are respectively performed in each sub-population with elite strategy.Thirteen famous benchmark functions are selected to evaluate the performance of PEAES in comparison of other three optimization methods.The results show the proposed method is valid in efficiency,precision and probability for solving single-objective constrained optimization problems.
文摘Multi-objective optimization for the optimum shape design is introduced in aerodynamics using the Game theory. Based on the control theory, the employed optimizer and the negative feedback are used to implement the constraints. All the constraints are satisfied implicitly and automatically in the design. Furthermore,the above methodology is combined with a formulation derived from the Game theory to treat multi-point airfoil optimization. Airfoil shapes are optimized according to various aerodynamics criteria. In the symmetric Nash game, each “player” is responsible for one criterion, and the Nash equilibrium provides a solution to the multipoint optimization. Design results confirm the efficiency of the method.
基金supported by the National Natural Science Foundation of China(Nos.61627810,61790562,61403096).
文摘The shape approximation method has been proven to be rapid and practicable in resolving low-thrust trajectory;however,it still faces the challenges of large deviation from the optimal solution and inability to satisfy the specific flight time and fuel mass constraints.In this paper,a modified shape approximation low-thrust model is presented,and a novel constrained optimization algorithm is developed to solve this problem.The proposed method aims at settling the bi-objective optimization orbit involving the twin objectives of minimum flight time and low fuel consumption and enhancing the accuracy of optimized orbit.In particular,a transformed high-order polynomial model based on finite Fourier series is proposed,which can be characterized as a multi-constraint optimization problem.Then,a novel optimization algorithm is specifically developed to optimize the large-scale multi-constraint dynamical equations of shape trajectory.The key performance indicators of the index include minimum flight time,low fuel consumption and bi-objective optimization of the two.Simulation results prove that this approach possesses both the high precision achievable by numerical methods and low computational complexity offered by shape approximation techniques.Besides,the Pareto front of the fuel-time bi-objective optimization orbit is firstly introduced to analyze an intact optimal solution set.Furthermore,we have demonstrated that our proposed approach is appropriate to generate the preliminary orbit for pseudo-spectral method.
基金supported by the National Natural Science Foundation of China under Grant No.61973042Beijing Natural Science Foundation under Grant No.1202020。
文摘Financial market has systemic complexity and uncertainty.For investors,return and risk often coexist.How to rationally allocate funds into different assets and achieve excess returns with effectively controlling risk are main problems to be solved in the field of portfolio optimization(PO).At present,due to the influence of modeling and algorithm solving,the PO models established by many researchers are still mainly focused on single-stage single-objective models or single-stage multiobjective models.PO is actually considered as a multi-stage multi-objective optimization problem in real investment scenarios.It is more difficult than the previous single-stage PO model for meeting the realistic requirements.In this paper,the authors proposed a mean-improved stable tail adjusted return ratio-maximum drawdown rate(M-ISTARR-MD)PO model which effectively characterizes the real investment scenario.In order to solve the multi-stage multi-objective PO model with complex multi-constraints,the authors designed a multi-stage constrained multi-objective evolutionary algorithm with orthogonal learning(MSCMOEA-OL).Comparing with four well-known intelligence algorithms,the MSCMOEA-OL algorithm has competitive advantages in solving the M-ISTARR-MD model on the proposed constructed carbon neutral stock dataset.This paper provides a new way to construct and solve the complex PO model.
基金supported by the research fund of Hanyang University(HY-202400000003289)supported by the Korea Institute of Energy Technol-ogy Evaluation and Planning(KETEP)and the Ministry of Trade,In-dustry&Energy(MOTIE)of the Republic of Korea(No.RS-2025-02313547).
文摘The reliable and coordinated operation of energy systems is becoming increasingly important as renewable energy penetration grows and electricity and gas infrastructures become more interconnected.This study ad-dresses the challenge of aligning multiple stakeholders’objectives in integrated electricity and gas distribution systems by proposing a sequential constrained optimization method.The method solves the multi-objective optimization problem by sequentially prioritizing each entity’s objective while incorporating others as adaptive-weighted sub-objectives and constraints.This process ensures that all entities participate in a fair and balanced decision-making procedure,ultimately converging to a consensus-based solution.The algorithm is validated using IEEE 33-bus and 118-bus test systems coupled with gas networks.Results show that the proposed method improves optimal resource allocation effectiveness by up to 3.66 compared to individual-objective or aggregated-objective benchmarks.Specifically,the method achieves performance improvements ranging from 0.02 pu to 1.7 pu across four distinct entities,highlighting its superiority in balancing conflicting operational goals.Moreover,the method demonstrates low computational delay and converges in fewer than 15 iterations for all tested cases.The algorithm adapts flexibly to different system configurations and maintains solution stability even under asymmetric stakeholder preferences.These findings indicate that the proposed sequential constrained optimization framework is a scalable and effective approach for equitable,multi-agent coordination in integrated multi-energy systems.
基金supported by the National Science Fund of China under Grant Nos.62425304 and 62025301the Basic Science Center Programs of NSFC under Grant No.62088101+1 种基金Shanghai Municipal Science and Technology Major Project under Grant No.2021SHZDZX0100Shanghai Municipal Commission of Science and Technology Project under Grant No.19511132101。
文摘The allocation of heterogeneous battlefield resources is crucial in Command and Control(C2).Balancing multiple competing objectives under complex constraints so as to provide decisionmakers with diverse feasible candidate decision schemes remains an urgent challenge.Based on these requirements,a constrained multi-objective multi-stage weapon-target assignment(CMOMWTA)model is established in this paper.To solve this problem,three constraint-feature-guided multi-objective evolutionary algorithms(CFG-MOEAs)are proposed under three typical multi-objective evolutionary frameworks(i.e.,NSGA-Ⅱ,NSGA-Ⅲ,and MOEA/D)to obtain various high-quality candidate decision schemes.Firstly,a constraint-feature-guided reproduction strategy incorporating crossover,mutation,and repair is developed to handle complex constraints.It extracts common row and column features from different linear constraints to generate the feasible offspring population.Then,a variable-length integer encoding method is adopted to concisely denote the decision schemes.Moreover,a hybrid initialization method incorporating both heuristic methods and random sampling is designed to better guide the population.Systemic experiments are conducted on three CFG-MOEAs to verify their effectiveness.The superior algorithm CFG-NSGA-Ⅱamong three CFG-MOEAs is compared with two state-of-the-art CMOMWTA algorithms,and extensive experimental results demonstrate the effectiveness and superiority of CFG-NSGA-Ⅱ.
基金funded by Major Science and Technology Projects in Gansu Province(19ZD2GA003).
文摘Because of the randomness of wind power and photovoltaic(PV)output of new energy bases,the problem of peak regulation capability and voltage stability of ultra-high voltage direct current(UHVDC)transmission lines,we proposed an optimum allocation method of installed capacity of the solar-thermal power station based on chance constrained programming in this work.Firstly,we established the uncertainty model of wind power and PV based on the chance constrained planning theory.Then we used the K-medoids clusteringmethod to cluster the scenarios considering the actual operation scenarios throughout the year.Secondly,we established the optimal configuration model based on the objective function of the strongest transient voltage stability and the lowest overall cost of operation.Finally,by quantitative analysis of actual wind power and photovoltaic new energy base,this work verified the feasibility of the proposed method.As a result of the simulations,we found that using the optimal configuration method of solar-thermal power stations could ensure an accurate allocation of installed capacity.When the installed capacity of the solar-thermal power station is 1×106 kW,the transient voltage recovery index(TVRI)is 0.359,which has a strong voltage support capacity for the system.Based on the results of this work,the optimal configuration of the installed capacity of the solar-thermal power plant can improve peak shaving performance,transient voltage support capability,and new energy consumption while satisfying the Direct Current(DC)outgoing transmission premise.
文摘Combined sewer networks carry wastewater and stormwater together.Capacity limitation of these sewer networks results in combined sewer overflows(CSOs)during high-intensity storms.Untreated CSOs when directly discharged to the nearby natural water bodies cause many environmental problems.Controlling existing urban sewer networks is one possible way of addressing the issues in urban wastewater systems.However,it is still a challenge,when considering the receiving water quality effects.This paper presents an evolutionary constrained multi-objective optimization approach to control the existing combined sewer networks.The control of online storage tanks was taken into account when controlling the combined sewer network.The developed multi-objective approach considers two important objectives,i.e.the pollution load to the receiving water from CSOs and the cost of the wastewater treatment.The proposed optimization algorithm is applied here to a realistic interceptor sewer system to demonstrate its effectiveness.
基金funded by Zhejiang Provincial Soft Science Project of China under Grant Number 2023C35088.
文摘Feasible,smooth,and time-jerk optimal trajectory is essential for manipulators utilized in manufacturing process.A novel technique to generate trajectories in the joint space for robotic manipulators based on quintic B-spline and constrained multi-objective student psychology based optimization(CMOSPBO)is proposed in this paper.In order to obtain the optimal trajectories,two objective functions including the total travelling time and the integral of the squared jerk along the whole trajectories are considered.The whole trajectories are interpolated by quintic B-spline and then optimized by CMOSPBO,while taking into account kinematic constraints of velocity,acceleration,and jerk.CMOSPBO mainly includes improved student psychology based optimization,archive management,and an adaptiveε-constraint handling method.Lévyflights and differential mutation are adopted to enhance the global exploration capacity of the improved SPBO.Theεvalue is varied with iterations and feasible solutions to prevent the premature convergence of CMOSPBO.Solution density estimation corresponding to the solution distribution in decision space and objective space is proposed to increase the diversity of solutions.The experimental results show that CMOSPBO outperforms than SQP,and NSGA-II in terms of the motion efficiency and jerk.The comparison results demonstrate the effectiveness of the proposed method to generate time-jerk optimal and jerk-continuous trajectories for manipulators.
基金Program for Changjiang Scholars and Innovative Research Team in University,China(No.IRT1220)Donghua University Thesis Innovation Fund,China(No.EG2014028)
文摘In this paper,a new type of machinery which can enlarge the stroke of air cylinder is introduced. It is very useful when the original stroke of air cylinder cannot satisfy the work requirement.According to design requirements,its multi-objective mathematic model with constrained conditions is built. In order to solve this model, some methods are discussed and used such as penalty function method,variable metric method,Newton tangent method and bisection method. Based on the optimal result,motion curves of enlarging stroke mechanism are obtained. Results show that the motion characteristic of enlarging stroke of air cylinder mechanism is satisfying. In addition,we also consider the influence of different initial values of link length to optimal results and two important laws are got in this paper on the basis of optimal results.
