It is significant to combine multiple tasks into an optimal work package in decision-making of aircraft maintenance to reduce cost,so a cost rate model of combinatorial maintenance is an urgent need.However,the optima...It is significant to combine multiple tasks into an optimal work package in decision-making of aircraft maintenance to reduce cost,so a cost rate model of combinatorial maintenance is an urgent need.However,the optimal combination under various constraints not only involves numerical calculations but also is an NP-hard combinatorial problem.To solve the problem,an adaptive genetic algorithm based on cluster search,which is divided into two phases,is put forward.In the first phase,according to the density,all individuals can be homogeneously scattered over the whole solution space through crossover and mutation and better individuals are collected as candidate cluster centres.In the second phase,the search is confined to the neighbourhood of some selected possible solutions to accurately solve with cluster radius decreasing slowly,meanwhile all clusters continuously move to better regions until all the peaks in the question space is searched.This algorithm can efficiently solve the combination problem.Taking the optimization on decision-making of aircraft maintenance by the algorithm for an example,maintenance which combines multiple parts or tasks can significantly enhance economic benefit when the halt cost is rather high.展开更多
Understanding competition between trees is essential for sustainable forest management as interactions between trees in uneven-aged mixed forests play a key role in growth dynamics. This study investigated nine compet...Understanding competition between trees is essential for sustainable forest management as interactions between trees in uneven-aged mixed forests play a key role in growth dynamics. This study investigated nine competition indices(CIs) for their suitability to model the effects of neighboring trees on silver fir(Abies alba) growth in Dinaric silver fir-European beech(Fagus sylvatica) forests. Although numerous competition indices have been developed, there is still limited consensus on their applicability in different forest types, especially in mature, structurally complex forest stands. The indices were evaluated using the adjusted coefficient of determination in a linear model wherein the volume growth of the last five years for 60 dominant silver fir trees was modeled as a function of tree volume and competition index. The results demonstrated that distance-dependent indices(e.g., the Hegyi height-distance competition and Rouvinen-Kuuluvainen diameter-distance competition indices), which consider the distance to competitors and their size, perform better than distance-independent indices. Using the optimization procedure in calculating the competition indices, only neighboring trees at a distance of up to 26-fold the diameter at breast height(DBH) of the selected tree(optimal search radius) and with a DBH of at least 20% of that of the target tree(optimal DBH) were considered competitors. Therefore, competition significantly influences the growth of dominant silver firs even in older age classes. The model based solely on tree volume explained 32.5% of the variability in volume growth, while the model that accounted for competition explained 64%. Optimizing the optimal search radius had a greater impact on model performance than optimizing the DBH threshold. This emphasizes the importance of balancing stand density and competition in silvicultural practice.展开更多
Heart failure prediction is crucial as cardiovascular diseases become the leading cause of death worldwide,exacerbated by the COVID-19 pandemic.Age,cholesterol,and blood pressure datasets are becoming inadequate becau...Heart failure prediction is crucial as cardiovascular diseases become the leading cause of death worldwide,exacerbated by the COVID-19 pandemic.Age,cholesterol,and blood pressure datasets are becoming inadequate because they cannot capture the complexity of emerging health indicators.These high-dimensional and heterogeneous datasets make traditional machine learning methods difficult,and Skewness and other new biomarkers and psychosocial factors bias the model’s heart health prediction across diverse patient profiles.Modern medical datasets’complexity and high dimensionality challenge traditional predictionmodels like SupportVectorMachines and Decision Trees.Quantum approaches include QSVM,QkNN,QDT,and others.These Constraints drove research.The“QHF-CS:Quantum-Enhanced Heart Failure Prediction using Quantum CNN with Optimized Feature Qubit Selection with Cuckoo Search in Skewed Clinical Data”system was developed in this research.This novel system leverages a Quantum Convolutional Neural Network(QCNN)-based quantum circuit,enhanced by meta-heuristic algorithms—Cuckoo SearchOptimization(CSO),Artificial BeeColony(ABC),and Particle SwarmOptimization(PSO)—for feature qubit selection.Among these,CSO demonstrated superior performance by consistently identifying the most optimal and least skewed feature subsets,which were then encoded into quantum states for circuit construction.By integrating advanced quantum circuit feature maps like ZZFeatureMap,RealAmplitudes,and EfficientSU2,the QHF-CS model efficiently processes complex,high-dimensional data,capturing intricate patterns that classical models overlook.The QHF-CS model improves precision,recall,F1-score,and accuracy to 0.94,0.95,0.94,and 0.94.Quantum computing could revolutionize heart failure diagnostics by improving model accuracy and computational efficiency,enabling complex healthcare diagnostic breakthroughs.展开更多
To find the optimal operational condition when the properties of feedstock changes in the cracking furnace online,a hybrid algorithm named differential evolution group search optimization(DEGSO) is proposed,which is b...To find the optimal operational condition when the properties of feedstock changes in the cracking furnace online,a hybrid algorithm named differential evolution group search optimization(DEGSO) is proposed,which is based on the differential evolution(DE) and the group search optimization(GSO).The DEGSO combines the advantages of the two algorithms:the high computing speed of DE and the good performance of the GSO for preventing the best particle from converging to local optimum.A cooperative method is also proposed for switching between these two algorithms.If the fitness value of one algorithm keeps invariant in several generations and less than the preset threshold,it is considered to fall into the local optimization and the other algorithm is chosen.Experiments on benchmark functions show that the hybrid algorithm outperforms GSO in accuracy,global searching ability and efficiency.The optimization of ethylene and propylene yields is illustrated as a case by DEGSO.After optimization,the yield of ethylene and propylene is increased remarkably,which provides the proper operational condition of the ethylene cracking furnace.展开更多
The ammonia synthesis reactor is the core unit in the whole ammonia synthesis production. The ammonia concentration at the ammonia converter outlet is a significant process variable, which reflects directly the produc...The ammonia synthesis reactor is the core unit in the whole ammonia synthesis production. The ammonia concentration at the ammonia converter outlet is a significant process variable, which reflects directly the production efficiency. However, it is hard to be measured reliably online in real applications. In this paper, a soft sensor based on BP neural network (BPNN) is applied to estimate the ammonia concentration. A modified group search optimization with nearest neighborhood (GSO-NH) is proposed to optimize the weights and thresholds of BPNN. GSO-NH is integrated with BPNN to build a soft sensor model. Finally, the soft sensor model based on BPNN and GSO-NH (GSO-NH-NN) is used to infer the outlet ammonia concentration in a real-world application. Three other modeling methods are applied for comparison with GSO-NH-NN. The results show that the soft sensor based on GSO-NH-NN has a good prediction performance with high accuracy. Moreover, the GSO-NH-NN also provides good generalization ability to other modeling problems in ammonia synthesis production.展开更多
A target is assumed to move according to a Brownian motion on the real line. The searcher starts from the origin and moves in the two directions from the starting point. The object is to detect the target. The purpose...A target is assumed to move according to a Brownian motion on the real line. The searcher starts from the origin and moves in the two directions from the starting point. The object is to detect the target. The purpose of this paper is to find the conditions under which the expected value of the first meeting time of the searcher and the target is finite, and to show the existence of a search plan which made this expected value minimum.展开更多
The artificial bee colony （ABC） algorithm is a sim- ple and effective global optimization algorithm which has been successfully applied in practical optimization problems of various fields. However, the algorithm is...The artificial bee colony （ABC） algorithm is a sim- ple and effective global optimization algorithm which has been successfully applied in practical optimization problems of various fields. However, the algorithm is still insufficient in balancing ex- ploration and exploitation. To solve this problem, we put forward an improved algorithm with a comprehensive search mechanism. The search mechanism contains three main strategies. Firstly, the heuristic Gaussian search strategy composed of three different search equations is proposed for the employed bees, which fully utilizes and balances the exploration and exploitation of the three different search equations by introducing the selectivity probability P,. Secondly, in order to improve the search accuracy, we propose the Gbest-guided neighborhood search strategy for onlooker bees to improve the exploitation performance of ABC. Thirdly, the self- adaptive population perturbation strategy for the current colony is used by random perturbation or Gaussian perturbation to en- hance the diversity of the population. In addition, to improve the quality of the initial population, we introduce the chaotic opposition- based learning method for initialization. The experimental results and Wilcoxon signed ranks test based on 27 benchmark func- tions show that the proposed algorithm, especially for solving high dimensional and complex function optimization problems, has a higher convergence speed and search precision than ABC and three other current ABC-based algorithms.展开更多
With the rapid development of new energy technologies, lithium batteries are widely used in the field of energy storage systems and electric vehicles. The accurate prediction for the state of health(SOH) has an import...With the rapid development of new energy technologies, lithium batteries are widely used in the field of energy storage systems and electric vehicles. The accurate prediction for the state of health(SOH) has an important role in maintaining a safe and stable operation of lithium-ion batteries. To address the problems of uncertain battery discharge conditions and low SOH estimation accuracy in practical applications, this paper proposes a SOH estimation method based on constant-current battery charging section characteristics with a back-propagation neural network with an improved atom search optimization algorithm. A temperature characteristic, equal-time temperature variation(Dt_DT), is proposed by analyzing the temperature data of the battery charging section with the incremental capacity(IC) characteristics obtained from an IC analysis as an input to the data-driven prediction model. Testing and analysis of the proposed prediction model are carried out using publicly available datasets. Experimental results show that the maximum error of SOH estimation results for the proposed method in this paper is below 1.5%.展开更多
Reducing pollutant emissions from electricity production in the power system positively impacts the control of greenhouse gas emissions.Boosting kernel search optimizer(BKSO)is introduced in this research to solve the...Reducing pollutant emissions from electricity production in the power system positively impacts the control of greenhouse gas emissions.Boosting kernel search optimizer(BKSO)is introduced in this research to solve the combined economic emission dispatch(CEED)problem.Inspired by the foraging behavior in the slime mould algorithm(SMA),the kernel matrix of the kernel search optimizer(KSO)is intensified.The proposed BKSO is superior to the standard KSO in terms of exploitation ability,robustness,and convergence rate.The CEC2013 test function is used to assess the improved KSO's performance and compared to 11 well-known optimization algorithms.BKSO performs better in statistical results and convergence curves.At the same time,BKSO achieves better fuel costs and fewer pollution emissions by testing with four real CEED cases,and the Pareto solution obtained is also better than other MAs.Based on the experimental results,BKSO has better performance than other comparable MAs and can provide more economical,robust,and cleaner solutions to CEED problems.展开更多
The backtracking search optimization algorithm（BSA） is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powe...The backtracking search optimization algorithm（BSA） is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powerful capability to find global optimal solutions. However, the algorithm is still insufficient in balancing the exploration and the exploitation. Therefore, an improved adaptive backtracking search optimization algorithm combined with modified Hooke-Jeeves pattern search is proposed for numerical global optimization. It has two main parts： the BSA is used for the exploration phase and the modified pattern search method completes the exploitation phase. In particular, a simple but effective strategy of adapting one of BSA＇s important control parameters is introduced. The proposed algorithm is compared with standard BSA, three state-of-the-art evolutionary algorithms and three superior algorithms in IEEE Congress on Evolutionary Computation 2014（IEEE CEC2014） over six widely-used benchmarks and 22 real-parameter single objective numerical optimization benchmarks in IEEE CEC2014. The results of experiment and statistical analysis demonstrate the effectiveness and efficiency of the proposed algorithm.展开更多
Over recent decades,the artificial neural networks(ANNs)have been applied as an effective approach for detecting damage in construction materials.However,to achieve a superior result of defect identification,they have...Over recent decades,the artificial neural networks(ANNs)have been applied as an effective approach for detecting damage in construction materials.However,to achieve a superior result of defect identification,they have to overcome some shortcomings,for instance slow convergence or stagnancy in local minima.Therefore,optimization algorithms with a global search ability are used to enhance ANNs,i.e.to increase the rate of convergence and to reach a global minimum.This paper introduces a two-stage approach for failure identification in a steel beam.In the first step,the presence of defects and their positions are identified by modal indices.In the second step,a feedforward neural network,improved by a hybrid particle swarm optimization and gravitational search algorithm,namely FNN-PSOGSA,is used to quantify the severity of damage.Finite element(FE)models of the beam for two damage scenarios are used to certify the accuracy and reliability of the proposed method.For comparison,a traditional ANN is also used to estimate the severity of the damage.The obtained results prove that the proposed approach can be used effectively for damage detection and quantification.展开更多
Over the last two decades,stochastic optimization algorithms have proved to be a very promising approach to solving a variety of complex optimization problems.Bald eagle search optimization(BES)as a new stochastic opt...Over the last two decades,stochastic optimization algorithms have proved to be a very promising approach to solving a variety of complex optimization problems.Bald eagle search optimization(BES)as a new stochastic optimization algorithm with fast convergence speed has the ability of prominent optimization and the defect of collapsing in the local best.To avoid BES collapse at local optima,inspired by the fact that the volume of the sphere is the largest when the surface area is certain,an improved bald eagle search optimization algorithm(INMBES)integrating the random shrinkage mechanism of the sphere is proposed.Firstly,the INMBES embeds spherical coordinates to design a more accurate parameter update method to modify the coverage and dispersion of the population.Secondly,the population splits into elite and non-elite groups and the Bernoulli chaos is applied to elite group to tap around potential solutions of the INMBES.The non-elite group is redistributed again and the Nelder-Mead simplex strategy is applied to each group to accelerate the evolution of the worst individual and the convergence process of the INMBES.The results of Friedman and Wilcoxon rank sum tests of CEC2017 in 10,30,50,and 100 dimensions numerical optimization confirm that the INMBES has superior performance in convergence accuracy and avoiding falling into local optimization compared with other potential improved algorithms but inferior to the champion algorithm and ranking third.The three engineering constraint optimization problems and 26 real world problems and the problem of extracting the best feature subset by encapsulated feature selection method verify that the INMBES’s performance ranks first and has achieved satisfactory accuracy in solving practical problems.展开更多
This paper proposes a novel intelligent estimation algorithm in Wireless Sensor Network nodes location based on Free Search,which converts parameter estimation to on-line optimization of nonlinear function and estimat...This paper proposes a novel intelligent estimation algorithm in Wireless Sensor Network nodes location based on Free Search,which converts parameter estimation to on-line optimization of nonlinear function and estimates the coordinates of senor nodes using the Free Search optimization.Compared to the least-squares estimation algorithms,the localization accuracy has been increased significantly,which has been verified by the simulation results.展开更多
A simplified group search optimizer algorithm denoted as"SGSO"for large scale global optimization is presented in this paper to obtain a simple algorithm with superior performance on high-dimensional problem...A simplified group search optimizer algorithm denoted as"SGSO"for large scale global optimization is presented in this paper to obtain a simple algorithm with superior performance on high-dimensional problems.The SGSO adopts an improved sharing strategy which shares information of not only the best member but also the other good members,and uses a simpler search method instead of searching by the head angle.Furthermore,the SGSO increases the percentage of scroungers to accelerate convergence speed.Compared with genetic algorithm(GA),particle swarm optimizer(PSO)and group search optimizer(GSO),SGSO is tested on seven benchmark functions with dimensions 30,100,500 and 1 000.It can be concluded that the SGSO has a remarkably superior performance to GA,PSO and GSO for large scale global optimization.展开更多
To address the guided search task of airborne phased array radar in the scenarios of large airspace with widespread distribution of cluster targets in Beyond Visual Range(BVR)air combat,a hierarchical strategy framewo...To address the guided search task of airborne phased array radar in the scenarios of large airspace with widespread distribution of cluster targets in Beyond Visual Range(BVR)air combat,a hierarchical strategy framework based on deep reinforcement learning is proposed to guide different stages of search tasks.Firstly,an airspace set-covering model and a radar parameter optimization model for the guided search task of cluster targets are established.Secondly,the hierarchical strategy framework including upper-level and lower-level strategies is constructed based on the above models.Finally,the happo-rgs algorithm is proposed for feature extraction from Markov continuous observation sequences,to enhance the training effectiveness and improve the algorithm convergence speed.Simulation results show that the trained agent can make precise autonomous decisions rapidly based on airspace-target covering situation and target guidance information which significantly improves the radar search performance in the forementioned scenarios compared to traditional algorithms.展开更多
Wireless sensor network(WSN)is an emerging technology which find useful in several application areas such as healthcare,environmentalmonitoring,border surveillance,etc.Several issues that exist in the designing of WSN...Wireless sensor network(WSN)is an emerging technology which find useful in several application areas such as healthcare,environmentalmonitoring,border surveillance,etc.Several issues that exist in the designing of WSN are node localization,coverage,energy efficiency,security,and so on.In spite of the issues,node localization is considered an important issue,which intends to calculate the coordinate points of unknown nodes with the assistance of anchors.The efficiency of the WSN can be considerably influenced by the node localization accuracy.Therefore,this paper presents a modified search and rescue optimization based node localization technique(MSRONLT)forWSN.The major aim of theMSRO-NLT technique is to determine the positioning of the unknown nodes in theWSN.Since the traditional search and rescue optimization(SRO)algorithm suffers from the local optima problemwith an increase in number of iterations,MSRO algorithm is developed by the incorporation of chaotic maps to improvise the diversity of the technique.The application of the concept of chaotic map to the characteristics of the traditional SRO algorithm helps to achieve better exploration ability of the MSRO algorithm.In order to validate the effective node localization performance of the MSRO-NLT algorithm,a set of simulations were performed to highlight the supremacy of the presented model.A detailed comparative results analysis showcased the betterment of the MSRO-NLT technique over the other compared methods in terms of different measures.展开更多
In machine learning and data mining,feature selection(FS)is a traditional and complicated optimization problem.Since the run time increases exponentially,FS is treated as an NP-hard problem.The researcher’s effort to...In machine learning and data mining,feature selection(FS)is a traditional and complicated optimization problem.Since the run time increases exponentially,FS is treated as an NP-hard problem.The researcher’s effort to build a new FS solution was inspired by the ongoing need for an efficient FS framework and the success rates of swarming outcomes in different optimization scenarios.This paper presents two binary variants of a Hunger Games Search Optimization(HGSO)algorithm based on V-and S-shaped transfer functions within a wrapper FS model for choosing the best features from a large dataset.The proposed technique transforms the continuous HGSO into a binary variant using V-and S-shaped transfer functions(BHGSO-V and BHGSO-S).To validate the accuracy,16 famous UCI datasets are considered and compared with different state-of-the-art metaheuristic binary algorithms.The findings demonstrate that BHGSO-V achieves better performance in terms of the selected number of features,classification accuracy,run time,and fitness values than other state-of-the-art algorithms.The results demonstrate that the BHGSO-V algorithm can reduce dimensionality and choose the most helpful features for classification problems.The proposed BHGSO-V achieves 95%average classification accuracy for most of the datasets,and run time is less than 5 sec.for low and medium dimensional datasets and less than 10 sec for high dimensional datasets.展开更多
In this paper, we address one of the issues in the frequency assignment problem for cellular mobile networks in which we intend to minimize the interference levels when assigning frequencies from a limited frequency s...In this paper, we address one of the issues in the frequency assignment problem for cellular mobile networks in which we intend to minimize the interference levels when assigning frequencies from a limited frequency spectrum. In order to satisfy the increasing demand in such cellular mobile networks, we use a hybrid approach consisting of a Particle Swarm Optimization(PSO) combined with a Tabu Search(TS) algorithm. This approach takes both advantages of PSO efficiency in global optimization and TS in avoiding the premature convergence that would lead PSO to stagnate in a local minimum. Moreover, we propose a new efficient, simple, and inexpensive model for storing and evaluating solution's assignment. The purpose of this model reduces the solution's storage volume as well as the computations required to evaluate thesesolutions in comparison with the classical model. Our simulation results on the most known benchmarking instances prove the effectiveness of our proposed algorithm in comparison with previous related works in terms of convergence rate, the number of iterations, the solution storage volume and the running time required to converge to the optimal solution.展开更多
Aiming at the practical application of Unmanned Underwater Vehicle(UUV)in underwater combat,this paper proposes a battlefield ambush scene with UUV considering ocean current.Firstly,by establishing these mathematical ...Aiming at the practical application of Unmanned Underwater Vehicle(UUV)in underwater combat,this paper proposes a battlefield ambush scene with UUV considering ocean current.Firstly,by establishing these mathematical models of ocean current environment,target movement,and sonar detection,the probability calculation methods of single UUV searching target and multiple UUV cooperatively searching target are given respectively.Then,based on the Hybrid Quantum-behaved Particle Swarm Optimization(HQPSO)algorithm,the path with the highest target search probability is found.Finally,through simulation calculations,the influence of different UUV parameters and target parameters on the target search probability is analyzed,and the minimum number of UUVs that need to be deployed to complete the ambush task is demonstrated,and the optimal search path scheme is obtained.The method proposed in this paper provides a theoretical basis for the practical application of UUV in the future combat.展开更多
During the last few years we have witnessed impressive developments in the area of stochastic local search techniques for intelligent optimization and Reactive Search Optimization. In order to handle the complexity, i...During the last few years we have witnessed impressive developments in the area of stochastic local search techniques for intelligent optimization and Reactive Search Optimization. In order to handle the complexity, in the framework of stochastic local search optimization, learning and optimization has been deeply interconnected through interaction with the decision maker via the visualization approach of the online graphs. Consequently a number of complex optimization problems, in particular multiobjective optimization problems, arising in widely different contexts have been effectively treated within the general framework of RSO. In solving real-life multiobjective optimization problems often most emphasis are spent on finding the complete Pareto-optimal set and less on decision-making. However the com-plete task of multiobjective optimization is considered as a combined task of optimization and decision-making. In this paper, we suggest an interactive procedure which will involve the decision-maker in the optimization process helping to choose a single solution at the end. Our proposed method works on the basis of Reactive Search Optimization (RSO) algorithms and available software architecture packages. The procedure is further compared with the excising novel method of Interactive Multiobjective Optimization and Decision-Making, using Evolutionary method (I-MODE). In order to evaluate the effectiveness of both methods the well-known study case of welded beam design problem is reconsidered.展开更多
基金supported by the National Natural Science Foundation of China(6107901361079014+4 种基金61403198)the National Natural Science Funds and Civil Aviaiton Mutual Funds(U1533128U1233114)the Programs of Natural Science Foundation of China and China Civil Aviation Joint Fund(60939003)the Natural Science Foundation of Jiangsu Province in China(BK2011737)
文摘It is significant to combine multiple tasks into an optimal work package in decision-making of aircraft maintenance to reduce cost,so a cost rate model of combinatorial maintenance is an urgent need.However,the optimal combination under various constraints not only involves numerical calculations but also is an NP-hard combinatorial problem.To solve the problem,an adaptive genetic algorithm based on cluster search,which is divided into two phases,is put forward.In the first phase,according to the density,all individuals can be homogeneously scattered over the whole solution space through crossover and mutation and better individuals are collected as candidate cluster centres.In the second phase,the search is confined to the neighbourhood of some selected possible solutions to accurately solve with cluster radius decreasing slowly,meanwhile all clusters continuously move to better regions until all the peaks in the question space is searched.This algorithm can efficiently solve the combination problem.Taking the optimization on decision-making of aircraft maintenance by the algorithm for an example,maintenance which combines multiple parts or tasks can significantly enhance economic benefit when the halt cost is rather high.
基金funded by the Slovenian Research and Innovation Agency(https://www.aris-rs.si/sl/)ProgramResearch Core Fund-ing No.P4-0107(TL)and No.P4-0059(MK)+1 种基金Young Researcher Program Grant(MK)funded by the Slovenian Forestry Institute(P4-0107).
文摘Understanding competition between trees is essential for sustainable forest management as interactions between trees in uneven-aged mixed forests play a key role in growth dynamics. This study investigated nine competition indices(CIs) for their suitability to model the effects of neighboring trees on silver fir(Abies alba) growth in Dinaric silver fir-European beech(Fagus sylvatica) forests. Although numerous competition indices have been developed, there is still limited consensus on their applicability in different forest types, especially in mature, structurally complex forest stands. The indices were evaluated using the adjusted coefficient of determination in a linear model wherein the volume growth of the last five years for 60 dominant silver fir trees was modeled as a function of tree volume and competition index. The results demonstrated that distance-dependent indices(e.g., the Hegyi height-distance competition and Rouvinen-Kuuluvainen diameter-distance competition indices), which consider the distance to competitors and their size, perform better than distance-independent indices. Using the optimization procedure in calculating the competition indices, only neighboring trees at a distance of up to 26-fold the diameter at breast height(DBH) of the selected tree(optimal search radius) and with a DBH of at least 20% of that of the target tree(optimal DBH) were considered competitors. Therefore, competition significantly influences the growth of dominant silver firs even in older age classes. The model based solely on tree volume explained 32.5% of the variability in volume growth, while the model that accounted for competition explained 64%. Optimizing the optimal search radius had a greater impact on model performance than optimizing the DBH threshold. This emphasizes the importance of balancing stand density and competition in silvicultural practice.
文摘Heart failure prediction is crucial as cardiovascular diseases become the leading cause of death worldwide,exacerbated by the COVID-19 pandemic.Age,cholesterol,and blood pressure datasets are becoming inadequate because they cannot capture the complexity of emerging health indicators.These high-dimensional and heterogeneous datasets make traditional machine learning methods difficult,and Skewness and other new biomarkers and psychosocial factors bias the model’s heart health prediction across diverse patient profiles.Modern medical datasets’complexity and high dimensionality challenge traditional predictionmodels like SupportVectorMachines and Decision Trees.Quantum approaches include QSVM,QkNN,QDT,and others.These Constraints drove research.The“QHF-CS:Quantum-Enhanced Heart Failure Prediction using Quantum CNN with Optimized Feature Qubit Selection with Cuckoo Search in Skewed Clinical Data”system was developed in this research.This novel system leverages a Quantum Convolutional Neural Network(QCNN)-based quantum circuit,enhanced by meta-heuristic algorithms—Cuckoo SearchOptimization(CSO),Artificial BeeColony(ABC),and Particle SwarmOptimization(PSO)—for feature qubit selection.Among these,CSO demonstrated superior performance by consistently identifying the most optimal and least skewed feature subsets,which were then encoded into quantum states for circuit construction.By integrating advanced quantum circuit feature maps like ZZFeatureMap,RealAmplitudes,and EfficientSU2,the QHF-CS model efficiently processes complex,high-dimensional data,capturing intricate patterns that classical models overlook.The QHF-CS model improves precision,recall,F1-score,and accuracy to 0.94,0.95,0.94,and 0.94.Quantum computing could revolutionize heart failure diagnostics by improving model accuracy and computational efficiency,enabling complex healthcare diagnostic breakthroughs.
基金Supported by the Major State Basic Research Development Program of China（2012CB720500）the National Natural Science Foundation of China（U1162202）,the National Natural Science Foundation of China（61174118）+2 种基金the National High Technology Research and Development Program of China（2012AA040307）Shanghai Key Technologies R＆D program（12dz1125100）the Shanghai Leading Academic Discipline Project（B504）
文摘To find the optimal operational condition when the properties of feedstock changes in the cracking furnace online,a hybrid algorithm named differential evolution group search optimization(DEGSO) is proposed,which is based on the differential evolution(DE) and the group search optimization(GSO).The DEGSO combines the advantages of the two algorithms:the high computing speed of DE and the good performance of the GSO for preventing the best particle from converging to local optimum.A cooperative method is also proposed for switching between these two algorithms.If the fitness value of one algorithm keeps invariant in several generations and less than the preset threshold,it is considered to fall into the local optimization and the other algorithm is chosen.Experiments on benchmark functions show that the hybrid algorithm outperforms GSO in accuracy,global searching ability and efficiency.The optimization of ethylene and propylene yields is illustrated as a case by DEGSO.After optimization,the yield of ethylene and propylene is increased remarkably,which provides the proper operational condition of the ethylene cracking furnace.
基金Supported by the National Natural Science Foundation of China (61074079)Shanghai Leading Academic Discipline Project(B504)+1 种基金Specialized Research Fund for the Doctoral Program of Higher Education of China (20100074120010)the Natural Science Foundation of Shanghai City (11ZR1409700)
文摘The ammonia synthesis reactor is the core unit in the whole ammonia synthesis production. The ammonia concentration at the ammonia converter outlet is a significant process variable, which reflects directly the production efficiency. However, it is hard to be measured reliably online in real applications. In this paper, a soft sensor based on BP neural network (BPNN) is applied to estimate the ammonia concentration. A modified group search optimization with nearest neighborhood (GSO-NH) is proposed to optimize the weights and thresholds of BPNN. GSO-NH is integrated with BPNN to build a soft sensor model. Finally, the soft sensor model based on BPNN and GSO-NH (GSO-NH-NN) is used to infer the outlet ammonia concentration in a real-world application. Three other modeling methods are applied for comparison with GSO-NH-NN. The results show that the soft sensor based on GSO-NH-NN has a good prediction performance with high accuracy. Moreover, the GSO-NH-NN also provides good generalization ability to other modeling problems in ammonia synthesis production.
文摘A target is assumed to move according to a Brownian motion on the real line. The searcher starts from the origin and moves in the two directions from the starting point. The object is to detect the target. The purpose of this paper is to find the conditions under which the expected value of the first meeting time of the searcher and the target is finite, and to show the existence of a search plan which made this expected value minimum.
基金supported by the Aviation Science Foundation of China(20105196016)the Postdoctoral Science Foundation of China(2012M521807)
文摘The artificial bee colony （ABC） algorithm is a sim- ple and effective global optimization algorithm which has been successfully applied in practical optimization problems of various fields. However, the algorithm is still insufficient in balancing ex- ploration and exploitation. To solve this problem, we put forward an improved algorithm with a comprehensive search mechanism. The search mechanism contains three main strategies. Firstly, the heuristic Gaussian search strategy composed of three different search equations is proposed for the employed bees, which fully utilizes and balances the exploration and exploitation of the three different search equations by introducing the selectivity probability P,. Secondly, in order to improve the search accuracy, we propose the Gbest-guided neighborhood search strategy for onlooker bees to improve the exploitation performance of ABC. Thirdly, the self- adaptive population perturbation strategy for the current colony is used by random perturbation or Gaussian perturbation to en- hance the diversity of the population. In addition, to improve the quality of the initial population, we introduce the chaotic opposition- based learning method for initialization. The experimental results and Wilcoxon signed ranks test based on 27 benchmark func- tions show that the proposed algorithm, especially for solving high dimensional and complex function optimization problems, has a higher convergence speed and search precision than ABC and three other current ABC-based algorithms.
基金supported by National Natural Science Foundation of China (Grant No. 51677058)。
文摘With the rapid development of new energy technologies, lithium batteries are widely used in the field of energy storage systems and electric vehicles. The accurate prediction for the state of health(SOH) has an important role in maintaining a safe and stable operation of lithium-ion batteries. To address the problems of uncertain battery discharge conditions and low SOH estimation accuracy in practical applications, this paper proposes a SOH estimation method based on constant-current battery charging section characteristics with a back-propagation neural network with an improved atom search optimization algorithm. A temperature characteristic, equal-time temperature variation(Dt_DT), is proposed by analyzing the temperature data of the battery charging section with the incremental capacity(IC) characteristics obtained from an IC analysis as an input to the data-driven prediction model. Testing and analysis of the proposed prediction model are carried out using publicly available datasets. Experimental results show that the maximum error of SOH estimation results for the proposed method in this paper is below 1.5%.
基金This research was supported by the Science&Technology Development Project of Jilin Province,China(YDZJ202201ZYTS555)the Science&Technology Research Project of the Education Department of Jilin Province,China(JJKH20220244KJ)。
文摘Reducing pollutant emissions from electricity production in the power system positively impacts the control of greenhouse gas emissions.Boosting kernel search optimizer(BKSO)is introduced in this research to solve the combined economic emission dispatch(CEED)problem.Inspired by the foraging behavior in the slime mould algorithm(SMA),the kernel matrix of the kernel search optimizer(KSO)is intensified.The proposed BKSO is superior to the standard KSO in terms of exploitation ability,robustness,and convergence rate.The CEC2013 test function is used to assess the improved KSO's performance and compared to 11 well-known optimization algorithms.BKSO performs better in statistical results and convergence curves.At the same time,BKSO achieves better fuel costs and fewer pollution emissions by testing with four real CEED cases,and the Pareto solution obtained is also better than other MAs.Based on the experimental results,BKSO has better performance than other comparable MAs and can provide more economical,robust,and cleaner solutions to CEED problems.
基金supported by the National Natural Science Foundation of China(61271250)
文摘The backtracking search optimization algorithm（BSA） is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powerful capability to find global optimal solutions. However, the algorithm is still insufficient in balancing the exploration and the exploitation. Therefore, an improved adaptive backtracking search optimization algorithm combined with modified Hooke-Jeeves pattern search is proposed for numerical global optimization. It has two main parts： the BSA is used for the exploration phase and the modified pattern search method completes the exploitation phase. In particular, a simple but effective strategy of adapting one of BSA＇s important control parameters is introduced. The proposed algorithm is compared with standard BSA, three state-of-the-art evolutionary algorithms and three superior algorithms in IEEE Congress on Evolutionary Computation 2014（IEEE CEC2014） over six widely-used benchmarks and 22 real-parameter single objective numerical optimization benchmarks in IEEE CEC2014. The results of experiment and statistical analysis demonstrate the effectiveness and efficiency of the proposed algorithm.
基金the Vlaamse Interuniversitaire Raad University Development Cooperation(VLIR-UOS)Team Project(No.VN2018TEA479A103)the Flemish Government,Belgium。
文摘Over recent decades,the artificial neural networks(ANNs)have been applied as an effective approach for detecting damage in construction materials.However,to achieve a superior result of defect identification,they have to overcome some shortcomings,for instance slow convergence or stagnancy in local minima.Therefore,optimization algorithms with a global search ability are used to enhance ANNs,i.e.to increase the rate of convergence and to reach a global minimum.This paper introduces a two-stage approach for failure identification in a steel beam.In the first step,the presence of defects and their positions are identified by modal indices.In the second step,a feedforward neural network,improved by a hybrid particle swarm optimization and gravitational search algorithm,namely FNN-PSOGSA,is used to quantify the severity of damage.Finite element(FE)models of the beam for two damage scenarios are used to certify the accuracy and reliability of the proposed method.For comparison,a traditional ANN is also used to estimate the severity of the damage.The obtained results prove that the proposed approach can be used effectively for damage detection and quantification.
基金supported by the National Natural Science Foundation of China No.61976176.
文摘Over the last two decades,stochastic optimization algorithms have proved to be a very promising approach to solving a variety of complex optimization problems.Bald eagle search optimization(BES)as a new stochastic optimization algorithm with fast convergence speed has the ability of prominent optimization and the defect of collapsing in the local best.To avoid BES collapse at local optima,inspired by the fact that the volume of the sphere is the largest when the surface area is certain,an improved bald eagle search optimization algorithm(INMBES)integrating the random shrinkage mechanism of the sphere is proposed.Firstly,the INMBES embeds spherical coordinates to design a more accurate parameter update method to modify the coverage and dispersion of the population.Secondly,the population splits into elite and non-elite groups and the Bernoulli chaos is applied to elite group to tap around potential solutions of the INMBES.The non-elite group is redistributed again and the Nelder-Mead simplex strategy is applied to each group to accelerate the evolution of the worst individual and the convergence process of the INMBES.The results of Friedman and Wilcoxon rank sum tests of CEC2017 in 10,30,50,and 100 dimensions numerical optimization confirm that the INMBES has superior performance in convergence accuracy and avoiding falling into local optimization compared with other potential improved algorithms but inferior to the champion algorithm and ranking third.The three engineering constraint optimization problems and 26 real world problems and the problem of extracting the best feature subset by encapsulated feature selection method verify that the INMBES’s performance ranks first and has achieved satisfactory accuracy in solving practical problems.
基金National Research Foundation for the Doctoral Program of Higher Education of China(No.20060266006)the High-school Natural Science Research Foundation of Jiangsu Province(No.07KJB510095)
文摘This paper proposes a novel intelligent estimation algorithm in Wireless Sensor Network nodes location based on Free Search,which converts parameter estimation to on-line optimization of nonlinear function and estimates the coordinates of senor nodes using the Free Search optimization.Compared to the least-squares estimation algorithms,the localization accuracy has been increased significantly,which has been verified by the simulation results.
基金the Science and Technology Planning Project of Hunan Province(No.2011TP4016-3)the Construct Program of the Key Discipline(Technology of Computer Application)in Xiangnan University
文摘A simplified group search optimizer algorithm denoted as"SGSO"for large scale global optimization is presented in this paper to obtain a simple algorithm with superior performance on high-dimensional problems.The SGSO adopts an improved sharing strategy which shares information of not only the best member but also the other good members,and uses a simpler search method instead of searching by the head angle.Furthermore,the SGSO increases the percentage of scroungers to accelerate convergence speed.Compared with genetic algorithm(GA),particle swarm optimizer(PSO)and group search optimizer(GSO),SGSO is tested on seven benchmark functions with dimensions 30,100,500 and 1 000.It can be concluded that the SGSO has a remarkably superior performance to GA,PSO and GSO for large scale global optimization.
基金supported by the Open Research Subject of State Key Laboratory of Intelligent Game,China(No.ZBKF-23-04)。
文摘To address the guided search task of airborne phased array radar in the scenarios of large airspace with widespread distribution of cluster targets in Beyond Visual Range(BVR)air combat,a hierarchical strategy framework based on deep reinforcement learning is proposed to guide different stages of search tasks.Firstly,an airspace set-covering model and a radar parameter optimization model for the guided search task of cluster targets are established.Secondly,the hierarchical strategy framework including upper-level and lower-level strategies is constructed based on the above models.Finally,the happo-rgs algorithm is proposed for feature extraction from Markov continuous observation sequences,to enhance the training effectiveness and improve the algorithm convergence speed.Simulation results show that the trained agent can make precise autonomous decisions rapidly based on airspace-target covering situation and target guidance information which significantly improves the radar search performance in the forementioned scenarios compared to traditional algorithms.
文摘Wireless sensor network(WSN)is an emerging technology which find useful in several application areas such as healthcare,environmentalmonitoring,border surveillance,etc.Several issues that exist in the designing of WSN are node localization,coverage,energy efficiency,security,and so on.In spite of the issues,node localization is considered an important issue,which intends to calculate the coordinate points of unknown nodes with the assistance of anchors.The efficiency of the WSN can be considerably influenced by the node localization accuracy.Therefore,this paper presents a modified search and rescue optimization based node localization technique(MSRONLT)forWSN.The major aim of theMSRO-NLT technique is to determine the positioning of the unknown nodes in theWSN.Since the traditional search and rescue optimization(SRO)algorithm suffers from the local optima problemwith an increase in number of iterations,MSRO algorithm is developed by the incorporation of chaotic maps to improvise the diversity of the technique.The application of the concept of chaotic map to the characteristics of the traditional SRO algorithm helps to achieve better exploration ability of the MSRO algorithm.In order to validate the effective node localization performance of the MSRO-NLT algorithm,a set of simulations were performed to highlight the supremacy of the presented model.A detailed comparative results analysis showcased the betterment of the MSRO-NLT technique over the other compared methods in terms of different measures.
文摘In machine learning and data mining,feature selection(FS)is a traditional and complicated optimization problem.Since the run time increases exponentially,FS is treated as an NP-hard problem.The researcher’s effort to build a new FS solution was inspired by the ongoing need for an efficient FS framework and the success rates of swarming outcomes in different optimization scenarios.This paper presents two binary variants of a Hunger Games Search Optimization(HGSO)algorithm based on V-and S-shaped transfer functions within a wrapper FS model for choosing the best features from a large dataset.The proposed technique transforms the continuous HGSO into a binary variant using V-and S-shaped transfer functions(BHGSO-V and BHGSO-S).To validate the accuracy,16 famous UCI datasets are considered and compared with different state-of-the-art metaheuristic binary algorithms.The findings demonstrate that BHGSO-V achieves better performance in terms of the selected number of features,classification accuracy,run time,and fitness values than other state-of-the-art algorithms.The results demonstrate that the BHGSO-V algorithm can reduce dimensionality and choose the most helpful features for classification problems.The proposed BHGSO-V achieves 95%average classification accuracy for most of the datasets,and run time is less than 5 sec.for low and medium dimensional datasets and less than 10 sec for high dimensional datasets.
文摘In this paper, we address one of the issues in the frequency assignment problem for cellular mobile networks in which we intend to minimize the interference levels when assigning frequencies from a limited frequency spectrum. In order to satisfy the increasing demand in such cellular mobile networks, we use a hybrid approach consisting of a Particle Swarm Optimization(PSO) combined with a Tabu Search(TS) algorithm. This approach takes both advantages of PSO efficiency in global optimization and TS in avoiding the premature convergence that would lead PSO to stagnate in a local minimum. Moreover, we propose a new efficient, simple, and inexpensive model for storing and evaluating solution's assignment. The purpose of this model reduces the solution's storage volume as well as the computations required to evaluate thesesolutions in comparison with the classical model. Our simulation results on the most known benchmarking instances prove the effectiveness of our proposed algorithm in comparison with previous related works in terms of convergence rate, the number of iterations, the solution storage volume and the running time required to converge to the optimal solution.
文摘Aiming at the practical application of Unmanned Underwater Vehicle(UUV)in underwater combat,this paper proposes a battlefield ambush scene with UUV considering ocean current.Firstly,by establishing these mathematical models of ocean current environment,target movement,and sonar detection,the probability calculation methods of single UUV searching target and multiple UUV cooperatively searching target are given respectively.Then,based on the Hybrid Quantum-behaved Particle Swarm Optimization(HQPSO)algorithm,the path with the highest target search probability is found.Finally,through simulation calculations,the influence of different UUV parameters and target parameters on the target search probability is analyzed,and the minimum number of UUVs that need to be deployed to complete the ambush task is demonstrated,and the optimal search path scheme is obtained.The method proposed in this paper provides a theoretical basis for the practical application of UUV in the future combat.
文摘During the last few years we have witnessed impressive developments in the area of stochastic local search techniques for intelligent optimization and Reactive Search Optimization. In order to handle the complexity, in the framework of stochastic local search optimization, learning and optimization has been deeply interconnected through interaction with the decision maker via the visualization approach of the online graphs. Consequently a number of complex optimization problems, in particular multiobjective optimization problems, arising in widely different contexts have been effectively treated within the general framework of RSO. In solving real-life multiobjective optimization problems often most emphasis are spent on finding the complete Pareto-optimal set and less on decision-making. However the com-plete task of multiobjective optimization is considered as a combined task of optimization and decision-making. In this paper, we suggest an interactive procedure which will involve the decision-maker in the optimization process helping to choose a single solution at the end. Our proposed method works on the basis of Reactive Search Optimization (RSO) algorithms and available software architecture packages. The procedure is further compared with the excising novel method of Interactive Multiobjective Optimization and Decision-Making, using Evolutionary method (I-MODE). In order to evaluate the effectiveness of both methods the well-known study case of welded beam design problem is reconsidered.
