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.展开更多
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.展开更多
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.展开更多
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.展开更多
The development of automated high-throughput experimental platforms has enabled fast sampling of high-dimensional decision spaces.To reach target properties efficiently,these platforms are increasingly paired with int...The development of automated high-throughput experimental platforms has enabled fast sampling of high-dimensional decision spaces.To reach target properties efficiently,these platforms are increasingly paired with intelligent experimental design.However,current optimizers show limitations in maintaining sufficient exploration/exploitation balance for problems dealing with multiple conflicting objectives and complex constraints.Here,we devise an Evolution-Guided Bayesian Optimization(EGBO)algorithm that integrates selection pressure in parallel with a q-Noisy Expected Hypervolume Improvement(qNEHVI)optimizer;this not only solves for the Pareto Front(PF)efficiently but also achieves better coverage of the PF while limiting sampling in the infeasible space.展开更多
The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization problems.In the article,amulti-objective particle swarm optimization algorithmbased on decomposition...The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization problems.In the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search efficiency.First,two update strategies based on decomposition are used to update the evolving population and external archive,respectively.Second,a multiselection strategy is designed.The first strategy is for the subspace without a non-dominated solution.Among the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global search.The second strategy is for the subspace with a non-dominated solution.In the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local search.The third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated solutions.In the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to search.Third,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search efficiency.Finally,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test problems.The results show that the proposed algorithm has better performance.展开更多
This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Op...This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Optimization(SFO)algorithm.The primary objective is to address multi-objective optimization challenges within mechanical engineering,with a specific emphasis on planetary gearbox optimization.The algorithm is equipped with the ability to dynamically select the optimal mutation operator,contingent upon an adaptive normalized population spacing parameter.The efficacy of HMODESFO has been substantiated through rigorous validation against estab-lished industry benchmarks,including a suite of Zitzler-Deb-Thiele(ZDT)and Zeb-Thiele-Laumanns-Zitzler(DTLZ)problems,where it exhibited superior performance.The outcomes underscore the algorithm’s markedly enhanced optimization capabilities relative to existing methods,particularly in tackling highly intricate multi-objective planetary gearbox optimization problems.Additionally,the performance of HMODESFO is evaluated against selected well-known mechanical engineering test problems,further accentuating its adeptness in resolving complex optimization challenges within this domain.展开更多
Impinging jet arrays are extensively used in numerous industrial operations,including the cooling of electronics,turbine blades,and other high-heat flux systems because of their superior heat transfer capabilities.Opt...Impinging jet arrays are extensively used in numerous industrial operations,including the cooling of electronics,turbine blades,and other high-heat flux systems because of their superior heat transfer capabilities.Optimizing the design and operating parameters of such systems is essential to enhance cooling efficiency and achieve uniform pressure distribution,which can lead to improved system performance and energy savings.This paper presents two multi-objective optimization methodologies for a turbulent air jet impingement cooling system.The governing equations are resolved employing the commercial computational fluid dynamics(CFD)software ANSYS Fluent v17.The study focuses on four controlling parameters:Reynolds number(Re),swirl number(S),jet-to-jet separation distance(Z/D),and impingement height(H/D).The effects of these parameters on heat transfer and impingement pressure distribution are investigated.Non-dominated Sorting Genetic Algorithm(NSGA-II)and Weighted Sum Method(WSM)are employed to optimize the controlling parameters for maximum cooling performance.The aim is to identify optimal design parameters and system configurations that enhance heat transfer efficiency while achieving a uniform impingement pressure distribution.These findings have practical implications for applications requiring efficient cooling.The optimized design achieved a 12.28%increase in convective heat transfer efficiency with a local Nusselt number of 113.05 compared to 100.69 in the reference design.Enhanced convective cooling and heat flux were observed in the optimized configuration,particularly in areas of direct jet impingement.Additionally,the optimized design maintained lower wall temperatures,demonstrating more effective thermal dissipation.展开更多
With the development of renewable energy technologies such as photovoltaics and wind power,it has become a research hotspot to improve the consumption rate of new energy and reduce energy costs through algorithm impro...With the development of renewable energy technologies such as photovoltaics and wind power,it has become a research hotspot to improve the consumption rate of new energy and reduce energy costs through algorithm improvement.To reduce the operational costs of micro-grid systems and the energy abandonment rate of renewable energy,while simultaneously enhancing user satisfaction on the demand side,this paper introduces an improvedmultiobjective Grey Wolf Optimizer based on Cauchy variation.The proposed approach incorporates a Cauchy variation strategy during the optimizer’s search phase to expand its exploration range and minimize the likelihood of becoming trapped in local optima.At the same time,adoptingmultiple energy storage methods to improve the consumption rate of renewable energy.Subsequently,under different energy balance orders,themulti-objective particle swarmalgorithm,multi-objective grey wolf optimizer,and Cauchy’s variant of the improvedmulti-objective grey wolf optimizer are used for example simulation,solving the Pareto solution set of the model and comparing.The analysis of the results reveals that,compared to the original optimizer,the improved optimizer decreases the daily cost by approximately 100 yuan,and reduces the energy abandonment rate to zero.Meanwhile,it enhances user satisfaction and ensures the stable operation of the micro-grid.展开更多
Multi-objective optimization is critical for problem-solving in engineering,economics,and AI.This study introduces the Multi-Objective Chef-Based Optimization Algorithm(MOCBOA),an upgraded version of the Chef-Based Op...Multi-objective optimization is critical for problem-solving in engineering,economics,and AI.This study introduces the Multi-Objective Chef-Based Optimization Algorithm(MOCBOA),an upgraded version of the Chef-Based Optimization Algorithm(CBOA)that addresses distinct objectives.Our approach is unique in systematically examining four dominance relations—Pareto,Epsilon,Cone-epsilon,and Strengthened dominance—to evaluate their influence on sustaining solution variety and driving convergence toward the Pareto front.Our comparison investigation,which was conducted on fifty test problems from the CEC 2021 benchmark and applied to areas such as chemical engineering,mechanical design,and power systems,reveals that the dominance approach used has a considerable impact on the key optimization measures such as the hypervolume metric.This paper provides a solid foundation for determining themost effective dominance approach and significant insights for both theoretical research and practical applications in multi-objective optimization.展开更多
In recent years,decomposition-based evolutionary algorithms have become popular algorithms for solving multi-objective problems in real-life scenarios.In these algorithms,the reference vectors of the Penalty-Based bou...In recent years,decomposition-based evolutionary algorithms have become popular algorithms for solving multi-objective problems in real-life scenarios.In these algorithms,the reference vectors of the Penalty-Based boundary intersection(PBI)are distributed parallelly while those based on the normal boundary intersection(NBI)are distributed radially in a conical shape in the objective space.To improve the problem-solving effectiveness of multi-objective optimization algorithms in engineering applications,this paper addresses the improvement of the Collaborative Decomposition(CoD)method,a multi-objective decomposition technique that integrates PBI and NBI,and combines it with the Elephant Clan Optimization Algorithm,introducing the Collaborative Decomposition Multi-objective Improved Elephant Clan Optimization Algorithm(CoDMOIECO).Specifically,a novel subpopulation construction method with adaptive changes following the number of iterations and a novel individual merit ranking based onNBI and angle are proposed.,enabling the creation of subpopulations closely linked to weight vectors and the identification of diverse individuals within them.Additionally,new update strategies for the clan leader,male elephants,and juvenile elephants are introduced to boost individual exploitation capabilities and further enhance the algorithm’s convergence.Finally,a new CoD-based environmental selection method is proposed,introducing adaptive dynamically adjusted angle coefficients and individual angles on corresponding weight vectors,significantly improving both the convergence and distribution of the algorithm.Experimental comparisons on the ZDT,DTLZ,and WFG function sets with four benchmark multi-objective algorithms—MOEA/D,CAMOEA,VaEA,and MOEA/D-UR—demonstrate that CoDMOIECO achieves superior performance in both convergence and distribution.展开更多
Addressing the complex issue of emergency resource distribution center site selection in uncertain environments, this study was conducted to comprehensively consider factors such as uncertainty parameters and the urge...Addressing the complex issue of emergency resource distribution center site selection in uncertain environments, this study was conducted to comprehensively consider factors such as uncertainty parameters and the urgency of demand at disaster-affected sites. Firstly, urgency cost, economic cost, and transportation distance cost were identified as key objectives. The study applied fuzzy theory integration to construct a triangular fuzzy multi-objective site selection decision model. Next, the defuzzification theory transformed the fuzzy decision model into a precise one. Subsequently, an improved Chaotic Quantum Multi-Objective Harris Hawks Optimization (CQ-MOHHO) algorithm was proposed to solve the model. The CQ-MOHHO algorithm was shown to rapidly produce high-quality Pareto front solutions and identify optimal site selection schemes for emergency resource distribution centers through case studies. This outcome verified the feasibility and efficacy of the site selection decision model and the CQ-MOHHO algorithm. To further assess CQ-MOHHO’s performance, Zitzler-Deb-Thiele (ZDT) test functions, commonly used in multi-objective optimization, were employed. Comparisons with Multi-Objective Harris Hawks Optimization (MOHHO), Non-dominated Sorting Genetic Algorithm II (NSGA-II), and Multi-Objective Grey Wolf Optimizer (MOGWO) using Generational Distance (GD), Hypervolume (HV), and Inverted Generational Distance (IGD) metrics showed that CQ-MOHHO achieved superior global search ability, faster convergence, and higher solution quality. The CQ-MOHHO algorithm efficiently achieved a balance between multiple objectives, providing decision-makers with satisfactory solutions and a valuable reference for researching and applying emergency site selection problems.展开更多
The multi-objective optimization of backfill effect based on response surface methodology and desirability function(RSM-DF)was conducted.Firstly,the test results show that the uniaxial compressive strength(UCS)increas...The multi-objective optimization of backfill effect based on response surface methodology and desirability function(RSM-DF)was conducted.Firstly,the test results show that the uniaxial compressive strength(UCS)increases with cement sand ratio(CSR),slurry concentration(SC),and curing age(CA),while flow resistance(FR)increases with SC and backfill flow rate(BFR),and decreases with CSR.Then the regression models of UCS and FR as response values were established through RSM.Multi-factor interaction found that CSR-CA impacted UCS most,while SC-BFR impacted FR most.By introducing the desirability function,the optimal backfill parameters were obtained based on RSM-DF(CSR is 1:6.25,SC is 69%,CA is 11.5 d,and BFR is 90 m^(3)/h),showing close results of Design Expert and high reliability for optimization.For a copper mine in China,RSM-DF optimization will reduce cement consumption by 4758 t per year,increase tailings consumption by about 6700 t,and reduce CO_(2)emission by about 4758 t.Thus,RSM-DF provides a new approach for backfill parameters optimization,which has important theoretical and practical values.展开更多
Wireless Sensor Networks(WSNs)are one of the best technologies of the 21st century and have seen tremendous growth over the past decade.Much work has been put into its development in various aspects such as architectu...Wireless Sensor Networks(WSNs)are one of the best technologies of the 21st century and have seen tremendous growth over the past decade.Much work has been put into its development in various aspects such as architectural attention,routing protocols,location exploration,time exploration,etc.This research aims to optimize routing protocols and address the challenges arising from conflicting objectives in WSN environments,such as balancing energy consumption,ensuring routing reliability,distributing network load,and selecting the shortest path.Many optimization techniques have shown success in achieving one or two objectives but struggle to achieve the right balance between multiple conflicting objectives.To address this gap,this paper proposes an innovative approach that integrates Particle Swarm Optimization(PSO)with a fuzzy multi-objective framework.The proposed method uses fuzzy logic to effectively control multiple competing objectives to represent its major development beyond existing methods that only deal with one or two objectives.The search efficiency is improved by particle swarm optimization(PSO)which overcomes the large computational requirements that serve as a major drawback of existing methods.The PSO algorithm is adapted for WSNs to optimize routing paths based on fuzzy multi-objective fitness.The fuzzy logic framework uses predefined membership functions and rule-based reasoning to adjust routing decisions.These adjustments influence PSO’s velocity updates,ensuring continuous adaptation under varying network conditions.The proposed multi-objective PSO-fuzzy model is evaluated using NS-3 simulation.The results show that the proposed model is capable of improving the network lifetime by 15.2%–22.4%,increasing the stabilization time by 18.7%–25.5%,and increasing the residual energy by 8.9%–16.2% compared to the state-of-the-art techniques.The proposed model also achieves a 15%–24% reduction in load variance,demonstrating balanced routing and extended network lifetime.Furthermore,analysis using p-values obtained from multiple performance measures(p-values<0.05)showed that the proposed approach outperforms with a high level of confidence.The proposed multi-objective PSO-fuzzy model provides a robust and scalable solution to improve the performance of WSNs.It allows stable performance in networks with 100 to 300 nodes,under varying node densities,and across different base station placements.Computational complexity analysis has shown that the method fits well into large-scale WSNs and that the addition of fuzzy logic controls the power usage to make the system practical for real-world use.展开更多
This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is establish...This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is established with production error and production cost as optimization objectives,combined with constraints such as the number of equipment and the number of layers.Second,a decoupled multi-objective optimization algorithm(DMOA)is proposed based on the linear programming decoupling strategy and non-dominated sorting in genetic algorithmsⅡ(NSGAII).The size-combination matrix and the fabric-layer matrix are decoupled to improve the accuracy of the algorithm.Meanwhile,an improved NSGAII algorithm is designed to obtain the optimal Pareto solution to the MCOP problem,thereby constructing a practical intelligent production optimization algorithm.Finally,the effectiveness and superiority of the proposed DMOA are verified through practical cases and comparative experiments,which can effectively optimize the production process for garment enterprises.展开更多
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.展开更多
The distributed flexible job shop scheduling problem(DFJSP)has attracted great attention with the growth of the global manufacturing industry.General DFJSP research only considers machine constraints and ignores worke...The distributed flexible job shop scheduling problem(DFJSP)has attracted great attention with the growth of the global manufacturing industry.General DFJSP research only considers machine constraints and ignores worker constraints.As one critical factor of production,effective utilization of worker resources can increase productivity.Meanwhile,energy consumption is a growing concern due to the increasingly serious environmental issues.Therefore,the distributed flexible job shop scheduling problem with dual resource constraints(DFJSP-DRC)for minimizing makespan and total energy consumption is studied in this paper.To solve the problem,we present a multi-objective mathematical model for DFJSP-DRC and propose a Q-learning-based multi-objective grey wolf optimizer(Q-MOGWO).In Q-MOGWO,high-quality initial solutions are generated by a hybrid initialization strategy,and an improved active decoding strategy is designed to obtain the scheduling schemes.To further enhance the local search capability and expand the solution space,two wolf predation strategies and three critical factory neighborhood structures based on Q-learning are proposed.These strategies and structures enable Q-MOGWO to explore the solution space more efficiently and thus find better Pareto solutions.The effectiveness of Q-MOGWO in addressing DFJSP-DRC is verified through comparison with four algorithms using 45 instances.The results reveal that Q-MOGWO outperforms comparison algorithms in terms of solution quality.展开更多
Robot-automated spraying is widely used in various fields,such as the automotive,metalworking,furniture,and aero-space industries.Spraying quality is influenced by multiple factors,including robot speed,acceleration,e...Robot-automated spraying is widely used in various fields,such as the automotive,metalworking,furniture,and aero-space industries.Spraying quality is influenced by multiple factors,including robot speed,acceleration,end-effector trajectory,and spraying process constraints.To achieve high-quality spraying under the influence of multiple factors,this study proposes a multi-objective optimization method for the spraying trajectory that integrates spraying process constraints into the optimization process.First,a 7-degree-of-freedom rigid-flexible coupling serial spray painting robot system is introduced,which includes a motion decoupling mechanism and a tension amplification mechanism.Subsequently,a paint deposition model for the spray gun was established,and the influence of process constraints on spraying quality was analyzed.Trajectory planning for the spray painting robot,based on the septic B-spline interpolation method,was then performed.Based on this foundation,objective functions and constraint equations for spraying trajectory optimization were established.A multi-objective trajectory optimization method for spraying by the robot is proposed based on the NSGA-Ⅱ,which integrates the spraying process constraints.Finally,a prototype system of a 7-degree-of-freedom rigid-flexible coupling serial spray painting robot was constructed.Simulations and spraying experiments were conducted to verify the effectiveness of the proposed multi-objective trajectory optimization method.This paper presents a multi-objective optimization method for the spraying trajectory of a robot.In the proposed method,the optimized spraying trajectory is generated with the spraying process as the constraint and time,energy consumption,and impact during the spraying operation of the robot as the optimization objectives.展开更多
In the independent electro-hydrogen system(IEHS)with hybrid energy storage(HESS),achieving optimal scheduling is crucial.Still,it presents a challenge due to the significant deviations in values ofmultiple optimizatio...In the independent electro-hydrogen system(IEHS)with hybrid energy storage(HESS),achieving optimal scheduling is crucial.Still,it presents a challenge due to the significant deviations in values ofmultiple optimization objective functions caused by their physical dimensions.These deviations seriously affect the scheduling process.A novel standardization fusion method has been established to address this issue by analyzing the variation process of each objective function’s values.The optimal scheduling results of IEHS with HESS indicate that the economy and overall energy loss can be improved 2–3 times under different optimization methods.The proposed method better balances all optimization objective functions and reduces the impact of their dimensionality.When the cost of BESS decreases by approximately 30%,its participation deepens by about 1 time.Moreover,if the price of the electrolyzer is less than 15¥/kWh or if the cost of the fuel cell drops below 4¥/kWh,their participation will increase substantially.This study aims to provide a more reasonable approach to solving multi-objective optimization problems.展开更多
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.展开更多
基金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.
基金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.
基金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.
基金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.
基金funding from AME Programmatic Funds by the Agency for Science,Technology and Research under Grant No.A1898b0043 and No.A20G9b0135KH also acknowledges funding from the National Research Foundation(NRF),Singapore under the NRF Fellowship(NRF-NRFF13-2021-0011)+2 种基金SAK and FMB also acknowledge funding from the 25th NRF CRP programme(NRF-CRP25-2020RS-0002)QL also acknowledges support from the NRF fellowship(project No.NRF-NRFF13-2021-0005)the Ministry of Education,Singapore,under its Research Centre of Excellence award to the Institute for Functional Intelligent Materials(I-FIM,project No.EDUNC-33-18-279-V12).
文摘The development of automated high-throughput experimental platforms has enabled fast sampling of high-dimensional decision spaces.To reach target properties efficiently,these platforms are increasingly paired with intelligent experimental design.However,current optimizers show limitations in maintaining sufficient exploration/exploitation balance for problems dealing with multiple conflicting objectives and complex constraints.Here,we devise an Evolution-Guided Bayesian Optimization(EGBO)algorithm that integrates selection pressure in parallel with a q-Noisy Expected Hypervolume Improvement(qNEHVI)optimizer;this not only solves for the Pareto Front(PF)efficiently but also achieves better coverage of the PF while limiting sampling in the infeasible space.
基金supported by National Natural Science Foundations of China(nos.12271326,62102304,61806120,61502290,61672334,61673251)China Postdoctoral Science Foundation(no.2015M582606)+2 种基金Industrial Research Project of Science and Technology in Shaanxi Province(nos.2015GY016,2017JQ6063)Fundamental Research Fund for the Central Universities(no.GK202003071)Natural Science Basic Research Plan in Shaanxi Province of China(no.2022JM-354).
文摘The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization problems.In the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search efficiency.First,two update strategies based on decomposition are used to update the evolving population and external archive,respectively.Second,a multiselection strategy is designed.The first strategy is for the subspace without a non-dominated solution.Among the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global search.The second strategy is for the subspace with a non-dominated solution.In the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local search.The third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated solutions.In the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to search.Third,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search efficiency.Finally,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test problems.The results show that the proposed algorithm has better performance.
基金supported by the Serbian Ministry of Education and Science under Grant No.TR35006 and COST Action:CA23155—A Pan-European Network of Ocean Tribology(OTC)The research of B.Rosic and M.Rosic was supported by the Serbian Ministry of Education and Science under Grant TR35029.
文摘This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Optimization(SFO)algorithm.The primary objective is to address multi-objective optimization challenges within mechanical engineering,with a specific emphasis on planetary gearbox optimization.The algorithm is equipped with the ability to dynamically select the optimal mutation operator,contingent upon an adaptive normalized population spacing parameter.The efficacy of HMODESFO has been substantiated through rigorous validation against estab-lished industry benchmarks,including a suite of Zitzler-Deb-Thiele(ZDT)and Zeb-Thiele-Laumanns-Zitzler(DTLZ)problems,where it exhibited superior performance.The outcomes underscore the algorithm’s markedly enhanced optimization capabilities relative to existing methods,particularly in tackling highly intricate multi-objective planetary gearbox optimization problems.Additionally,the performance of HMODESFO is evaluated against selected well-known mechanical engineering test problems,further accentuating its adeptness in resolving complex optimization challenges within this domain.
文摘Impinging jet arrays are extensively used in numerous industrial operations,including the cooling of electronics,turbine blades,and other high-heat flux systems because of their superior heat transfer capabilities.Optimizing the design and operating parameters of such systems is essential to enhance cooling efficiency and achieve uniform pressure distribution,which can lead to improved system performance and energy savings.This paper presents two multi-objective optimization methodologies for a turbulent air jet impingement cooling system.The governing equations are resolved employing the commercial computational fluid dynamics(CFD)software ANSYS Fluent v17.The study focuses on four controlling parameters:Reynolds number(Re),swirl number(S),jet-to-jet separation distance(Z/D),and impingement height(H/D).The effects of these parameters on heat transfer and impingement pressure distribution are investigated.Non-dominated Sorting Genetic Algorithm(NSGA-II)and Weighted Sum Method(WSM)are employed to optimize the controlling parameters for maximum cooling performance.The aim is to identify optimal design parameters and system configurations that enhance heat transfer efficiency while achieving a uniform impingement pressure distribution.These findings have practical implications for applications requiring efficient cooling.The optimized design achieved a 12.28%increase in convective heat transfer efficiency with a local Nusselt number of 113.05 compared to 100.69 in the reference design.Enhanced convective cooling and heat flux were observed in the optimized configuration,particularly in areas of direct jet impingement.Additionally,the optimized design maintained lower wall temperatures,demonstrating more effective thermal dissipation.
基金supported by the Open Fund of Guangxi Key Laboratory of Building New Energy and Energy Conservation(Project Number:Guike Energy 17-J-21-3).
文摘With the development of renewable energy technologies such as photovoltaics and wind power,it has become a research hotspot to improve the consumption rate of new energy and reduce energy costs through algorithm improvement.To reduce the operational costs of micro-grid systems and the energy abandonment rate of renewable energy,while simultaneously enhancing user satisfaction on the demand side,this paper introduces an improvedmultiobjective Grey Wolf Optimizer based on Cauchy variation.The proposed approach incorporates a Cauchy variation strategy during the optimizer’s search phase to expand its exploration range and minimize the likelihood of becoming trapped in local optima.At the same time,adoptingmultiple energy storage methods to improve the consumption rate of renewable energy.Subsequently,under different energy balance orders,themulti-objective particle swarmalgorithm,multi-objective grey wolf optimizer,and Cauchy’s variant of the improvedmulti-objective grey wolf optimizer are used for example simulation,solving the Pareto solution set of the model and comparing.The analysis of the results reveals that,compared to the original optimizer,the improved optimizer decreases the daily cost by approximately 100 yuan,and reduces the energy abandonment rate to zero.Meanwhile,it enhances user satisfaction and ensures the stable operation of the micro-grid.
基金funded by Researchers Supporting Programnumber(RSPD2024R809),King Saud University,Riyadh,Saudi Arabia.
文摘Multi-objective optimization is critical for problem-solving in engineering,economics,and AI.This study introduces the Multi-Objective Chef-Based Optimization Algorithm(MOCBOA),an upgraded version of the Chef-Based Optimization Algorithm(CBOA)that addresses distinct objectives.Our approach is unique in systematically examining four dominance relations—Pareto,Epsilon,Cone-epsilon,and Strengthened dominance—to evaluate their influence on sustaining solution variety and driving convergence toward the Pareto front.Our comparison investigation,which was conducted on fifty test problems from the CEC 2021 benchmark and applied to areas such as chemical engineering,mechanical design,and power systems,reveals that the dominance approach used has a considerable impact on the key optimization measures such as the hypervolume metric.This paper provides a solid foundation for determining themost effective dominance approach and significant insights for both theoretical research and practical applications in multi-objective optimization.
文摘In recent years,decomposition-based evolutionary algorithms have become popular algorithms for solving multi-objective problems in real-life scenarios.In these algorithms,the reference vectors of the Penalty-Based boundary intersection(PBI)are distributed parallelly while those based on the normal boundary intersection(NBI)are distributed radially in a conical shape in the objective space.To improve the problem-solving effectiveness of multi-objective optimization algorithms in engineering applications,this paper addresses the improvement of the Collaborative Decomposition(CoD)method,a multi-objective decomposition technique that integrates PBI and NBI,and combines it with the Elephant Clan Optimization Algorithm,introducing the Collaborative Decomposition Multi-objective Improved Elephant Clan Optimization Algorithm(CoDMOIECO).Specifically,a novel subpopulation construction method with adaptive changes following the number of iterations and a novel individual merit ranking based onNBI and angle are proposed.,enabling the creation of subpopulations closely linked to weight vectors and the identification of diverse individuals within them.Additionally,new update strategies for the clan leader,male elephants,and juvenile elephants are introduced to boost individual exploitation capabilities and further enhance the algorithm’s convergence.Finally,a new CoD-based environmental selection method is proposed,introducing adaptive dynamically adjusted angle coefficients and individual angles on corresponding weight vectors,significantly improving both the convergence and distribution of the algorithm.Experimental comparisons on the ZDT,DTLZ,and WFG function sets with four benchmark multi-objective algorithms—MOEA/D,CAMOEA,VaEA,and MOEA/D-UR—demonstrate that CoDMOIECO achieves superior performance in both convergence and distribution.
文摘Addressing the complex issue of emergency resource distribution center site selection in uncertain environments, this study was conducted to comprehensively consider factors such as uncertainty parameters and the urgency of demand at disaster-affected sites. Firstly, urgency cost, economic cost, and transportation distance cost were identified as key objectives. The study applied fuzzy theory integration to construct a triangular fuzzy multi-objective site selection decision model. Next, the defuzzification theory transformed the fuzzy decision model into a precise one. Subsequently, an improved Chaotic Quantum Multi-Objective Harris Hawks Optimization (CQ-MOHHO) algorithm was proposed to solve the model. The CQ-MOHHO algorithm was shown to rapidly produce high-quality Pareto front solutions and identify optimal site selection schemes for emergency resource distribution centers through case studies. This outcome verified the feasibility and efficacy of the site selection decision model and the CQ-MOHHO algorithm. To further assess CQ-MOHHO’s performance, Zitzler-Deb-Thiele (ZDT) test functions, commonly used in multi-objective optimization, were employed. Comparisons with Multi-Objective Harris Hawks Optimization (MOHHO), Non-dominated Sorting Genetic Algorithm II (NSGA-II), and Multi-Objective Grey Wolf Optimizer (MOGWO) using Generational Distance (GD), Hypervolume (HV), and Inverted Generational Distance (IGD) metrics showed that CQ-MOHHO achieved superior global search ability, faster convergence, and higher solution quality. The CQ-MOHHO algorithm efficiently achieved a balance between multiple objectives, providing decision-makers with satisfactory solutions and a valuable reference for researching and applying emergency site selection problems.
基金Funded by the Deep Underground National Science&Technology Major Project gram of China(No.2024ZD1003704)the National Natural Science Foundation of China(Nos.51834001 and 52374111)。
文摘The multi-objective optimization of backfill effect based on response surface methodology and desirability function(RSM-DF)was conducted.Firstly,the test results show that the uniaxial compressive strength(UCS)increases with cement sand ratio(CSR),slurry concentration(SC),and curing age(CA),while flow resistance(FR)increases with SC and backfill flow rate(BFR),and decreases with CSR.Then the regression models of UCS and FR as response values were established through RSM.Multi-factor interaction found that CSR-CA impacted UCS most,while SC-BFR impacted FR most.By introducing the desirability function,the optimal backfill parameters were obtained based on RSM-DF(CSR is 1:6.25,SC is 69%,CA is 11.5 d,and BFR is 90 m^(3)/h),showing close results of Design Expert and high reliability for optimization.For a copper mine in China,RSM-DF optimization will reduce cement consumption by 4758 t per year,increase tailings consumption by about 6700 t,and reduce CO_(2)emission by about 4758 t.Thus,RSM-DF provides a new approach for backfill parameters optimization,which has important theoretical and practical values.
基金funded by Deanship of Graduate studies and Scientific Research at Jouf University under grant No.(DGSSR-2023-2-02038).
文摘Wireless Sensor Networks(WSNs)are one of the best technologies of the 21st century and have seen tremendous growth over the past decade.Much work has been put into its development in various aspects such as architectural attention,routing protocols,location exploration,time exploration,etc.This research aims to optimize routing protocols and address the challenges arising from conflicting objectives in WSN environments,such as balancing energy consumption,ensuring routing reliability,distributing network load,and selecting the shortest path.Many optimization techniques have shown success in achieving one or two objectives but struggle to achieve the right balance between multiple conflicting objectives.To address this gap,this paper proposes an innovative approach that integrates Particle Swarm Optimization(PSO)with a fuzzy multi-objective framework.The proposed method uses fuzzy logic to effectively control multiple competing objectives to represent its major development beyond existing methods that only deal with one or two objectives.The search efficiency is improved by particle swarm optimization(PSO)which overcomes the large computational requirements that serve as a major drawback of existing methods.The PSO algorithm is adapted for WSNs to optimize routing paths based on fuzzy multi-objective fitness.The fuzzy logic framework uses predefined membership functions and rule-based reasoning to adjust routing decisions.These adjustments influence PSO’s velocity updates,ensuring continuous adaptation under varying network conditions.The proposed multi-objective PSO-fuzzy model is evaluated using NS-3 simulation.The results show that the proposed model is capable of improving the network lifetime by 15.2%–22.4%,increasing the stabilization time by 18.7%–25.5%,and increasing the residual energy by 8.9%–16.2% compared to the state-of-the-art techniques.The proposed model also achieves a 15%–24% reduction in load variance,demonstrating balanced routing and extended network lifetime.Furthermore,analysis using p-values obtained from multiple performance measures(p-values<0.05)showed that the proposed approach outperforms with a high level of confidence.The proposed multi-objective PSO-fuzzy model provides a robust and scalable solution to improve the performance of WSNs.It allows stable performance in networks with 100 to 300 nodes,under varying node densities,and across different base station placements.Computational complexity analysis has shown that the method fits well into large-scale WSNs and that the addition of fuzzy logic controls the power usage to make the system practical for real-world use.
基金Supported by the Natural Science Foundation of Zhejiang Province(No.LQ22F030015).
文摘This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is established with production error and production cost as optimization objectives,combined with constraints such as the number of equipment and the number of layers.Second,a decoupled multi-objective optimization algorithm(DMOA)is proposed based on the linear programming decoupling strategy and non-dominated sorting in genetic algorithmsⅡ(NSGAII).The size-combination matrix and the fabric-layer matrix are decoupled to improve the accuracy of the algorithm.Meanwhile,an improved NSGAII algorithm is designed to obtain the optimal Pareto solution to the MCOP problem,thereby constructing a practical intelligent production optimization algorithm.Finally,the effectiveness and superiority of the proposed DMOA are verified through practical cases and comparative experiments,which can effectively optimize the production process for garment enterprises.
基金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 by the Natural Science Foundation of Anhui Province(Grant Number 2208085MG181)the Science Research Project of Higher Education Institutions in Anhui Province,Philosophy and Social Sciences(Grant Number 2023AH051063)the Open Fund of Key Laboratory of Anhui Higher Education Institutes(Grant Number CS2021-ZD01).
文摘The distributed flexible job shop scheduling problem(DFJSP)has attracted great attention with the growth of the global manufacturing industry.General DFJSP research only considers machine constraints and ignores worker constraints.As one critical factor of production,effective utilization of worker resources can increase productivity.Meanwhile,energy consumption is a growing concern due to the increasingly serious environmental issues.Therefore,the distributed flexible job shop scheduling problem with dual resource constraints(DFJSP-DRC)for minimizing makespan and total energy consumption is studied in this paper.To solve the problem,we present a multi-objective mathematical model for DFJSP-DRC and propose a Q-learning-based multi-objective grey wolf optimizer(Q-MOGWO).In Q-MOGWO,high-quality initial solutions are generated by a hybrid initialization strategy,and an improved active decoding strategy is designed to obtain the scheduling schemes.To further enhance the local search capability and expand the solution space,two wolf predation strategies and three critical factory neighborhood structures based on Q-learning are proposed.These strategies and structures enable Q-MOGWO to explore the solution space more efficiently and thus find better Pareto solutions.The effectiveness of Q-MOGWO in addressing DFJSP-DRC is verified through comparison with four algorithms using 45 instances.The results reveal that Q-MOGWO outperforms comparison algorithms in terms of solution quality.
基金Supported by National Natural Science Foundation of China(Grant Nos.52335002,51925502)。
文摘Robot-automated spraying is widely used in various fields,such as the automotive,metalworking,furniture,and aero-space industries.Spraying quality is influenced by multiple factors,including robot speed,acceleration,end-effector trajectory,and spraying process constraints.To achieve high-quality spraying under the influence of multiple factors,this study proposes a multi-objective optimization method for the spraying trajectory that integrates spraying process constraints into the optimization process.First,a 7-degree-of-freedom rigid-flexible coupling serial spray painting robot system is introduced,which includes a motion decoupling mechanism and a tension amplification mechanism.Subsequently,a paint deposition model for the spray gun was established,and the influence of process constraints on spraying quality was analyzed.Trajectory planning for the spray painting robot,based on the septic B-spline interpolation method,was then performed.Based on this foundation,objective functions and constraint equations for spraying trajectory optimization were established.A multi-objective trajectory optimization method for spraying by the robot is proposed based on the NSGA-Ⅱ,which integrates the spraying process constraints.Finally,a prototype system of a 7-degree-of-freedom rigid-flexible coupling serial spray painting robot was constructed.Simulations and spraying experiments were conducted to verify the effectiveness of the proposed multi-objective trajectory optimization method.This paper presents a multi-objective optimization method for the spraying trajectory of a robot.In the proposed method,the optimized spraying trajectory is generated with the spraying process as the constraint and time,energy consumption,and impact during the spraying operation of the robot as the optimization objectives.
基金sponsored by R&D Program of Beijing Municipal Education Commission(KM202410009013).
文摘In the independent electro-hydrogen system(IEHS)with hybrid energy storage(HESS),achieving optimal scheduling is crucial.Still,it presents a challenge due to the significant deviations in values ofmultiple optimization objective functions caused by their physical dimensions.These deviations seriously affect the scheduling process.A novel standardization fusion method has been established to address this issue by analyzing the variation process of each objective function’s values.The optimal scheduling results of IEHS with HESS indicate that the economy and overall energy loss can be improved 2–3 times under different optimization methods.The proposed method better balances all optimization objective functions and reduces the impact of their dimensionality.When the cost of BESS decreases by approximately 30%,its participation deepens by about 1 time.Moreover,if the price of the electrolyzer is less than 15¥/kWh or if the cost of the fuel cell drops below 4¥/kWh,their participation will increase substantially.This study aims to provide a more reasonable approach to solving multi-objective optimization problems.
文摘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.
