This paper deals with the connectedness of the cone-efficient solution set for vector optimization in locally convex Hausdorff topological vector spaces. The connectedness of the cone-efficient solution set is proved ...This paper deals with the connectedness of the cone-efficient solution set for vector optimization in locally convex Hausdorff topological vector spaces. The connectedness of the cone-efficient solution set is proved for multiobjective programming defined by a continuous one-to-one cone-quasiconvex mapping on a compact convex set of alternatives. During the proof, the generalized saddle theorem plays a key role.展开更多
To optimize the operating efficiency and extend the lifespan of the multistack fuel cell hybrid system(MFCHS),this paper proposes a two-layer multiobjective optimal energy management strategy that considers the degrad...To optimize the operating efficiency and extend the lifespan of the multistack fuel cell hybrid system(MFCHS),this paper proposes a two-layer multiobjective optimal energy management strategy that considers the degradation of the fuel cell and the battery.Regarding the issues that power fluctuations damage the fuel cells'lifespan and high-current charging and discharging lead to battery capacity decay,the first layer of the strategy adopts locally weighted scatterplot smoothing(LOWESS)to smooth the output power of the fuel cells and prevent the battery from operating under high-current conditions.The second layer considers the uneven degree of degradation among the fuel cells and employs the dandelion optimizer(DO)algorithm to solve the objective function with an aging adaptive factor,optimizing the efficiency and lifespan.Meanwhile,the DO algorithm is enhanced by tent chaotic mapping and differential variation to improve the convergence speed and accuracy.Compared with the equivalent hydrogen consumption minimization strategy(ECMS)and the equal distribution strategy,the proposed strategy improves the average operating efficiency of the fuel cells,effectively reduces the degradation of the fuel cells and the capacity degradation of the battery,and maintains the performance consistency among the fuel cells.展开更多
Expensive multiobjective optimization problems(EMOPs)are complex optimization problems exacted from realworld applications,where each objective function evaluation(FE)involves expensive computations or physical experi...Expensive multiobjective optimization problems(EMOPs)are complex optimization problems exacted from realworld applications,where each objective function evaluation(FE)involves expensive computations or physical experiments.Many surrogate-assisted evolutionary algorithms(SAEAs)have been designed to solve EMOPs.Nevertheless,EMOPs with large-scale decision variables remain challenging for existing SAEAs,leading to difficulties in maintaining convergence and diversity.To address this deficiency,we proposed a variable reconstructionbased SAEA(VREA)to balance convergence enhancement and diversity maintenance.Generally,a cluster-based variable reconstruction strategy reconstructs the original large-scale decision variables into low-dimensional weight variables.Thus,the population can be rapidly pushed towards the Pareto set(PS)by optimizing low-dimensional weight variables with the assistance of surrogate models.Population diversity is improved due to the cluster-based variable reconstruction strategy.An adaptive search step size strategy is proposed to balance exploration and exploitation further.Experimental comparisons with four state-of-the-art SAEAs are conducted on benchmark EMOPs with up to 1000 decision variables and an aerodynamic design task.Experimental results demonstrate that VREA obtains well-converged and diverse solutions with limited real FEs.展开更多
Conventional pit excavation engineering methods often struggle to manage the complex deformation patterns associated with asymmetric excavations,resulting in significant safety risks and increased project costs.These ...Conventional pit excavation engineering methods often struggle to manage the complex deformation patterns associated with asymmetric excavations,resulting in significant safety risks and increased project costs.These challenges highlight the need for more precise and efficient design methodologies to ensure structural stability and economic feasibility.This research proposes an innovative automatic optimization inverse design method(AOIDM)that integrates an enhanced genetic algorithm(EGA)with a multiobjective optimization model.By combining advanced computational techniques with engineering principles,this approach improves search efficiency by 30%and enhances deformation control accuracy by 25%.Additionally,the approach exhibits potential for reducing carbon emissions to align with sustainable engineering goals.The effectiveness of this approach was validated through comprehensive data analysis and practical case studies,demonstrating its ability to optimize retaining structure designs under complex asymmetric loading conditions.This research establishes a new standard for precision and efficiency in automated excavation design,with accompanying improvements in safety and cost-effectiveness.Furthermore,it lays the foundation for future geotechnical engineering advancements,offering a robust solution to one of the most challenging aspects of modern excavation projects.展开更多
Path planning is a fundamental component in robotics and game artificial intelligence that considerably influences the motion efficiency of robots and unmanned aerial vehicles,as well as the realism and immersion of v...Path planning is a fundamental component in robotics and game artificial intelligence that considerably influences the motion efficiency of robots and unmanned aerial vehicles,as well as the realism and immersion of virtual environments.However,traditional algorithms are often limited to single-objective optimization and lack real-time adaptability to dynamic environments.This study addresses these limitations through a proposed realtime dynamic multiobjective(RDMO)path-planning algorithm based on an enhanced A^(*) framework.The proposed algorithm employs a queue-based structure and composite multiheuristic functions to dynamically manage game tasks and compute optimal paths under changing-map-connectivity conditions in real time.Simulation experiments are conducted using real-world road network data and benchmarked against mainstream hybrid approaches based on genetic algorithms(GAs)and simulated annealing(SA).The results show that the computational speed of the RDMO algorithm is 88 and 73 times faster than that of the GA-and SA-based solutions,respectively,while the total planned path length is reduced by 58%and 33%,respectively.In addition,the RDMO algorithm also shows excellent responsiveness to dynamic changes in map connectivity and can achieve real-time replanning with a minimal computational overhead.The research results prove that the RDMO algorithm provides a robust and efficient solution for multiobjective path planning in games and robotics applications and has a great application potential in improving system performance and user experience in related fields in the future.展开更多
This paper deals with extensions of higher-order optimality conditions for scalar optimization to multiobjective optimization.A type of directional derivatives for a multiobjective function is proposed,and with this n...This paper deals with extensions of higher-order optimality conditions for scalar optimization to multiobjective optimization.A type of directional derivatives for a multiobjective function is proposed,and with this notion characterizations of strict local minima of order k for a multiobjective optimization problem with a nonempty set constraint are established,generalizing the corresponding scalar case obtained by Studniarski[3].Also necessary not sufficient and sufficient not necessary optimality conditions for this minima are derived based on our directional derivatives,which are generalizations of some existing scalar results and equivalent to some existing multiobjective ones.Many examples are given to illustrate them there.展开更多
To realize Industry 5.0,manufacturers face various optimization problems that seldom appear in isolation.Evolutionary MultiTasking(EMT)is an effective method to solve multiple related problems by extracting and utiliz...To realize Industry 5.0,manufacturers face various optimization problems that seldom appear in isolation.Evolutionary MultiTasking(EMT)is an effective method to solve multiple related problems by extracting and utilizing common knowledge.Knowledge transfer is the key to the effectiveness of EMT.Existing EMT methods mainly focus on designing effective intertask learning methods and ignore the fact that provided knowledge's appropriateness also has a significant effect on EMT's performance.There is plentiful knowledge in assistant tasks,and knowledge transfer may not work well and even lead to a negative effect if useless knowledge is selected to guide target tasks.EMT is thus confronted with a challenge to find appropriate knowledge.This work proposes an efficient knowledge classification-assisted EMT framework to identify and select valuable knowledge from assistant tasks.During the evolution process,better-performing candidates are supposed to have advantages in exploitation.Therefore,assistant individuals that are similar to better-performing target individuals are used to provide positive knowledge.Specifically,the target sub-population is divided into different levels and then a classifier is trained to divide assistant sub-population.Considering that target and assistant sub-populations have different characteristics,we use domain adaptation to reduce their distribution discrepancies.In this way,the trained classifier can classify assistant individuals more accurately,and truly useful knowledge can be selected for target tasks.The superior performance of our proposed framework over state-of-the-art algorithms is verified via a series of benchmark problems.展开更多
Modern intelligent systems,such as autonomous vehicles and face recognition,must continuously adapt to new scenarios while preserving their ability to handle previously encountered situations.However,when neural netwo...Modern intelligent systems,such as autonomous vehicles and face recognition,must continuously adapt to new scenarios while preserving their ability to handle previously encountered situations.However,when neural networks learn new classes sequentially,they suffer from catastrophic forgetting—the tendency to lose knowledge of earlier classes.This challenge,which lies at the core of class-incremental learning,severely limits the deployment of continual learning systems in real-world applications with streaming data.Existing approaches,including rehearsalbased methods and knowledge distillation techniques,have attempted to address this issue but often struggle to effectively preserve decision boundaries and discriminative features under limited memory constraints.To overcome these limitations,we propose a support vector-guided framework for class-incremental learning.The framework integrates an enhanced feature extractor with a Support Vector Machine classifier,which generates boundary-critical support vectors to guide both replay and distillation.Building on this architecture,we design a joint feature retention strategy that combines boundary proximity with feature diversity,and a Support Vector Distillation Loss that enforces dual alignment in decision and semantic spaces.In addition,triple attention modules are incorporated into the feature extractor to enhance representation power.Extensive experiments on CIFAR-100 and Tiny-ImageNet demonstrate effective improvements.On CIFAR-100 and Tiny-ImageNet with 5 tasks,our method achieves 71.68%and 58.61%average accuracy,outperforming strong baselines by 3.34%and 2.05%.These advantages are consistently observed across different task splits,highlighting the robustness and generalization of the proposed approach.Beyond benchmark evaluations,the framework also shows potential in few-shot and resource-constrained applications such as edge computing and mobile robotics.展开更多
The development of clinical candidates that modify the natural progression of sporadic Parkinson's disease and related synucleinopathies is a praiseworthy endeavor,but extremely challenging.Therapeutic candidates ...The development of clinical candidates that modify the natural progression of sporadic Parkinson's disease and related synucleinopathies is a praiseworthy endeavor,but extremely challenging.Therapeutic candidates that were successful in preclinical Parkinson's disease animal models have repeatedly failed when tested in clinical trials.While these failures have many possible explanations,it is perhaps time to recognize that the problem lies with the animal models rather than the putative candidate.In other words,the lack of adequate animal models of Parkinson's disease currently represents the main barrier to preclinical identification of potential disease-modifying therapies likely to succeed in clinical trials.However,this barrier may be overcome by the recent introduction of novel generations of viral vectors coding for different forms of alpha-synuclein species and related genes.Although still facing several limitations,these models have managed to mimic the known neuropathological hallmarks of Parkinson's disease with unprecedented accuracy,delineating a more optimistic scenario for the near future.展开更多
Fluidic Thrust Vectoring(FTV)is used for the yaw attitude control of tailless flying wing,which can significantly improve stealth performance,maneuverability and lateral/heading maneuverability.The FTV control scheme ...Fluidic Thrust Vectoring(FTV)is used for the yaw attitude control of tailless flying wing,which can significantly improve stealth performance,maneuverability and lateral/heading maneuverability.The FTV control scheme of co-directional secondary flow was designed based on a 30 kgf thrust turbojet engine,an equivalent rudder deflection control variable of Mass Flow Combination(MFC)was proposed,and a control model was established to form a FTV control system scheme,which was integrated with the flight control system of a 100 kg tailless flying wing with medium aspect ratio to achieve closed-loop control of the yaw attitude based on FTV.The heading stability augmentation and maneuvering control characteristics and time response characteristics of tailless flying wing by FTV were quantitatively studied through virtual flight test in a wind tunnel at a wind speed of 35 m/s.The results show that the control strategy based on MFC achieves bidirectional continuous and stable control of thrust vector angle in a range of±11°,and the thrust vector angle varies monotonically with MFC;the co-directional FTV realizes bidirectional continuous and stable control of the yaw attitude of tailless flying wing,without longitudinal/lateral coupling moment.The increment of the maximum yawing moment coefficient is 0.0029,the maximum yaw rate is 7.55(°)/s,and the response time of the yaw rate of the vectoring nozzle actuated by the secondary flow is about 0.06 s,which satisfies the heading stability augmentation and maneuvering control response requirements of the aircraft with statically unstable heading,and provides new control means for the heading rudderless attitude control of tailless flying wing.展开更多
The advantages of genome selection(GS) in animal and plant breeding are self-evident.Traditional parametric models have disadvantage in better fit the increasingly large sequencing data and capture complex effects acc...The advantages of genome selection(GS) in animal and plant breeding are self-evident.Traditional parametric models have disadvantage in better fit the increasingly large sequencing data and capture complex effects accurately.Machine learning models have demonstrated remarkable potential in addressing these challenges.In this study,we introduced the concept of mixed kernel functions to explore the performance of support vector machine regression(SVR) in GS.Six single kernel functions(SVR_L,SVR_C,SVR_G,SVR_P,SVR_S,SVR_L) and four mixed kernel functions(SVR_GS,SVR_GP,SVR_LS,SVR_LP) were used to predict genome breeding values.The prediction accuracy,mean squared error(MSE) and mean absolute error(MAE) were used as evaluation indicators to compare with two traditional parametric models(GBLUP,BayesB) and two popular machine learning models(RF,KcRR).The results indicate that in most cases,the performance of the mixed kernel function model significantly outperforms that of GBLUP,BayesB and single kernel function.For instance,for T1 in the pig dataset,the predictive accuracy of SVR_GS is improved by 10% compared to GBLUP,and by approximately 4.4 and 18.6% compared to SVR_G and SVR_S respectively.For E1 in the wheat dataset,SVR_GS achieves 13.3% higher prediction accuracy than GBLUP.Among single kernel functions,the Laplacian and Gaussian kernel functions yield similar results,with the Gaussian kernel function performing better.The mixed kernel function notably reduces the MSE and MAE when compared to all single kernel functions.Furthermore,regarding runtime,SVR_GS and SVR_GP mixed kernel functions run approximately three times faster than GBLUP in the pig dataset,with only a slight increase in runtime compared to the single kernel function model.In summary,the mixed kernel function model of SVR demonstrates speed and accuracy competitiveness,and the model such as SVR_GS has important application potential for GS.展开更多
Disruption of host physiological processes,leading to symptom expression,is a common hallmark during plant virus infections.The concept of“symptoms as strategy”is rapidly reshaping our understanding of plant virolog...Disruption of host physiological processes,leading to symptom expression,is a common hallmark during plant virus infections.The concept of“symptoms as strategy”is rapidly reshaping our understanding of plant virology.An emerging theme is that symptom expressions—such as stunting,curling,and yellowing,which devastate yield—may themselves be evolved viral adaptation strategies rather than collateral damage.展开更多
Parkinson’s disease(PD)is a debilitating neurological disorder affecting over 10 million people worldwide.PD classification models using voice signals as input are common in the literature.It is believed that using d...Parkinson’s disease(PD)is a debilitating neurological disorder affecting over 10 million people worldwide.PD classification models using voice signals as input are common in the literature.It is believed that using deep learning algorithms further enhances performance;nevertheless,it is challenging due to the nature of small-scale and imbalanced PD datasets.This paper proposed a convolutional neural network-based deep support vector machine(CNN-DSVM)to automate the feature extraction process using CNN and extend the conventional SVM to a DSVM for better classification performance in small-scale PD datasets.A customized kernel function reduces the impact of biased classification towards the majority class(healthy candidates in our consideration).An improved generative adversarial network(IGAN)was designed to generate additional training data to enhance the model’s performance.For performance evaluation,the proposed algorithm achieves a sensitivity of 97.6%and a specificity of 97.3%.The performance comparison is evaluated from five perspectives,including comparisons with different data generation algorithms,feature extraction techniques,kernel functions,and existing works.Results reveal the effectiveness of the IGAN algorithm,which improves the sensitivity and specificity by 4.05%–4.72%and 4.96%–5.86%,respectively;and the effectiveness of the CNN-DSVM algorithm,which improves the sensitivity by 1.24%–57.4%and specificity by 1.04%–163%and reduces biased detection towards the majority class.The ablation experiments confirm the effectiveness of individual components.Two future research directions have also been suggested.展开更多
In order to meet the requirements of combustion optimization for saving energy and reducing pollutant emission simultaneously,an immune cell subsets based multiobjective optimization algorithm（ICSMOA）is proposed.In ...In order to meet the requirements of combustion optimization for saving energy and reducing pollutant emission simultaneously,an immune cell subsets based multiobjective optimization algorithm（ICSMOA）is proposed.In the ICSMOA,the subset division operator and the immunological tolerance operation are defined.Preference can be easily addressed by using the subset division operator,and the distribution of the solutions can be guaranteed by the immunological tolerance operation.Using the ICSMOA,a group of Pareto optimal solutions can be obtained.However,by the traditional weighting method（WM）,only one solution can be obtained and it cannot be judged as Pareto optimal or not.In contrast to the solutions obtained by the repeatedly performed WM,the simulation results show that most solutions obtained by the ICSMOA are better than the solutions obtained by the WM.In addition,the Pareto front obtained by the ICSMOA is not as uniform as most classical multiobjective optimization algorithms.More optimal solutions which meet the preference set by the decision-maker can be obtained and they are very useful for industrial application.展开更多
Regularization inversion uses constraints and a regularization factor to solve ill- posed inversion problems in geophysics. The choice of the regularization factor and of the initial model is critical in regularizatio...Regularization inversion uses constraints and a regularization factor to solve ill- posed inversion problems in geophysics. The choice of the regularization factor and of the initial model is critical in regularization inversion. To deal with these problems, we propose a multiobjective particle swarm inversion （MOPSOI） algorithm to simultaneously minimize the data misfit and model constraints, and obtain a multiobjective inversion solution set without the gradient information of the objective function and the regularization factor. We then choose the optimum solution from the solution set based on the trade-off between data misfit and constraints that substitute for the regularization factor. The inversion of synthetic two-dimensional magnetic data suggests that the MOPSOI algorithm can obtain as many feasible solutions as possible; thus, deeper insights of the inversion process can be gained and more reasonable solutions can be obtained by balancing the data misfit and constraints. The proposed MOPSOI algorithm can deal with the problems of choosing the right regularization factor and the initial model.展开更多
A systematic and effective optimization is proposed for the design of a three-dimensional （3-D） vehicle suspension model with eight degrees of freedom （DOF）, including vertical seat motion, vehicle suspension, pit...A systematic and effective optimization is proposed for the design of a three-dimensional （3-D） vehicle suspension model with eight degrees of freedom （DOF）, including vertical seat motion, vehicle suspension, pitching and rolling motions, and vertical wheel motions using the evolutionary game theory. A new design of the passive suspension is aided by game theory to attain the best compromise between ride quality and suspension deflections. Extensive simulations are performed on three type road surface models A, B, C pavement grades based on the guidelines provided by ISO-2631 with the Matlab/Simulink environment. The preliminary results show that, when the passive suspension is optimized via the proposed approach, a substantial improvement in the vertical ride quality is obtained while keeping the suspension deflections within their allowable clearance when the vehicle moves at a constant velocity v=20 m/s, and the comfort performance of a suspension seat can be enhanced by 20%-30%.展开更多
In order to incorporate the decision maker＇s preference into multiobjective optimization a preference-based multiobjective artificial bee colony algorithm PMABCA is proposed.In the proposed algorithm a novel referenc...In order to incorporate the decision maker＇s preference into multiobjective optimization a preference-based multiobjective artificial bee colony algorithm PMABCA is proposed.In the proposed algorithm a novel reference point based preference expression method is addressed.The fitness assignment function is defined based on the nondominated rank and the newly defined preference distance.An archive set is introduced for saving the nondominated solutions and an improved crowding-distance operator is addressed to remove the extra solutions in the archive.The experimental results of two benchmark test functions show that a preferred set of solutions and some other non-preference solutions are achieved simultaneously.The simulation results of the proportional-integral-derivative PID parameter optimization for superheated steam temperature verify that the PMABCA is efficient in aiding to making a reasonable decision.展开更多
In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficie...In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficient solutions of the same multiobjectiveprogramming problem, but the converse is not true. In a ceratin sense , these solutionsare in fact better than any other Pareto efficient solutions. Some basic theorems whichcharacterize major-efficient solutions and weakly major-efficient solutions of multiobjective programming are stated and proved. Furthermore,the existence and some geometricproperties of these solutions are studied.展开更多
A class of quasi-equilibrium problems and a class of constrained multiobjective games were introduced and studied in generalized convex spaces without linear structure. First, two existence theorems of solutions for q...A class of quasi-equilibrium problems and a class of constrained multiobjective games were introduced and studied in generalized convex spaces without linear structure. First, two existence theorems of solutions for quasi-equilibrium problems are proved in noncompact generalized convex spaces. Then, ar applications of the quasi-equilibrium existence theorem, several existence theorems of weighted Nash-equilibria and Pareto equilibria for the constrained multiobjective games are established in noncompact generalized convex spaces. These theorems improve, unify, and generalize the corresponding results of the multiobjective games in recent literatures.展开更多
In industrial amine plants the optimized operating conditions are obtained from the conclusion of occurred events and challenges that are normal in the working units. For the sake of reducing the costs, time consuming...In industrial amine plants the optimized operating conditions are obtained from the conclusion of occurred events and challenges that are normal in the working units. For the sake of reducing the costs, time consuming, and preventing unsuitable accidents, the optimization could be performed by a computer program. In this paper, simulation and parameter analysis of amine plant is performed at first. The optimization of this unit is studied using Non-Dominated Sorting Genetic Algorithm-II in order to produce sweet gas with CO 2 mole percentage less than 2.0% and H 2 S concentration less than 10 ppm for application in Fischer-Tropsch synthesis. The simulation of the plant in HYSYS v.3.1 software has been linked with MATLAB code for real-parameter NSGA-II to simulate and optimize the amine process. Three scenarios are selected to cover the effect of （DEA/MDEA） mass composition percent ratio at amine solution on objective functions. Results show that sour gas temperature and pressure of 33.98 ？ C and 14.96 bar, DEA/CO 2 molar flow ratio of 12.58, regeneration gas temperature and pressure of 94.92 ？ C and 3.0 bar, regenerator pressure of 1.53 bar, and ratio of DEA/MDEA = 20%/10% are the best values for minimizing plant energy consumption, amine circulation rate, and carbon dioxide recovery.展开更多
基金Foundation item： Supported by the National Natural Science Foundation of China（70071026）
文摘This paper deals with the connectedness of the cone-efficient solution set for vector optimization in locally convex Hausdorff topological vector spaces. The connectedness of the cone-efficient solution set is proved for multiobjective programming defined by a continuous one-to-one cone-quasiconvex mapping on a compact convex set of alternatives. During the proof, the generalized saddle theorem plays a key role.
基金supported by the Postgraduate Research and Practice Innovation Program of Jiangsu Province(Grant No.SJCX24_0161)the National Natural Science Foundation of China(Grant Nos.61374153 and 61403199).
文摘To optimize the operating efficiency and extend the lifespan of the multistack fuel cell hybrid system(MFCHS),this paper proposes a two-layer multiobjective optimal energy management strategy that considers the degradation of the fuel cell and the battery.Regarding the issues that power fluctuations damage the fuel cells'lifespan and high-current charging and discharging lead to battery capacity decay,the first layer of the strategy adopts locally weighted scatterplot smoothing(LOWESS)to smooth the output power of the fuel cells and prevent the battery from operating under high-current conditions.The second layer considers the uneven degree of degradation among the fuel cells and employs the dandelion optimizer(DO)algorithm to solve the objective function with an aging adaptive factor,optimizing the efficiency and lifespan.Meanwhile,the DO algorithm is enhanced by tent chaotic mapping and differential variation to improve the convergence speed and accuracy.Compared with the equivalent hydrogen consumption minimization strategy(ECMS)and the equal distribution strategy,the proposed strategy improves the average operating efficiency of the fuel cells,effectively reduces the degradation of the fuel cells and the capacity degradation of the battery,and maintains the performance consistency among the fuel cells.
基金supported by the National Natural Science Foundation of China(U20A20306,62276191)the Fundamental Research Funds for the Central Universities(HUST2023JYCXJJ011).
文摘Expensive multiobjective optimization problems(EMOPs)are complex optimization problems exacted from realworld applications,where each objective function evaluation(FE)involves expensive computations or physical experiments.Many surrogate-assisted evolutionary algorithms(SAEAs)have been designed to solve EMOPs.Nevertheless,EMOPs with large-scale decision variables remain challenging for existing SAEAs,leading to difficulties in maintaining convergence and diversity.To address this deficiency,we proposed a variable reconstructionbased SAEA(VREA)to balance convergence enhancement and diversity maintenance.Generally,a cluster-based variable reconstruction strategy reconstructs the original large-scale decision variables into low-dimensional weight variables.Thus,the population can be rapidly pushed towards the Pareto set(PS)by optimizing low-dimensional weight variables with the assistance of surrogate models.Population diversity is improved due to the cluster-based variable reconstruction strategy.An adaptive search step size strategy is proposed to balance exploration and exploitation further.Experimental comparisons with four state-of-the-art SAEAs are conducted on benchmark EMOPs with up to 1000 decision variables and an aerodynamic design task.Experimental results demonstrate that VREA obtains well-converged and diverse solutions with limited real FEs.
基金supported by the National Key R&D Program of China(Grant No.2023YFC3009400)the National Natural Science Foundation of China(Grant Nos.52238009 and 52208344).
文摘Conventional pit excavation engineering methods often struggle to manage the complex deformation patterns associated with asymmetric excavations,resulting in significant safety risks and increased project costs.These challenges highlight the need for more precise and efficient design methodologies to ensure structural stability and economic feasibility.This research proposes an innovative automatic optimization inverse design method(AOIDM)that integrates an enhanced genetic algorithm(EGA)with a multiobjective optimization model.By combining advanced computational techniques with engineering principles,this approach improves search efficiency by 30%and enhances deformation control accuracy by 25%.Additionally,the approach exhibits potential for reducing carbon emissions to align with sustainable engineering goals.The effectiveness of this approach was validated through comprehensive data analysis and practical case studies,demonstrating its ability to optimize retaining structure designs under complex asymmetric loading conditions.This research establishes a new standard for precision and efficiency in automated excavation design,with accompanying improvements in safety and cost-effectiveness.Furthermore,it lays the foundation for future geotechnical engineering advancements,offering a robust solution to one of the most challenging aspects of modern excavation projects.
基金supported by the National Research Foundation of Korea(NRF)grant funded by the Korea government(MSIT)(NRF-2023R1A2C1005950).
文摘Path planning is a fundamental component in robotics and game artificial intelligence that considerably influences the motion efficiency of robots and unmanned aerial vehicles,as well as the realism and immersion of virtual environments.However,traditional algorithms are often limited to single-objective optimization and lack real-time adaptability to dynamic environments.This study addresses these limitations through a proposed realtime dynamic multiobjective(RDMO)path-planning algorithm based on an enhanced A^(*) framework.The proposed algorithm employs a queue-based structure and composite multiheuristic functions to dynamically manage game tasks and compute optimal paths under changing-map-connectivity conditions in real time.Simulation experiments are conducted using real-world road network data and benchmarked against mainstream hybrid approaches based on genetic algorithms(GAs)and simulated annealing(SA).The results show that the computational speed of the RDMO algorithm is 88 and 73 times faster than that of the GA-and SA-based solutions,respectively,while the total planned path length is reduced by 58%and 33%,respectively.In addition,the RDMO algorithm also shows excellent responsiveness to dynamic changes in map connectivity and can achieve real-time replanning with a minimal computational overhead.The research results prove that the RDMO algorithm provides a robust and efficient solution for multiobjective path planning in games and robotics applications and has a great application potential in improving system performance and user experience in related fields in the future.
文摘This paper deals with extensions of higher-order optimality conditions for scalar optimization to multiobjective optimization.A type of directional derivatives for a multiobjective function is proposed,and with this notion characterizations of strict local minima of order k for a multiobjective optimization problem with a nonempty set constraint are established,generalizing the corresponding scalar case obtained by Studniarski[3].Also necessary not sufficient and sufficient not necessary optimality conditions for this minima are derived based on our directional derivatives,which are generalizations of some existing scalar results and equivalent to some existing multiobjective ones.Many examples are given to illustrate them there.
基金supported in part by the National Natural Science Foundation of China(51775385)the Natural Science Foundation of Shanghai(23ZR1466000)+2 种基金the Shanghai Industrial Collaborative Science and Technology Innovation Project(2021-cyxt2-kj10)the Innovation Program of Shanghai Municipal Education Commission(202101070007E00098)Tongxiang Institute of Artificial General Intelligence(TAGI2-A-2024-0006).
文摘To realize Industry 5.0,manufacturers face various optimization problems that seldom appear in isolation.Evolutionary MultiTasking(EMT)is an effective method to solve multiple related problems by extracting and utilizing common knowledge.Knowledge transfer is the key to the effectiveness of EMT.Existing EMT methods mainly focus on designing effective intertask learning methods and ignore the fact that provided knowledge's appropriateness also has a significant effect on EMT's performance.There is plentiful knowledge in assistant tasks,and knowledge transfer may not work well and even lead to a negative effect if useless knowledge is selected to guide target tasks.EMT is thus confronted with a challenge to find appropriate knowledge.This work proposes an efficient knowledge classification-assisted EMT framework to identify and select valuable knowledge from assistant tasks.During the evolution process,better-performing candidates are supposed to have advantages in exploitation.Therefore,assistant individuals that are similar to better-performing target individuals are used to provide positive knowledge.Specifically,the target sub-population is divided into different levels and then a classifier is trained to divide assistant sub-population.Considering that target and assistant sub-populations have different characteristics,we use domain adaptation to reduce their distribution discrepancies.In this way,the trained classifier can classify assistant individuals more accurately,and truly useful knowledge can be selected for target tasks.The superior performance of our proposed framework over state-of-the-art algorithms is verified via a series of benchmark problems.
基金supported by the Gansu Provincial Natural Science Foundation(grant number 25JRRA074)the Gansu Provincial Key R&D Science and Technology Program(grant number 24YFGA060)the National Natural Science Foundation of China(grant number 62161019).
文摘Modern intelligent systems,such as autonomous vehicles and face recognition,must continuously adapt to new scenarios while preserving their ability to handle previously encountered situations.However,when neural networks learn new classes sequentially,they suffer from catastrophic forgetting—the tendency to lose knowledge of earlier classes.This challenge,which lies at the core of class-incremental learning,severely limits the deployment of continual learning systems in real-world applications with streaming data.Existing approaches,including rehearsalbased methods and knowledge distillation techniques,have attempted to address this issue but often struggle to effectively preserve decision boundaries and discriminative features under limited memory constraints.To overcome these limitations,we propose a support vector-guided framework for class-incremental learning.The framework integrates an enhanced feature extractor with a Support Vector Machine classifier,which generates boundary-critical support vectors to guide both replay and distillation.Building on this architecture,we design a joint feature retention strategy that combines boundary proximity with feature diversity,and a Support Vector Distillation Loss that enforces dual alignment in decision and semantic spaces.In addition,triple attention modules are incorporated into the feature extractor to enhance representation power.Extensive experiments on CIFAR-100 and Tiny-ImageNet demonstrate effective improvements.On CIFAR-100 and Tiny-ImageNet with 5 tasks,our method achieves 71.68%and 58.61%average accuracy,outperforming strong baselines by 3.34%and 2.05%.These advantages are consistently observed across different task splits,highlighting the robustness and generalization of the proposed approach.Beyond benchmark evaluations,the framework also shows potential in few-shot and resource-constrained applications such as edge computing and mobile robotics.
基金supported by grants PID2020-120308RB-I00 and PID2023-147802OB-I00 funded by MICIU/AEI/10.13039/501100011033FEDER,UE,by Aligning Science Across Parkinson’s(ref.ASAP-020505)through the Michael J.Fox Foundation for Parkinson’s Research+1 种基金by CiberNed Intramural Collaborative Projects(ref.PI2020/09)by the Spanish Fundación Mutua Madrile?a de Investigación Médica(to JLL)。
文摘The development of clinical candidates that modify the natural progression of sporadic Parkinson's disease and related synucleinopathies is a praiseworthy endeavor,but extremely challenging.Therapeutic candidates that were successful in preclinical Parkinson's disease animal models have repeatedly failed when tested in clinical trials.While these failures have many possible explanations,it is perhaps time to recognize that the problem lies with the animal models rather than the putative candidate.In other words,the lack of adequate animal models of Parkinson's disease currently represents the main barrier to preclinical identification of potential disease-modifying therapies likely to succeed in clinical trials.However,this barrier may be overcome by the recent introduction of novel generations of viral vectors coding for different forms of alpha-synuclein species and related genes.Although still facing several limitations,these models have managed to mimic the known neuropathological hallmarks of Parkinson's disease with unprecedented accuracy,delineating a more optimistic scenario for the near future.
文摘Fluidic Thrust Vectoring(FTV)is used for the yaw attitude control of tailless flying wing,which can significantly improve stealth performance,maneuverability and lateral/heading maneuverability.The FTV control scheme of co-directional secondary flow was designed based on a 30 kgf thrust turbojet engine,an equivalent rudder deflection control variable of Mass Flow Combination(MFC)was proposed,and a control model was established to form a FTV control system scheme,which was integrated with the flight control system of a 100 kg tailless flying wing with medium aspect ratio to achieve closed-loop control of the yaw attitude based on FTV.The heading stability augmentation and maneuvering control characteristics and time response characteristics of tailless flying wing by FTV were quantitatively studied through virtual flight test in a wind tunnel at a wind speed of 35 m/s.The results show that the control strategy based on MFC achieves bidirectional continuous and stable control of thrust vector angle in a range of±11°,and the thrust vector angle varies monotonically with MFC;the co-directional FTV realizes bidirectional continuous and stable control of the yaw attitude of tailless flying wing,without longitudinal/lateral coupling moment.The increment of the maximum yawing moment coefficient is 0.0029,the maximum yaw rate is 7.55(°)/s,and the response time of the yaw rate of the vectoring nozzle actuated by the secondary flow is about 0.06 s,which satisfies the heading stability augmentation and maneuvering control response requirements of the aircraft with statically unstable heading,and provides new control means for the heading rudderless attitude control of tailless flying wing.
基金supported by the China Agriculture Research System of MOF and MARAthe National Natural Science Foundation of China (31872337 and 31501919)the Agricultural Science and Technology Innovation Project,China (ASTIP-IAS02)。
文摘The advantages of genome selection(GS) in animal and plant breeding are self-evident.Traditional parametric models have disadvantage in better fit the increasingly large sequencing data and capture complex effects accurately.Machine learning models have demonstrated remarkable potential in addressing these challenges.In this study,we introduced the concept of mixed kernel functions to explore the performance of support vector machine regression(SVR) in GS.Six single kernel functions(SVR_L,SVR_C,SVR_G,SVR_P,SVR_S,SVR_L) and four mixed kernel functions(SVR_GS,SVR_GP,SVR_LS,SVR_LP) were used to predict genome breeding values.The prediction accuracy,mean squared error(MSE) and mean absolute error(MAE) were used as evaluation indicators to compare with two traditional parametric models(GBLUP,BayesB) and two popular machine learning models(RF,KcRR).The results indicate that in most cases,the performance of the mixed kernel function model significantly outperforms that of GBLUP,BayesB and single kernel function.For instance,for T1 in the pig dataset,the predictive accuracy of SVR_GS is improved by 10% compared to GBLUP,and by approximately 4.4 and 18.6% compared to SVR_G and SVR_S respectively.For E1 in the wheat dataset,SVR_GS achieves 13.3% higher prediction accuracy than GBLUP.Among single kernel functions,the Laplacian and Gaussian kernel functions yield similar results,with the Gaussian kernel function performing better.The mixed kernel function notably reduces the MSE and MAE when compared to all single kernel functions.Furthermore,regarding runtime,SVR_GS and SVR_GP mixed kernel functions run approximately three times faster than GBLUP in the pig dataset,with only a slight increase in runtime compared to the single kernel function model.In summary,the mixed kernel function model of SVR demonstrates speed and accuracy competitiveness,and the model such as SVR_GS has important application potential for GS.
基金supported by the National Natural Science Foundation of China(32272482)the Innovation Research 2035 Pilot Plan of Southwest University(SWU-XDZD22002).
文摘Disruption of host physiological processes,leading to symptom expression,is a common hallmark during plant virus infections.The concept of“symptoms as strategy”is rapidly reshaping our understanding of plant virology.An emerging theme is that symptom expressions—such as stunting,curling,and yellowing,which devastate yield—may themselves be evolved viral adaptation strategies rather than collateral damage.
基金The work described in this paper was fully supported by a grant from Hong Kong Metropolitan University(RIF/2021/05).
文摘Parkinson’s disease(PD)is a debilitating neurological disorder affecting over 10 million people worldwide.PD classification models using voice signals as input are common in the literature.It is believed that using deep learning algorithms further enhances performance;nevertheless,it is challenging due to the nature of small-scale and imbalanced PD datasets.This paper proposed a convolutional neural network-based deep support vector machine(CNN-DSVM)to automate the feature extraction process using CNN and extend the conventional SVM to a DSVM for better classification performance in small-scale PD datasets.A customized kernel function reduces the impact of biased classification towards the majority class(healthy candidates in our consideration).An improved generative adversarial network(IGAN)was designed to generate additional training data to enhance the model’s performance.For performance evaluation,the proposed algorithm achieves a sensitivity of 97.6%and a specificity of 97.3%.The performance comparison is evaluated from five perspectives,including comparisons with different data generation algorithms,feature extraction techniques,kernel functions,and existing works.Results reveal the effectiveness of the IGAN algorithm,which improves the sensitivity and specificity by 4.05%–4.72%and 4.96%–5.86%,respectively;and the effectiveness of the CNN-DSVM algorithm,which improves the sensitivity by 1.24%–57.4%and specificity by 1.04%–163%and reduces biased detection towards the majority class.The ablation experiments confirm the effectiveness of individual components.Two future research directions have also been suggested.
基金The National Natural Science Foundation of China(No.51036002,51076027)the Key Project of Ministry of Education of China(No.108060)
文摘In order to meet the requirements of combustion optimization for saving energy and reducing pollutant emission simultaneously,an immune cell subsets based multiobjective optimization algorithm（ICSMOA）is proposed.In the ICSMOA,the subset division operator and the immunological tolerance operation are defined.Preference can be easily addressed by using the subset division operator,and the distribution of the solutions can be guaranteed by the immunological tolerance operation.Using the ICSMOA,a group of Pareto optimal solutions can be obtained.However,by the traditional weighting method（WM）,only one solution can be obtained and it cannot be judged as Pareto optimal or not.In contrast to the solutions obtained by the repeatedly performed WM,the simulation results show that most solutions obtained by the ICSMOA are better than the solutions obtained by the WM.In addition,the Pareto front obtained by the ICSMOA is not as uniform as most classical multiobjective optimization algorithms.More optimal solutions which meet the preference set by the decision-maker can be obtained and they are very useful for industrial application.
基金supported by the Natural Science Foundation of China(No.61273179)Department of Education,Science and Technology Research Project of Hubei Province of China(No.D20131206,No.20141304)
文摘Regularization inversion uses constraints and a regularization factor to solve ill- posed inversion problems in geophysics. The choice of the regularization factor and of the initial model is critical in regularization inversion. To deal with these problems, we propose a multiobjective particle swarm inversion （MOPSOI） algorithm to simultaneously minimize the data misfit and model constraints, and obtain a multiobjective inversion solution set without the gradient information of the objective function and the regularization factor. We then choose the optimum solution from the solution set based on the trade-off between data misfit and constraints that substitute for the regularization factor. The inversion of synthetic two-dimensional magnetic data suggests that the MOPSOI algorithm can obtain as many feasible solutions as possible; thus, deeper insights of the inversion process can be gained and more reasonable solutions can be obtained by balancing the data misfit and constraints. The proposed MOPSOI algorithm can deal with the problems of choosing the right regularization factor and the initial model.
基金Supported by Program for New Century Excellent Talents in University (070003)the Natural Science Foundation of Anhui Province (070414154)~~
文摘A systematic and effective optimization is proposed for the design of a three-dimensional （3-D） vehicle suspension model with eight degrees of freedom （DOF）, including vertical seat motion, vehicle suspension, pitching and rolling motions, and vertical wheel motions using the evolutionary game theory. A new design of the passive suspension is aided by game theory to attain the best compromise between ride quality and suspension deflections. Extensive simulations are performed on three type road surface models A, B, C pavement grades based on the guidelines provided by ISO-2631 with the Matlab/Simulink environment. The preliminary results show that, when the passive suspension is optimized via the proposed approach, a substantial improvement in the vertical ride quality is obtained while keeping the suspension deflections within their allowable clearance when the vehicle moves at a constant velocity v=20 m/s, and the comfort performance of a suspension seat can be enhanced by 20%-30%.
基金The National Natural Science Foundation of China(No.51306082,51476027)
文摘In order to incorporate the decision maker＇s preference into multiobjective optimization a preference-based multiobjective artificial bee colony algorithm PMABCA is proposed.In the proposed algorithm a novel reference point based preference expression method is addressed.The fitness assignment function is defined based on the nondominated rank and the newly defined preference distance.An archive set is introduced for saving the nondominated solutions and an improved crowding-distance operator is addressed to remove the extra solutions in the archive.The experimental results of two benchmark test functions show that a preferred set of solutions and some other non-preference solutions are achieved simultaneously.The simulation results of the proportional-integral-derivative PID parameter optimization for superheated steam temperature verify that the PMABCA is efficient in aiding to making a reasonable decision.
文摘In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficient solutions of the same multiobjectiveprogramming problem, but the converse is not true. In a ceratin sense , these solutionsare in fact better than any other Pareto efficient solutions. Some basic theorems whichcharacterize major-efficient solutions and weakly major-efficient solutions of multiobjective programming are stated and proved. Furthermore,the existence and some geometricproperties of these solutions are studied.
文摘A class of quasi-equilibrium problems and a class of constrained multiobjective games were introduced and studied in generalized convex spaces without linear structure. First, two existence theorems of solutions for quasi-equilibrium problems are proved in noncompact generalized convex spaces. Then, ar applications of the quasi-equilibrium existence theorem, several existence theorems of weighted Nash-equilibria and Pareto equilibria for the constrained multiobjective games are established in noncompact generalized convex spaces. These theorems improve, unify, and generalize the corresponding results of the multiobjective games in recent literatures.
文摘In industrial amine plants the optimized operating conditions are obtained from the conclusion of occurred events and challenges that are normal in the working units. For the sake of reducing the costs, time consuming, and preventing unsuitable accidents, the optimization could be performed by a computer program. In this paper, simulation and parameter analysis of amine plant is performed at first. The optimization of this unit is studied using Non-Dominated Sorting Genetic Algorithm-II in order to produce sweet gas with CO 2 mole percentage less than 2.0% and H 2 S concentration less than 10 ppm for application in Fischer-Tropsch synthesis. The simulation of the plant in HYSYS v.3.1 software has been linked with MATLAB code for real-parameter NSGA-II to simulate and optimize the amine process. Three scenarios are selected to cover the effect of （DEA/MDEA） mass composition percent ratio at amine solution on objective functions. Results show that sour gas temperature and pressure of 33.98 ？ C and 14.96 bar, DEA/CO 2 molar flow ratio of 12.58, regeneration gas temperature and pressure of 94.92 ？ C and 3.0 bar, regenerator pressure of 1.53 bar, and ratio of DEA/MDEA = 20%/10% are the best values for minimizing plant energy consumption, amine circulation rate, and carbon dioxide recovery.
