Path planning for Unmanned Aerial Vehicles(UAVs)in complex environments presents several challenges.Traditional algorithms often struggle with the complexity of high-dimensional search spaces,leading to inefficiencies...Path planning for Unmanned Aerial Vehicles(UAVs)in complex environments presents several challenges.Traditional algorithms often struggle with the complexity of high-dimensional search spaces,leading to inefficiencies.Additionally,the non-linear nature of cost functions can cause algorithms to become trapped in local optima.Furthermore,there is often a lack of adequate consideration for real-world constraints,for example,due to the necessity for obstacle avoidance or because of the restrictions of flight safety.To address the aforementioned issues,this paper proposes a dynamic weighted spherical particle swarm optimization(DW-SPSO)algorithm.The algorithm adopts a dual Sigmoid-based adaptive weight adjustment mechanism for balancing global exploration and local exploitation,as well as a lens-based opposition learning one to improve search flexibility and solution diversity.Simulation experiments on real digital elevation models demonstrate that DW-SPSO significantly outperforms recent state-of-the-art particle swarm optimization(PSO)variants in terms of path safety,smoothness,and convergence speed.The performance superiority is statistically validated by the Wilcoxon signed-rank test.The results confirm the algorithm’s effectiveness in generating high-quality UAV paths under diverse threat conditions,offering a robust solution for autonomous navigation systems.展开更多
Concentrate copper grade(CCG)is one of the important production indicators of copper flotation processes,and keeping the CCG at the set value is of great significance to the economic benefit of copper flotation indust...Concentrate copper grade(CCG)is one of the important production indicators of copper flotation processes,and keeping the CCG at the set value is of great significance to the economic benefit of copper flotation industrial processes.This paper addresses the fluctuation problem of CCG through an operational optimization method.Firstly,a density-based affinity propagationalgorithm is proposed so that more ideal working condition categories can be obtained for the complex raw ore properties.Next,a Bayesian network(BN)is applied to explore the relationship between the operational variables and the CCG.Based on the analysis results of BN,a weighted Gaussian process regression model is constructed to predict the CCG that a higher prediction accuracy can be obtained.To ensure the predicted CCG is close to the set value with a smaller magnitude of the operation adjustments and a smaller uncertainty of the prediction results,an index-oriented adaptive differential evolution(IOADE)algorithm is proposed,and the convergence performance of IOADE is superior to the traditional differential evolution and adaptive differential evolution methods.Finally,the effectiveness and feasibility of the proposed methods are verified by the experiments on a copper flotation industrial process.展开更多
The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the intera...The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this paper.Initially,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision variables.If the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping grouping.Specifically,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision variables.The decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into subgroups.Finally,the decision variable with the strongest interaction is added to each subgroup.MOEAWOD minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different groups.MOEAWOD was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our methods.Compared with the other algorithms,our method is still at an advantage.展开更多
As a useful alternative of Shewhart control chart, exponentially weighted moving average （EWMA） control chat has been applied widely to quality control, process monitoring, forecast, etc. In this paper, a method was...As a useful alternative of Shewhart control chart, exponentially weighted moving average （EWMA） control chat has been applied widely to quality control, process monitoring, forecast, etc. In this paper, a method was introduced for optimal design of EWMA and multivariate EWMA （MEWMA） control charts, in which the optimal parameter pair （ λ, k） or （ λ, h ） was searched by using the generalized regression neural network （GRNN）. The results indicate that the optimal parameter pair can be obtained effectively by the proposed strategy for a given in-control average running length （ARLo） and shift to detect under any conditions, removing the drawback of incompleteness existing in the tables that had been reported.展开更多
This article presents a novel optimization approach called RSWTLBO for accurately identifying unknown parameters in photovoltaic(PV)models.The objective is to address challenges related to the detection and maintenanc...This article presents a novel optimization approach called RSWTLBO for accurately identifying unknown parameters in photovoltaic(PV)models.The objective is to address challenges related to the detection and maintenance of PV systems and the improvement of conversion efficiency.RSWTLBO combines adaptive parameter w,Single Solution Optimization Mechanism(SSOM),and Weight Probability Exploration Strategy(WPES)to enhance the optimization ability of TLBO.The algorithm achieves a balance between exploitation and exploration throughout the iteration process.The SSOM allows for local exploration around a single solution,improving solution quality and eliminating inferior solutions.The WPES enables comprehensive exploration of the solution space,avoiding the problem of getting trapped in local optima.The algo-rithm is evaluated by comparing it with 10 other competitive algorithms on various PV models.The results demonstrate that RSWTLBO consistently achieves the lowest Root Mean Square Errors on single diode models,double diode models,and PV module models.It also exhibits robust performance under varying irradiation and temperature conditions.The study concludes that RSWTLBO is a practical and effective algorithm for identifying unknown parameters in PV models.展开更多
The evolutionary strategy with a dynamic weighting schedule is proposed to find all the compromised solutions of the multi-objective integrated structure and control optimization problem, where the optimal system perf...The evolutionary strategy with a dynamic weighting schedule is proposed to find all the compromised solutions of the multi-objective integrated structure and control optimization problem, where the optimal system performance and control cost are defined by H2 or H∞ norms. During this optimization process, the weights are varying with the increasing generation instead of fixed values. The proposed strategy together with the linear matrix inequality （LMI） or the Riccati controller design method can find a series of uniformly distributed nondominated solutions in a single run. Therefore, this method can greatly reduce the computation intensity of the integrated optimization problem compared with the weight-based single objective genetic algorithm. Active automotive suspension is adopted as an example to illustrate the effectiveness of the proposed method.展开更多
A min-max optimization method is proposed as a new approach to deal with the weight determination problem in the context of the analytic hierarchy process. The priority is obtained through minimizing the maximal absol...A min-max optimization method is proposed as a new approach to deal with the weight determination problem in the context of the analytic hierarchy process. The priority is obtained through minimizing the maximal absolute difference between the weight vector obtained from each column and the ideal weight vector. By transformation, the. constrained min- max optimization problem is converted to a linear programming problem, which can be solved using either the simplex method or the interior method. The Karush-Kuhn- Tucker condition is also analytically provided. These control thresholds provide a straightforward indication of inconsistency of the pairwise comparison matrix. Numerical computations for several case studies are conducted to compare the performance of the proposed method with three existing methods. This observation illustrates that the min-max method controls maximum deviation and gives more weight to non- dominate factors.展开更多
In practical applications, the system observation error is widespread. If the observation equation of the system has not been verified or corrected under certain environmental conditions,the unknown system errors and ...In practical applications, the system observation error is widespread. If the observation equation of the system has not been verified or corrected under certain environmental conditions,the unknown system errors and filtering errors will come into being.The incremental observation equation is derived, which can eliminate the unknown observation errors effectively. Furthermore, an incremental Kalman smoother is presented. Moreover, a weighted measurement fusion incremental Kalman smoother applying the globally optimal weighted measurement fusion algorithm is given.The simulation results show their effectiveness and feasibility.展开更多
A light?weight design method of integrated structural topology and size co?optimization for the force?performance?structure of complex structural parts is presented in this paper. Firstly, the supporting function of a...A light?weight design method of integrated structural topology and size co?optimization for the force?performance?structure of complex structural parts is presented in this paper. Firstly, the supporting function of a complex structural part is built to map the force transmission, where the force exerted areas and constraints are considered as connecting structure and the structural configuration, to determine the part performance as well as the force routines. Then the connecting structure design model, aiming to optimize the static and dynamic performances on connection configuration, is developed, and the optimum design of the characteristic parameters is carried out by means of the collaborative optimization method, namely, the integrated structural topology optimization and size optimization. In this design model, the objective is to maximize the connecting stiffness. Based on the relationship between the force and the structural configuration of a part, the optimal force transmission routine that can meet the performance requirements is obtained using the structural topology optimization technology. Accordingly, the light?weight design of conceptual configuration for complex parts under multi?objective and multi?condition can be realized. Finally, based on the proposed collaborative optimization design method, the optimal performance and optimal structure of the complex parts with light weight are realized, and the reasonable structural unit configuration and size charac?teristic parameters are obtained. A bed structure of gantry?type machining center is designed by using the proposed light?weight structure design method in this paper, as an illustrative example. The bed after the design optimization is lighter 8% than original one, and the rail deformation is reduced by 5%. Moreover, the lightweight design of the bed is achieved with enhanced performance to show the effectiveness of the proposed method.展开更多
Based on conventional particle swarm optimization(PSO),this paper presents an efficient and reliable heuristic approach using PSO with an adaptive random inertia weight(ARIW)strategy,referred to as the ARIW-PSO algori...Based on conventional particle swarm optimization(PSO),this paper presents an efficient and reliable heuristic approach using PSO with an adaptive random inertia weight(ARIW)strategy,referred to as the ARIW-PSO algorithm,to build a multi-objective optimization model for reservoir operation.Using the triangular probability density function,the inertia weight is randomly generated,and the probability density function is automatically adjusted to make the inertia weight generally greater in the initial stage of evolution,which is suitable for global searches.In the evolution process,the inertia weight gradually decreases,which is beneficial to local searches.The performance of the ARIWPSO algorithm was investigated with some classical test functions,and the results were compared with those of the genetic algorithm(GA),the conventional PSO,and other improved PSO methods.Then,the ARIW-PSO algorithm was applied to multi-objective optimal dispatch of the Panjiakou Reservoir and multi-objective flood control operation of a reservoir group on the Luanhe River in China,including the Panjiakou Reservoir,Daheiting Reservoir,and Taolinkou Reservoir.The validity of the multi-objective optimization model for multi-reservoir systems based on the ARIW-PSO algorithm was verified.展开更多
Stress-based topology optimization is one of the most concerns of structural optimization and receives much attention in a wide range of engineering designs.To solve the inherent issues of stress-based topology optimi...Stress-based topology optimization is one of the most concerns of structural optimization and receives much attention in a wide range of engineering designs.To solve the inherent issues of stress-based topology optimization,many schemes are added to the conventional bi-directional evolutionary structural optimization(BESO)method in the previous studies.However,these schemes degrade the generality of BESO and increase the computational cost.This study proposes an improved topology optimization method for the continuum structures considering stress minimization in the framework of the conventional BESO method.A global stress measure constructed by p-norm function is treated as the objective function.To stabilize the optimization process,both qp-relaxation and sensitivity weight scheme are introduced.Design variables are updated by the conventional BESO method.Several 2D and 3D examples are used to demonstrate the validity of the proposed method.The results show that the optimization process can be stabilized by qp-relaxation.The value of q and p are crucial to reasonable solutions.The proposed sensitivity weight scheme further stabilizes the optimization process and evenly distributes the stress field.The computational efficiency of the proposed method is higher than the previous methods because it keeps the generality of BESO and does not need additional schemes.展开更多
Prediction of stability in SG(Smart Grid)is essential in maintaining consistency and reliability of power supply in grid infrastructure.Analyzing the fluctuations in power generation and consumption patterns of smart ...Prediction of stability in SG(Smart Grid)is essential in maintaining consistency and reliability of power supply in grid infrastructure.Analyzing the fluctuations in power generation and consumption patterns of smart cities assists in effectively managing continuous power supply in the grid.It also possesses a better impact on averting overloading and permitting effective energy storage.Even though many traditional techniques have predicted the consumption rate for preserving stability,enhancement is required in prediction measures with minimized loss.To overcome the complications in existing studies,this paper intends to predict stability from the smart grid stability prediction dataset using machine learning algorithms.To accomplish this,pre-processing is performed initially to handle missing values since it develops biased models when missing values are mishandled and performs feature scaling to normalize independent data features.Then,the pre-processed data are taken for training and testing.Following that,the regression process is performed using Modified PSO(Particle Swarm Optimization)optimized XGBoost Technique with dynamic inertia weight update,which analyses variables like gamma(G),reaction time(tau1–tau4),and power balance(p1–p4)for providing effective future stability in SG.Since PSO attains optimal solution by adjusting position through dynamic inertial weights,it is integrated with XGBoost due to its scalability and faster computational speed characteristics.The hyperparameters of XGBoost are fine-tuned in the training process for achieving promising outcomes on prediction.Regression results are measured through evaluation metrics such as MSE(Mean Square Error)of 0.011312781,MAE(Mean Absolute Error)of 0.008596322,and RMSE(Root Mean Square Error)of 0.010636156 and MAPE(Mean Absolute Percentage Error)value of 0.0052 which determine the efficacy of the system.展开更多
To improve the spectral characteristics of the high-order weighted compact nonlinear scheme(WCNS),optimized flux difference schemes are proposed.The disadvantages in previous optimization routines,i.e.,reducing formal...To improve the spectral characteristics of the high-order weighted compact nonlinear scheme(WCNS),optimized flux difference schemes are proposed.The disadvantages in previous optimization routines,i.e.,reducing formal orders,or extending stencil widths,are avoided in the new optimized schemes by utilizing fluxes from both cell-edges and cell-nodes.Optimizations are implemented with Fourier analysis for linear schemes and the approximate dispersion relation(ADR)for nonlinear schemes.Classical difference schemes are restored near discontinuities to suppress numerical oscillations with use of a shock sensor based on smoothness indicators.The results of several benchmark numerical tests indicate that the new optimized difference schemes outperform the classical schemes,in terms of accuracy and resolution for smooth wave and vortex,especially for long-time simulations.Using optimized schemes increases the total CPU time by less than 4%.展开更多
The Bald Eagle Search algorithm(BES)is an emerging meta-heuristic algorithm.The algorithm simulates the hunting behavior of eagles,and obtains an optimal solution through three stages,namely selection stage,search sta...The Bald Eagle Search algorithm(BES)is an emerging meta-heuristic algorithm.The algorithm simulates the hunting behavior of eagles,and obtains an optimal solution through three stages,namely selection stage,search stage and swooping stage.However,BES tends to drop-in local optimization and the maximum value of search space needs to be improved.To fill this research gap,we propose an improved bald eagle algorithm(CABES)that integrates Cauchy mutation and adaptive optimization to improve the performance of BES from local optima.Firstly,CABES introduces the Cauchy mutation strategy to adjust the step size of the selection stage,to select a better search range.Secondly,in the search stage,CABES updates the search position update formula by an adaptive weight factor to further promote the local optimization capability of BES.To verify the performance of CABES,the benchmark function of CEC2017 is used to simulate the algorithm.The findings of the tests are compared to those of the Particle Swarm Optimization algorithm(PSO),Whale Optimization Algorithm(WOA)and Archimedes Algorithm(AOA).The experimental results show that CABES can provide good exploration and development capabilities,and it has strong competitiveness in testing algorithms.Finally,CABES is applied to four constrained engineering problems and a groundwater engineeringmodel,which further verifies the effectiveness and efficiency of CABES in practical engineering problems.展开更多
Weighted vertex cover(WVC)is one of the most important combinatorial optimization problems.In this paper,we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted n...Weighted vertex cover(WVC)is one of the most important combinatorial optimization problems.In this paper,we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted networks.We first model the WVC problem as a general game on weighted networks.Under the framework of a game,we newly define several cover states to describe the WVC problem.Moreover,we reveal the relationship among these cover states of the weighted network and the strict Nash equilibriums(SNEs)of the game.Then,we propose a game-based asynchronous algorithm(GAA),which can theoretically guarantee that all cover states of vertices converging in an SNE with polynomial time.Subsequently,we improve the GAA by adding 2-hop and 3-hop adjustment mechanisms,termed the improved game-based asynchronous algorithm(IGAA),in which we prove that it can obtain a better solution to the WVC problem than using a the GAA.Finally,numerical simulations demonstrate that the proposed IGAA can obtain a better approximate solution in promising computation time compared with the existing representative algorithms.展开更多
This paper presents a method to reconstruct 3-D models of trees from terrestrial laser scan(TLS)point clouds.This method uses the weighted locally optimal projection(WLOP)and the AdTree method to reconstruct detailed ...This paper presents a method to reconstruct 3-D models of trees from terrestrial laser scan(TLS)point clouds.This method uses the weighted locally optimal projection(WLOP)and the AdTree method to reconstruct detailed 3-D tree models.To improve its representation accuracy,the WLOP algorithm is introduced to consolidate the point cloud.Its reconstruction accuracy is tested using a dataset of ten trees,and the one-sided Hausdorff distances between the input point clouds and the resulting 3-D models are measured.The experimental results show that the optimal projection modeling method has an average one-sided Hausdorff distance(mean)lower by 30.74%and 6.43%compared with AdTree and AdQSM methods,respectively.Furthermore,it has an average one-sided Hausdorff distance(RMS)lower by 29.95%and 12.28%compared with AdTree and AdQSM methods.Results show that the 3-D model generated fits closely to the input point cloud data and ensures a high geometrical accuracy.展开更多
This paper addresses the shortcomings of the Sparrow and Eagle Optimization Algorithm (SBOA) in terms of convergence accuracy, convergence speed, and susceptibility to local optima. To this end, an improved Sparrow an...This paper addresses the shortcomings of the Sparrow and Eagle Optimization Algorithm (SBOA) in terms of convergence accuracy, convergence speed, and susceptibility to local optima. To this end, an improved Sparrow and Eagle Optimization Algorithm (HS-SBOA) is proposed. Initially, the algorithm employs Iterative Mapping to generate an initial sparrow and eagle population, enhancing the diversity of the population during the global search phase. Subsequently, an adaptive weighting strategy is introduced during the exploration phase of the algorithm to achieve a balance between exploration and exploitation. Finally, to avoid the algorithm falling into local optima, a Cauchy mutation operation is applied to the current best individual. To validate the performance of the HS-SBOA algorithm, it was applied to the CEC2021 benchmark function set and three practical engineering problems, and compared with other optimization algorithms such as the Grey Wolf Optimization (GWO), Particle Swarm Optimization (PSO), and Whale Optimization Algorithm (WOA) to test the effectiveness of the improved algorithm. The simulation experimental results show that the HS-SBOA algorithm demonstrates significant advantages in terms of convergence speed and accuracy, thereby validating the effectiveness of its improved strategies.展开更多
Aiming to address the limitations of the standard Chimp Optimization Algorithm(ChOA),such as inadequate search ability and susceptibility to local optima in Unmanned Aerial Vehicle(UAV)path planning,this paper propose...Aiming to address the limitations of the standard Chimp Optimization Algorithm(ChOA),such as inadequate search ability and susceptibility to local optima in Unmanned Aerial Vehicle(UAV)path planning,this paper proposes a three-dimensional path planning method for UAVs based on the Improved Chimp Optimization Algorithm(IChOA).First,this paper models the terrain and obstacle environments spatially and formulates the total UAV flight cost function according to the constraints,transforming the path planning problem into an optimization problem with multiple constraints.Second,this paper enhances the diversity of the chimpanzee population by applying the Sine chaos mapping strategy and introduces a nonlinear convergence factor to improve the algorithm’s search accuracy and convergence speed.Finally,this paper proposes a dynamic adjustment strategy for the number of chimpanzee advance echelons,which effectively balances global exploration and local exploitation,significantly optimizing the algorithm’s search performance.To validate the effectiveness of the IChOA algorithm,this paper conducts experimental comparisons with eight different intelligent algorithms.The experimental results demonstrate that the IChOA outperforms the selected comparison algorithms in terms of practicality and robustness in UAV 3D path planning.It effectively solves the issues of efficiency in finding the shortest path and ensures high stability during execution.展开更多
基金supported by the National Natural Science Foundation of China(Grant No.62106092)the Natural Science Foundation of Fujian Province(Grant Nos.2024J01822,2025J01981)the Natural Science Foundation of Zhangzhou City(Grant No.ZZ2024J28).
文摘Path planning for Unmanned Aerial Vehicles(UAVs)in complex environments presents several challenges.Traditional algorithms often struggle with the complexity of high-dimensional search spaces,leading to inefficiencies.Additionally,the non-linear nature of cost functions can cause algorithms to become trapped in local optima.Furthermore,there is often a lack of adequate consideration for real-world constraints,for example,due to the necessity for obstacle avoidance or because of the restrictions of flight safety.To address the aforementioned issues,this paper proposes a dynamic weighted spherical particle swarm optimization(DW-SPSO)algorithm.The algorithm adopts a dual Sigmoid-based adaptive weight adjustment mechanism for balancing global exploration and local exploitation,as well as a lens-based opposition learning one to improve search flexibility and solution diversity.Simulation experiments on real digital elevation models demonstrate that DW-SPSO significantly outperforms recent state-of-the-art particle swarm optimization(PSO)variants in terms of path safety,smoothness,and convergence speed.The performance superiority is statistically validated by the Wilcoxon signed-rank test.The results confirm the algorithm’s effectiveness in generating high-quality UAV paths under diverse threat conditions,offering a robust solution for autonomous navigation systems.
基金supported in part by the National Key Research and Development Program of China(2021YFC2902703)the National Natural Science Foundation of China(62173078,61773105,61533007,61873049,61873053,61703085,61374147)。
文摘Concentrate copper grade(CCG)is one of the important production indicators of copper flotation processes,and keeping the CCG at the set value is of great significance to the economic benefit of copper flotation industrial processes.This paper addresses the fluctuation problem of CCG through an operational optimization method.Firstly,a density-based affinity propagationalgorithm is proposed so that more ideal working condition categories can be obtained for the complex raw ore properties.Next,a Bayesian network(BN)is applied to explore the relationship between the operational variables and the CCG.Based on the analysis results of BN,a weighted Gaussian process regression model is constructed to predict the CCG that a higher prediction accuracy can be obtained.To ensure the predicted CCG is close to the set value with a smaller magnitude of the operation adjustments and a smaller uncertainty of the prediction results,an index-oriented adaptive differential evolution(IOADE)algorithm is proposed,and the convergence performance of IOADE is superior to the traditional differential evolution and adaptive differential evolution methods.Finally,the effectiveness and feasibility of the proposed methods are verified by the experiments on a copper flotation industrial process.
基金supported in part by the Central Government Guides Local Science and TechnologyDevelopment Funds(Grant No.YDZJSX2021A038)in part by theNational Natural Science Foundation of China under(Grant No.61806138)in part by the China University Industry-University-Research Collaborative Innovation Fund(Future Network Innovation Research and Application Project)(Grant 2021FNA04014).
文摘The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this paper.Initially,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision variables.If the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping grouping.Specifically,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision variables.The decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into subgroups.Finally,the decision variable with the strongest interaction is added to each subgroup.MOEAWOD minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different groups.MOEAWOD was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our methods.Compared with the other algorithms,our method is still at an advantage.
基金Funded by the National Key Technologies R&D Programs of China (No.2002BA105C)
文摘As a useful alternative of Shewhart control chart, exponentially weighted moving average （EWMA） control chat has been applied widely to quality control, process monitoring, forecast, etc. In this paper, a method was introduced for optimal design of EWMA and multivariate EWMA （MEWMA） control charts, in which the optimal parameter pair （ λ, k） or （ λ, h ） was searched by using the generalized regression neural network （GRNN）. The results indicate that the optimal parameter pair can be obtained effectively by the proposed strategy for a given in-control average running length （ARLo） and shift to detect under any conditions, removing the drawback of incompleteness existing in the tables that had been reported.
基金supported in part by the Natural Science Foundation of Zhejiang Province(LTGS23E070001)National Natural Science Foundation of China(62076185,62301367).
文摘This article presents a novel optimization approach called RSWTLBO for accurately identifying unknown parameters in photovoltaic(PV)models.The objective is to address challenges related to the detection and maintenance of PV systems and the improvement of conversion efficiency.RSWTLBO combines adaptive parameter w,Single Solution Optimization Mechanism(SSOM),and Weight Probability Exploration Strategy(WPES)to enhance the optimization ability of TLBO.The algorithm achieves a balance between exploitation and exploration throughout the iteration process.The SSOM allows for local exploration around a single solution,improving solution quality and eliminating inferior solutions.The WPES enables comprehensive exploration of the solution space,avoiding the problem of getting trapped in local optima.The algo-rithm is evaluated by comparing it with 10 other competitive algorithms on various PV models.The results demonstrate that RSWTLBO consistently achieves the lowest Root Mean Square Errors on single diode models,double diode models,and PV module models.It also exhibits robust performance under varying irradiation and temperature conditions.The study concludes that RSWTLBO is a practical and effective algorithm for identifying unknown parameters in PV models.
文摘The evolutionary strategy with a dynamic weighting schedule is proposed to find all the compromised solutions of the multi-objective integrated structure and control optimization problem, where the optimal system performance and control cost are defined by H2 or H∞ norms. During this optimization process, the weights are varying with the increasing generation instead of fixed values. The proposed strategy together with the linear matrix inequality （LMI） or the Riccati controller design method can find a series of uniformly distributed nondominated solutions in a single run. Therefore, this method can greatly reduce the computation intensity of the integrated optimization problem compared with the weight-based single objective genetic algorithm. Active automotive suspension is adopted as an example to illustrate the effectiveness of the proposed method.
基金The US National Science Foundation (No. CMMI-0408390,CMMI-0644552,BCS-0527508)the National Natural Science Foundation of China (No. 51010044,U1134206)+2 种基金the Fok YingTong Education Foundation (No. 114024)the Natural Science Foundation of Jiangsu Province (No. BK2009015)the Postdoctoral Science Foundation of Jiangsu Province (No. 0901005C)
文摘A min-max optimization method is proposed as a new approach to deal with the weight determination problem in the context of the analytic hierarchy process. The priority is obtained through minimizing the maximal absolute difference between the weight vector obtained from each column and the ideal weight vector. By transformation, the. constrained min- max optimization problem is converted to a linear programming problem, which can be solved using either the simplex method or the interior method. The Karush-Kuhn- Tucker condition is also analytically provided. These control thresholds provide a straightforward indication of inconsistency of the pairwise comparison matrix. Numerical computations for several case studies are conducted to compare the performance of the proposed method with three existing methods. This observation illustrates that the min-max method controls maximum deviation and gives more weight to non- dominate factors.
基金supported by the National Natural Science Foundation of China(6110420961503126)
文摘In practical applications, the system observation error is widespread. If the observation equation of the system has not been verified or corrected under certain environmental conditions,the unknown system errors and filtering errors will come into being.The incremental observation equation is derived, which can eliminate the unknown observation errors effectively. Furthermore, an incremental Kalman smoother is presented. Moreover, a weighted measurement fusion incremental Kalman smoother applying the globally optimal weighted measurement fusion algorithm is given.The simulation results show their effectiveness and feasibility.
基金Supported by National Science and Technology Major Project(Grant No.2015ZX04014021)
文摘A light?weight design method of integrated structural topology and size co?optimization for the force?performance?structure of complex structural parts is presented in this paper. Firstly, the supporting function of a complex structural part is built to map the force transmission, where the force exerted areas and constraints are considered as connecting structure and the structural configuration, to determine the part performance as well as the force routines. Then the connecting structure design model, aiming to optimize the static and dynamic performances on connection configuration, is developed, and the optimum design of the characteristic parameters is carried out by means of the collaborative optimization method, namely, the integrated structural topology optimization and size optimization. In this design model, the objective is to maximize the connecting stiffness. Based on the relationship between the force and the structural configuration of a part, the optimal force transmission routine that can meet the performance requirements is obtained using the structural topology optimization technology. Accordingly, the light?weight design of conceptual configuration for complex parts under multi?objective and multi?condition can be realized. Finally, based on the proposed collaborative optimization design method, the optimal performance and optimal structure of the complex parts with light weight are realized, and the reasonable structural unit configuration and size charac?teristic parameters are obtained. A bed structure of gantry?type machining center is designed by using the proposed light?weight structure design method in this paper, as an illustrative example. The bed after the design optimization is lighter 8% than original one, and the rail deformation is reduced by 5%. Moreover, the lightweight design of the bed is achieved with enhanced performance to show the effectiveness of the proposed method.
基金supported by the Foundation of the Scientific and Technological Innovation Team of Colleges and Universities in Henan Province(Grant No.181RTSTHN009)the Foundation of the Key Laboratory of Water Environment Simulation and Treatment in Henan Province(Grant No.2017016).
文摘Based on conventional particle swarm optimization(PSO),this paper presents an efficient and reliable heuristic approach using PSO with an adaptive random inertia weight(ARIW)strategy,referred to as the ARIW-PSO algorithm,to build a multi-objective optimization model for reservoir operation.Using the triangular probability density function,the inertia weight is randomly generated,and the probability density function is automatically adjusted to make the inertia weight generally greater in the initial stage of evolution,which is suitable for global searches.In the evolution process,the inertia weight gradually decreases,which is beneficial to local searches.The performance of the ARIWPSO algorithm was investigated with some classical test functions,and the results were compared with those of the genetic algorithm(GA),the conventional PSO,and other improved PSO methods.Then,the ARIW-PSO algorithm was applied to multi-objective optimal dispatch of the Panjiakou Reservoir and multi-objective flood control operation of a reservoir group on the Luanhe River in China,including the Panjiakou Reservoir,Daheiting Reservoir,and Taolinkou Reservoir.The validity of the multi-objective optimization model for multi-reservoir systems based on the ARIW-PSO algorithm was verified.
基金supported by National Natural Science Foundation of China[Grant No.51575399]the National Key Research and Development Program of China[Grant No.2016YFB0101602].
文摘Stress-based topology optimization is one of the most concerns of structural optimization and receives much attention in a wide range of engineering designs.To solve the inherent issues of stress-based topology optimization,many schemes are added to the conventional bi-directional evolutionary structural optimization(BESO)method in the previous studies.However,these schemes degrade the generality of BESO and increase the computational cost.This study proposes an improved topology optimization method for the continuum structures considering stress minimization in the framework of the conventional BESO method.A global stress measure constructed by p-norm function is treated as the objective function.To stabilize the optimization process,both qp-relaxation and sensitivity weight scheme are introduced.Design variables are updated by the conventional BESO method.Several 2D and 3D examples are used to demonstrate the validity of the proposed method.The results show that the optimization process can be stabilized by qp-relaxation.The value of q and p are crucial to reasonable solutions.The proposed sensitivity weight scheme further stabilizes the optimization process and evenly distributes the stress field.The computational efficiency of the proposed method is higher than the previous methods because it keeps the generality of BESO and does not need additional schemes.
基金Prince Sattam bin Abdulaziz University project number(PSAU/2023/R/1445)。
文摘Prediction of stability in SG(Smart Grid)is essential in maintaining consistency and reliability of power supply in grid infrastructure.Analyzing the fluctuations in power generation and consumption patterns of smart cities assists in effectively managing continuous power supply in the grid.It also possesses a better impact on averting overloading and permitting effective energy storage.Even though many traditional techniques have predicted the consumption rate for preserving stability,enhancement is required in prediction measures with minimized loss.To overcome the complications in existing studies,this paper intends to predict stability from the smart grid stability prediction dataset using machine learning algorithms.To accomplish this,pre-processing is performed initially to handle missing values since it develops biased models when missing values are mishandled and performs feature scaling to normalize independent data features.Then,the pre-processed data are taken for training and testing.Following that,the regression process is performed using Modified PSO(Particle Swarm Optimization)optimized XGBoost Technique with dynamic inertia weight update,which analyses variables like gamma(G),reaction time(tau1–tau4),and power balance(p1–p4)for providing effective future stability in SG.Since PSO attains optimal solution by adjusting position through dynamic inertial weights,it is integrated with XGBoost due to its scalability and faster computational speed characteristics.The hyperparameters of XGBoost are fine-tuned in the training process for achieving promising outcomes on prediction.Regression results are measured through evaluation metrics such as MSE(Mean Square Error)of 0.011312781,MAE(Mean Absolute Error)of 0.008596322,and RMSE(Root Mean Square Error)of 0.010636156 and MAPE(Mean Absolute Percentage Error)value of 0.0052 which determine the efficacy of the system.
基金Project supported by the National Key Project(No.GJXM92579)the Defense Industrial Technology Development Program(No.C1520110002)the State Administration of Science,Technology and Industry for National Defence,China。
文摘To improve the spectral characteristics of the high-order weighted compact nonlinear scheme(WCNS),optimized flux difference schemes are proposed.The disadvantages in previous optimization routines,i.e.,reducing formal orders,or extending stencil widths,are avoided in the new optimized schemes by utilizing fluxes from both cell-edges and cell-nodes.Optimizations are implemented with Fourier analysis for linear schemes and the approximate dispersion relation(ADR)for nonlinear schemes.Classical difference schemes are restored near discontinuities to suppress numerical oscillations with use of a shock sensor based on smoothness indicators.The results of several benchmark numerical tests indicate that the new optimized difference schemes outperform the classical schemes,in terms of accuracy and resolution for smooth wave and vortex,especially for long-time simulations.Using optimized schemes increases the total CPU time by less than 4%.
基金Project of Key Science and Technology of the Henan Province(No.202102310259)Henan Province University Scientific and Technological Innovation Team(No.18IRTSTHN009).
文摘The Bald Eagle Search algorithm(BES)is an emerging meta-heuristic algorithm.The algorithm simulates the hunting behavior of eagles,and obtains an optimal solution through three stages,namely selection stage,search stage and swooping stage.However,BES tends to drop-in local optimization and the maximum value of search space needs to be improved.To fill this research gap,we propose an improved bald eagle algorithm(CABES)that integrates Cauchy mutation and adaptive optimization to improve the performance of BES from local optima.Firstly,CABES introduces the Cauchy mutation strategy to adjust the step size of the selection stage,to select a better search range.Secondly,in the search stage,CABES updates the search position update formula by an adaptive weight factor to further promote the local optimization capability of BES.To verify the performance of CABES,the benchmark function of CEC2017 is used to simulate the algorithm.The findings of the tests are compared to those of the Particle Swarm Optimization algorithm(PSO),Whale Optimization Algorithm(WOA)and Archimedes Algorithm(AOA).The experimental results show that CABES can provide good exploration and development capabilities,and it has strong competitiveness in testing algorithms.Finally,CABES is applied to four constrained engineering problems and a groundwater engineeringmodel,which further verifies the effectiveness and efficiency of CABES in practical engineering problems.
基金partly supported by the National Natural Science Foundation of China(61751303,U20A2068,11771013)the Zhejiang Provincial Natural Science Foundation of China(LD19A010001)the Fundamental Research Funds for the Central Universities。
文摘Weighted vertex cover(WVC)is one of the most important combinatorial optimization problems.In this paper,we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted networks.We first model the WVC problem as a general game on weighted networks.Under the framework of a game,we newly define several cover states to describe the WVC problem.Moreover,we reveal the relationship among these cover states of the weighted network and the strict Nash equilibriums(SNEs)of the game.Then,we propose a game-based asynchronous algorithm(GAA),which can theoretically guarantee that all cover states of vertices converging in an SNE with polynomial time.Subsequently,we improve the GAA by adding 2-hop and 3-hop adjustment mechanisms,termed the improved game-based asynchronous algorithm(IGAA),in which we prove that it can obtain a better solution to the WVC problem than using a the GAA.Finally,numerical simulations demonstrate that the proposed IGAA can obtain a better approximate solution in promising computation time compared with the existing representative algorithms.
基金supported in part by the National Natural Science Foundation of China(Nos.42271343,42177387)the Fund of State Key Laboratory of Remote Sensing Information and Image Analysis Technology of Beijing Research Institute of Uranium Geology under(No.6142A010403)
文摘This paper presents a method to reconstruct 3-D models of trees from terrestrial laser scan(TLS)point clouds.This method uses the weighted locally optimal projection(WLOP)and the AdTree method to reconstruct detailed 3-D tree models.To improve its representation accuracy,the WLOP algorithm is introduced to consolidate the point cloud.Its reconstruction accuracy is tested using a dataset of ten trees,and the one-sided Hausdorff distances between the input point clouds and the resulting 3-D models are measured.The experimental results show that the optimal projection modeling method has an average one-sided Hausdorff distance(mean)lower by 30.74%and 6.43%compared with AdTree and AdQSM methods,respectively.Furthermore,it has an average one-sided Hausdorff distance(RMS)lower by 29.95%and 12.28%compared with AdTree and AdQSM methods.Results show that the 3-D model generated fits closely to the input point cloud data and ensures a high geometrical accuracy.
文摘This paper addresses the shortcomings of the Sparrow and Eagle Optimization Algorithm (SBOA) in terms of convergence accuracy, convergence speed, and susceptibility to local optima. To this end, an improved Sparrow and Eagle Optimization Algorithm (HS-SBOA) is proposed. Initially, the algorithm employs Iterative Mapping to generate an initial sparrow and eagle population, enhancing the diversity of the population during the global search phase. Subsequently, an adaptive weighting strategy is introduced during the exploration phase of the algorithm to achieve a balance between exploration and exploitation. Finally, to avoid the algorithm falling into local optima, a Cauchy mutation operation is applied to the current best individual. To validate the performance of the HS-SBOA algorithm, it was applied to the CEC2021 benchmark function set and three practical engineering problems, and compared with other optimization algorithms such as the Grey Wolf Optimization (GWO), Particle Swarm Optimization (PSO), and Whale Optimization Algorithm (WOA) to test the effectiveness of the improved algorithm. The simulation experimental results show that the HS-SBOA algorithm demonstrates significant advantages in terms of convergence speed and accuracy, thereby validating the effectiveness of its improved strategies.
基金supported by the Shaanxi Province Natural Science Basic Research Program Project(2024JC-YBMS-572)partially funded by Yan’an University Graduate Education Innovation Program Project(YCX2023032,YCX2023033,YCX2024094,YCX2024097)the“14th Five Year Plan Medium and Long Term Major Scientific Research Project”(2021ZCQ015)of Yan’an University.
文摘Aiming to address the limitations of the standard Chimp Optimization Algorithm(ChOA),such as inadequate search ability and susceptibility to local optima in Unmanned Aerial Vehicle(UAV)path planning,this paper proposes a three-dimensional path planning method for UAVs based on the Improved Chimp Optimization Algorithm(IChOA).First,this paper models the terrain and obstacle environments spatially and formulates the total UAV flight cost function according to the constraints,transforming the path planning problem into an optimization problem with multiple constraints.Second,this paper enhances the diversity of the chimpanzee population by applying the Sine chaos mapping strategy and introduces a nonlinear convergence factor to improve the algorithm’s search accuracy and convergence speed.Finally,this paper proposes a dynamic adjustment strategy for the number of chimpanzee advance echelons,which effectively balances global exploration and local exploitation,significantly optimizing the algorithm’s search performance.To validate the effectiveness of the IChOA algorithm,this paper conducts experimental comparisons with eight different intelligent algorithms.The experimental results demonstrate that the IChOA outperforms the selected comparison algorithms in terms of practicality and robustness in UAV 3D path planning.It effectively solves the issues of efficiency in finding the shortest path and ensures high stability during execution.
