Challenges in stratigraphic modeling arise from underground uncertainty.While borehole exploration is reliable,it remains sparse due to economic and site constraints.Electrical resistivity tomography(ERT)as a cost-eff...Challenges in stratigraphic modeling arise from underground uncertainty.While borehole exploration is reliable,it remains sparse due to economic and site constraints.Electrical resistivity tomography(ERT)as a cost-effective geophysical technique can acquire high-density data;however,uncertainty and nonuniqueness inherent in ERT impede its usage for stratigraphy identification.This paper integrates ERT and onsite observations for the first time to propose a novel method for characterizing stratigraphic profiles.The method consists of two steps:(1)ERT for prior knowledge:ERT data are processed by soft clustering using the Gaussian mixture model,followed by probability smoothing to quantify its depthdependent uncertainty;and(2)Observations for calibration:a spatial sequential Bayesian updating(SSBU)algorithm is developed to update the prior knowledge based on likelihoods derived from onsite observations,namely topsoil and boreholes.The effectiveness of the proposed method is validated through its application to a real slope site in Foshan,China.Comparative analysis with advanced borehole-driven methods highlights the superiority of incorporating ERT data in stratigraphic modeling,in terms of prediction accuracy at borehole locations and sensitivity to borehole data.Informed by ERT,reduced sensitivity to boreholes provides a fundamental solution to the longstanding challenge of sparse measurements.The paper further discusses the impact of ERT uncertainty on the proposed model using time-lapse measurements,the impact of model resolution,and applicability in engineering projects.This study,as a breakthrough in stratigraphic modeling,bridges gaps in combining geophysical and geotechnical data to address measurement sparsity and paves the way for more economical geotechnical exploration.展开更多
Current dynamic finite element model updating methods are not efficient or restricted to the problem of local optima. To circumvent these, a novel updating method which integrates the meta-model and the genetic algori...Current dynamic finite element model updating methods are not efficient or restricted to the problem of local optima. To circumvent these, a novel updating method which integrates the meta-model and the genetic algorithm is proposed. Experimental design technique is used to determine the best sampling points for the estimation of polynomial coefficients given the order and the number of independent variables. Finite element analyses are performed to generate the sampling data. Regression analysis is then used to estimate the response surface model to approximate the functional relationship between response features and design parameters on the entire design space. In the fitness evaluation of the genetic algorithm, the response surface model is used to substitute the finite element model to output features with given design parameters for the computation of fitness for the individual. Finally, the global optima that corresponds to the updated design parameter is acquired after several generations of evolution. In the application example, finite element analysis and modal testing are performed on a real chassis model. The finite element model is updated using the proposed method. After updating, root-mean-square error of modal frequencies is smaller than 2%. Furthermore, prediction ability of the updated model is validated using the testing results of the modified structure. The root-mean-square error of the prediction errors is smaller than 2%.展开更多
The dynamic characteristics of bridge structures, such as the natural frequencies, mode shapes and model damping ratio, are the basis of structural dynamic computation, seismic analysis, vibration control and structur...The dynamic characteristics of bridge structures, such as the natural frequencies, mode shapes and model damping ratio, are the basis of structural dynamic computation, seismic analysis, vibration control and structural health condition monitoring. In this paper, a three-dimensional finite-element model is established for a highway bridge over a railway on No.312 National Highway and the ambient test is carried out in site, the dynamic characteristics of the bridge are studied using the finite-element analysis and ambient vibration measurements. Comparison between the theoretical and experimental results shows that the frequency differences of the modes range between 0.44% and 8.77%. If the measurement is more reliable, the finite element model updating is necessary. Thus, a set of design variables is selected based on sensitivity analysis, then the finite element model of the bridge is updated based on optimization algorithm. The results of model updating show that the proposed updating method in this paper is more simple and effective, the updated finite element model can reflect the dynamic characteristics of the bridge better, the analytical results can provide the theoretical basis for damage identification and health condition monitoring of the bridge.展开更多
Metaheuristic algorithms are pivotal in cloud task scheduling. However, the complexity and uncertainty of the scheduling problem severely limit algorithms. To bypass this circumvent, numerous algorithms have been prop...Metaheuristic algorithms are pivotal in cloud task scheduling. However, the complexity and uncertainty of the scheduling problem severely limit algorithms. To bypass this circumvent, numerous algorithms have been proposed. The Hiking Optimization Algorithm (HOA) have been used in multiple fields. However, HOA suffers from local optimization, slow convergence, and low efficiency of late iteration search when solving cloud task scheduling problems. Thus, this paper proposes an improved HOA called CMOHOA. It collaborates with multi-strategy to improve HOA. Specifically, Chebyshev chaos is introduced to increase population diversity. Then, a hybrid speed update strategy is designed to enhance convergence speed. Meanwhile, an adversarial learning strategy is introduced to enhance the search capability in the late iteration. Different scenarios of scheduling problems are used to test the CMOHOA’s performance. First, CMOHOA was used to solve basic cloud computing task scheduling problems, and the results showed that it reduced the average total cost by 10% or more. Secondly, CMOHOA has been applied to edge fog cloud scheduling problems, and the results show that it reduces the average total scheduling cost by 2% or more. Finally, CMOHOA reduced the average total cost by 7% or more in scheduling problems for information transmission.展开更多
Evolutionary algorithms have been extensively utilized in practical applications.However,manually designed population updating formulas are inherently prone to the subjective influence of the designer.Genetic programm...Evolutionary algorithms have been extensively utilized in practical applications.However,manually designed population updating formulas are inherently prone to the subjective influence of the designer.Genetic programming(GP),characterized by its tree-based solution structure,is a widely adopted technique for optimizing the structure of mathematical models tailored to real-world problems.This paper introduces a GP-based framework(GPEAs)for the autonomous generation of update formulas,aiming to reduce human intervention.Partial modifications to tree-based GP have been instigated,encompassing adjustments to its initialization process and fundamental update operations such as crossover and mutation within the algorithm.By designing suitable function sets and terminal sets tailored to the selected evolutionary algorithm,and ultimately derive an improved update formula.The Cat Swarm Optimization Algorithm(CSO)is chosen as a case study,and the GP-EAs is employed to regenerate the speed update formulas of the CSO.To validate the feasibility of the GP-EAs,the comprehensive performance of the enhanced algorithm(GP-CSO)was evaluated on the CEC2017 benchmark suite.Furthermore,GP-CSO is applied to deduce suitable embedding factors,thereby improving the robustness of the digital watermarking process.The experimental results indicate that the update formulas generated through training with GP-EAs possess excellent performance scalability and practical application proficiency.展开更多
With the widespread adoption of hydraulic fracturing technology in oil and gas resource development,improving the accuracy and efficiency of fracturing simulations has become a critical research focus.This paper propo...With the widespread adoption of hydraulic fracturing technology in oil and gas resource development,improving the accuracy and efficiency of fracturing simulations has become a critical research focus.This paper proposes an improved fluid flow algorithm,aiming to enhance the computational efficiency of hydraulic fracturing simulations while ensuring computational accuracy.The algorithm optimizes the aperture law and iteration criteria,focusing on improving the domain volume and crack pressure update strategy,thereby enabling precise capture of dynamic borehole pressure variations during injection tests.The effectiveness of the algorithm is verified through three flow-solid coupling cases.The study also analyzes the effects of borehole size,domain volume,and crack pressure update strategy on fracturing behavior.Furthermore,the performance of the improved algorithm in terms of crack propagation rate,micro-crack formation,and fluid pressure distribution was further evaluated.The results indicate that while large-size boreholes delay crack initiation,the cracks propagate more rapidly once formed.Additionally,the optimized domain volume calculation and crack pressure update strategy significantly shorten the pressure propagation stage,promote crack propagation,and improve computational efficiency.展开更多
A new limited memory symmetric rank one algorithm is proposed. It combines a modified self-scaled symmetric rank one （SSR1） update with the limited memory and nonmonotone line search technique. In this algorithm, th...A new limited memory symmetric rank one algorithm is proposed. It combines a modified self-scaled symmetric rank one （SSR1） update with the limited memory and nonmonotone line search technique. In this algorithm, the descent search direction is generated by inverse limited memory SSR1 update, thus simplifying the computation. Numerical comparison of the algorithm and the famous limited memory BFGS algorithm is given. Comparison results indicate that the new algorithm can process a kind of large-scale unconstrained optimization problems.展开更多
The optimal matrix method and optimal elemental method used to update finite element models may not provide accurate results.This situation occurs when the test modal model is incomplete,as is often the case in practi...The optimal matrix method and optimal elemental method used to update finite element models may not provide accurate results.This situation occurs when the test modal model is incomplete,as is often the case in practice.An improved optimal elemental method is presented that defines a new objective function,and as a byproduct,circumvents the need for mass normalized modal shapes,which are also not readily available in practice.To solve the group of nonlinear equations created by the improved optimal method,the Lagrange multiplier method and Matlab function fmincon are employed.To deal with actual complex structures, the float-encoding genetic algorithm(FGA)is introduced to enhance the capability of the improved method.Two examples,a 7- degree of freedom(DOF)mass-spring system and a 53-DOF planar frame,respectively,are updated using the improved method. The example results demonstrate the advantages of the improved method over existing optimal methods,and show that the genetic algorithm is an effective way to update the models used for actual complex structures.展开更多
The dynamic finite element model （FEM） of a prestressed concrete continuous box-girder bridge, called the Tongyang Canal Bridge, is built and updated based on the results of ambient vibration testing （AVT） using a...The dynamic finite element model （FEM） of a prestressed concrete continuous box-girder bridge, called the Tongyang Canal Bridge, is built and updated based on the results of ambient vibration testing （AVT） using a real-coded accelerating genetic algorithm （RAGA）. The objective functions are defined based on natural frequency and modal assurance criterion （MAC） metrics to evaluate the updated FEM. Two objective functions are defined to fully account for the relative errors and standard deviations of the natural frequencies and MAC between the AVT results and the updated FEM predictions. The dynamically updated FEM of the bridge can better represent its structural dynamics and serve as a baseline in long-term health monitoring, condition assessment and damage identification over the service life of the bridge .展开更多
Ant colony algorithms comprise a novel category of evolutionary computation methods for optimization problems, especially for sequencing-type combinatorial optimization problems. An adaptive ant colony algorithm is pr...Ant colony algorithms comprise a novel category of evolutionary computation methods for optimization problems, especially for sequencing-type combinatorial optimization problems. An adaptive ant colony algorithm is proposed in this paper to tackle continuous-space optimization problems, using a new objective-function-based heuristic pheromone assignment approach for pheromone update to filtrate solution candidates.Global optimal solutions can be reached more rapidly by self-adjusting the path searching behaviors of the ants according to objective values. The performance of the proposed algorithm is compared with a basic ant colony algorithm and a Square Quadratic Programming approach in solving two benchmark problems with multiple extremes. The results indicated that the efficiency and reliability of the proposed algorithm were greatly improved.展开更多
To overcome the default of single search tendency, the ants in the colony are divided into several sub-groups. The ants in different subgroups have different trail information and expectation coefficients. The simulat...To overcome the default of single search tendency, the ants in the colony are divided into several sub-groups. The ants in different subgroups have different trail information and expectation coefficients. The simulated annealing method is introduced to the algorithm. Through setting the temperature changing with the iterations, after each turn of tours, the solution set obtained by the ants is taken as the candidate set. The update set is obtained by adding the solutions in the candidate set to the previous update set with the probability determined by the temperature. The solutions in the candidate set are used to update the trail information. In each turn of updating, the current best solution is also used to enhance the trail information on the current best route. The trail information is reset when the algorithm is in stagnation state. The computer experiments demonstrate that the proposed algorithm has higher stability and convergence speed.展开更多
Feature Selection(FS)is considered as an important preprocessing step in data mining and is used to remove redundant or unrelated features from high-dimensional data.Most optimization algorithms for FS problems are no...Feature Selection(FS)is considered as an important preprocessing step in data mining and is used to remove redundant or unrelated features from high-dimensional data.Most optimization algorithms for FS problems are not balanced in search.A hybrid algorithm called nonlinear binary grasshopper whale optimization algorithm(NL-BGWOA)is proposed to solve the problem in this paper.In the proposed method,a new position updating strategy combining the position changes of whales and grasshoppers population is expressed,which optimizes the diversity of searching in the target domain.Ten distinct high-dimensional UCI datasets,the multi-modal Parkinson's speech datasets,and the COVID-19 symptom dataset are used to validate the proposed method.It has been demonstrated that the proposed NL-BGWOA performs well across most of high-dimensional datasets,which shows a high accuracy rate of up to 0.9895.Furthermore,the experimental results on the medical datasets also demonstrate the advantages of the proposed method in actual FS problem,including accuracy,size of feature subsets,and fitness with best values of 0.913,5.7,and 0.0873,respectively.The results reveal that the proposed NL-BGWOA has comprehensive superiority in solving the FS problem of high-dimensional data.展开更多
In this paper, primal-dual interior-point algorithm with dynamic step size is implemented for linear programming （LP） problems. The algorithms are based on a few kernel functions, including both serf-regular functio...In this paper, primal-dual interior-point algorithm with dynamic step size is implemented for linear programming （LP） problems. The algorithms are based on a few kernel functions, including both serf-regular functions and non-serf-regular ones. The dynamic step size is compared with fixed step size for the algorithms in inner iteration of Newton step. Numerical tests show that the algorithms with dynaraic step size are more efficient than those with fixed step size.展开更多
In response to the shortcomings of the Salp Swarm Algorithm (SSA) such as low convergence accuracy and slow convergence speed, a Multi-Strategy-Driven Salp Swarm Algorithm (MSD-SSA) was proposed. First, food sources o...In response to the shortcomings of the Salp Swarm Algorithm (SSA) such as low convergence accuracy and slow convergence speed, a Multi-Strategy-Driven Salp Swarm Algorithm (MSD-SSA) was proposed. First, food sources or random leaders were associated with the current bottle sea squirt at the beginning of the iteration, to which Levy flight random walk and crossover operators with small probability were added to improve the global search and ability to jump out of local optimum. Secondly, the position mean of the leader was used to establish a link with the followers, which effectively avoided the blind following of the followers and greatly improved the convergence speed of the algorithm. Finally, Brownian motion stochastic steps were introduced to improve the convergence accuracy of populations near food sources. The improved method switched under changes in the adaptive parameters, balancing the exploration and development of SSA. In the simulation experiments, the performance of the algorithm was examined using SSA and MSD-SSA on the commonly used CEC benchmark test functions and CEC2017-constrained optimization problems, and the effectiveness of MSD-SSA was verified by solving three real engineering problems. The results showed that MSD-SSA improved the convergence speed and convergence accuracy of the algorithm, and achieved good results in practical engineering problems.展开更多
Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed...Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed by adopting adaptive step length and improved update strategy of wolf pack. AIBWPA is applied to 10 classic 0-1 knapsack problems and compared with BWPA, DPSO, which proves that AIBWPA has higher optimization accuracy and better computational robustness. AIBWPA makes the parameters simple, protects the population diversity and enhances the global convergence.展开更多
基金the financial support from the National Key R&D Program of China(Grant No.2021YFC3001003)Science and Technology Development Fund,Macao SAR(File No.0056/2023/RIB2)Guangdong Provincial Department of Science and Technology(Grant No.2022A0505030019).
文摘Challenges in stratigraphic modeling arise from underground uncertainty.While borehole exploration is reliable,it remains sparse due to economic and site constraints.Electrical resistivity tomography(ERT)as a cost-effective geophysical technique can acquire high-density data;however,uncertainty and nonuniqueness inherent in ERT impede its usage for stratigraphy identification.This paper integrates ERT and onsite observations for the first time to propose a novel method for characterizing stratigraphic profiles.The method consists of two steps:(1)ERT for prior knowledge:ERT data are processed by soft clustering using the Gaussian mixture model,followed by probability smoothing to quantify its depthdependent uncertainty;and(2)Observations for calibration:a spatial sequential Bayesian updating(SSBU)algorithm is developed to update the prior knowledge based on likelihoods derived from onsite observations,namely topsoil and boreholes.The effectiveness of the proposed method is validated through its application to a real slope site in Foshan,China.Comparative analysis with advanced borehole-driven methods highlights the superiority of incorporating ERT data in stratigraphic modeling,in terms of prediction accuracy at borehole locations and sensitivity to borehole data.Informed by ERT,reduced sensitivity to boreholes provides a fundamental solution to the longstanding challenge of sparse measurements.The paper further discusses the impact of ERT uncertainty on the proposed model using time-lapse measurements,the impact of model resolution,and applicability in engineering projects.This study,as a breakthrough in stratigraphic modeling,bridges gaps in combining geophysical and geotechnical data to address measurement sparsity and paves the way for more economical geotechnical exploration.
文摘Current dynamic finite element model updating methods are not efficient or restricted to the problem of local optima. To circumvent these, a novel updating method which integrates the meta-model and the genetic algorithm is proposed. Experimental design technique is used to determine the best sampling points for the estimation of polynomial coefficients given the order and the number of independent variables. Finite element analyses are performed to generate the sampling data. Regression analysis is then used to estimate the response surface model to approximate the functional relationship between response features and design parameters on the entire design space. In the fitness evaluation of the genetic algorithm, the response surface model is used to substitute the finite element model to output features with given design parameters for the computation of fitness for the individual. Finally, the global optima that corresponds to the updated design parameter is acquired after several generations of evolution. In the application example, finite element analysis and modal testing are performed on a real chassis model. The finite element model is updated using the proposed method. After updating, root-mean-square error of modal frequencies is smaller than 2%. Furthermore, prediction ability of the updated model is validated using the testing results of the modified structure. The root-mean-square error of the prediction errors is smaller than 2%.
基金Supported by the National Natural Science Foundation of China(50378041)the Program for New Century Excellent Talents of Ministry of Educationof China (2004)
文摘The dynamic characteristics of bridge structures, such as the natural frequencies, mode shapes and model damping ratio, are the basis of structural dynamic computation, seismic analysis, vibration control and structural health condition monitoring. In this paper, a three-dimensional finite-element model is established for a highway bridge over a railway on No.312 National Highway and the ambient test is carried out in site, the dynamic characteristics of the bridge are studied using the finite-element analysis and ambient vibration measurements. Comparison between the theoretical and experimental results shows that the frequency differences of the modes range between 0.44% and 8.77%. If the measurement is more reliable, the finite element model updating is necessary. Thus, a set of design variables is selected based on sensitivity analysis, then the finite element model of the bridge is updated based on optimization algorithm. The results of model updating show that the proposed updating method in this paper is more simple and effective, the updated finite element model can reflect the dynamic characteristics of the bridge better, the analytical results can provide the theoretical basis for damage identification and health condition monitoring of the bridge.
基金supported by the National Natural Science Foundation of China (52275480)the Guizhou Provincial Science and Technology Program of Qiankehe Zhongdi Guiding ([2023]02)+1 种基金the Guizhou Provincial Science and Technology Program of Qiankehe Platform Talent Project (GCC[2023]001)the Guizhou Provincial Science and Technology Project of Qiankehe Platform Project (KXJZ[2024]002).
文摘Metaheuristic algorithms are pivotal in cloud task scheduling. However, the complexity and uncertainty of the scheduling problem severely limit algorithms. To bypass this circumvent, numerous algorithms have been proposed. The Hiking Optimization Algorithm (HOA) have been used in multiple fields. However, HOA suffers from local optimization, slow convergence, and low efficiency of late iteration search when solving cloud task scheduling problems. Thus, this paper proposes an improved HOA called CMOHOA. It collaborates with multi-strategy to improve HOA. Specifically, Chebyshev chaos is introduced to increase population diversity. Then, a hybrid speed update strategy is designed to enhance convergence speed. Meanwhile, an adversarial learning strategy is introduced to enhance the search capability in the late iteration. Different scenarios of scheduling problems are used to test the CMOHOA’s performance. First, CMOHOA was used to solve basic cloud computing task scheduling problems, and the results showed that it reduced the average total cost by 10% or more. Secondly, CMOHOA has been applied to edge fog cloud scheduling problems, and the results show that it reduces the average total scheduling cost by 2% or more. Finally, CMOHOA reduced the average total cost by 7% or more in scheduling problems for information transmission.
文摘Evolutionary algorithms have been extensively utilized in practical applications.However,manually designed population updating formulas are inherently prone to the subjective influence of the designer.Genetic programming(GP),characterized by its tree-based solution structure,is a widely adopted technique for optimizing the structure of mathematical models tailored to real-world problems.This paper introduces a GP-based framework(GPEAs)for the autonomous generation of update formulas,aiming to reduce human intervention.Partial modifications to tree-based GP have been instigated,encompassing adjustments to its initialization process and fundamental update operations such as crossover and mutation within the algorithm.By designing suitable function sets and terminal sets tailored to the selected evolutionary algorithm,and ultimately derive an improved update formula.The Cat Swarm Optimization Algorithm(CSO)is chosen as a case study,and the GP-EAs is employed to regenerate the speed update formulas of the CSO.To validate the feasibility of the GP-EAs,the comprehensive performance of the enhanced algorithm(GP-CSO)was evaluated on the CEC2017 benchmark suite.Furthermore,GP-CSO is applied to deduce suitable embedding factors,thereby improving the robustness of the digital watermarking process.The experimental results indicate that the update formulas generated through training with GP-EAs possess excellent performance scalability and practical application proficiency.
基金supported by the National Natural Science Foundation of China(Nos.52164001,52064006,52004072 and 52364004)the Science and Technology Support Project of Guizhou(Nos.[2020]4Y044,[2021]N404 and[2021]N511)+1 种基金the Guizhou Provincial Science and Technology Foundation(No.GCC[2022]005-1),Talents of Guizhou University(No.201901)the Special Research Funds of Guizhou University(Nos.201903,202011,and 202012).
文摘With the widespread adoption of hydraulic fracturing technology in oil and gas resource development,improving the accuracy and efficiency of fracturing simulations has become a critical research focus.This paper proposes an improved fluid flow algorithm,aiming to enhance the computational efficiency of hydraulic fracturing simulations while ensuring computational accuracy.The algorithm optimizes the aperture law and iteration criteria,focusing on improving the domain volume and crack pressure update strategy,thereby enabling precise capture of dynamic borehole pressure variations during injection tests.The effectiveness of the algorithm is verified through three flow-solid coupling cases.The study also analyzes the effects of borehole size,domain volume,and crack pressure update strategy on fracturing behavior.Furthermore,the performance of the improved algorithm in terms of crack propagation rate,micro-crack formation,and fluid pressure distribution was further evaluated.The results indicate that while large-size boreholes delay crack initiation,the cracks propagate more rapidly once formed.Additionally,the optimized domain volume calculation and crack pressure update strategy significantly shorten the pressure propagation stage,promote crack propagation,and improve computational efficiency.
基金the National Natural Science Foundation of China(10471062)the Natural Science Foundation of Jiangsu Province(BK2006184)~~
文摘A new limited memory symmetric rank one algorithm is proposed. It combines a modified self-scaled symmetric rank one （SSR1） update with the limited memory and nonmonotone line search technique. In this algorithm, the descent search direction is generated by inverse limited memory SSR1 update, thus simplifying the computation. Numerical comparison of the algorithm and the famous limited memory BFGS algorithm is given. Comparison results indicate that the new algorithm can process a kind of large-scale unconstrained optimization problems.
基金The China Hi-Tech R&D Program(863 Program) Project Number 2001AA602023
文摘The optimal matrix method and optimal elemental method used to update finite element models may not provide accurate results.This situation occurs when the test modal model is incomplete,as is often the case in practice.An improved optimal elemental method is presented that defines a new objective function,and as a byproduct,circumvents the need for mass normalized modal shapes,which are also not readily available in practice.To solve the group of nonlinear equations created by the improved optimal method,the Lagrange multiplier method and Matlab function fmincon are employed.To deal with actual complex structures, the float-encoding genetic algorithm(FGA)is introduced to enhance the capability of the improved method.Two examples,a 7- degree of freedom(DOF)mass-spring system and a 53-DOF planar frame,respectively,are updated using the improved method. The example results demonstrate the advantages of the improved method over existing optimal methods,and show that the genetic algorithm is an effective way to update the models used for actual complex structures.
基金National Natural Science Foundation of China Under Grant No.50575101Transportation Science Research Item of Jiangsu Province Under Grant No.06Y20
文摘The dynamic finite element model （FEM） of a prestressed concrete continuous box-girder bridge, called the Tongyang Canal Bridge, is built and updated based on the results of ambient vibration testing （AVT） using a real-coded accelerating genetic algorithm （RAGA）. The objective functions are defined based on natural frequency and modal assurance criterion （MAC） metrics to evaluate the updated FEM. Two objective functions are defined to fully account for the relative errors and standard deviations of the natural frequencies and MAC between the AVT results and the updated FEM predictions. The dynamically updated FEM of the bridge can better represent its structural dynamics and serve as a baseline in long-term health monitoring, condition assessment and damage identification over the service life of the bridge .
文摘Ant colony algorithms comprise a novel category of evolutionary computation methods for optimization problems, especially for sequencing-type combinatorial optimization problems. An adaptive ant colony algorithm is proposed in this paper to tackle continuous-space optimization problems, using a new objective-function-based heuristic pheromone assignment approach for pheromone update to filtrate solution candidates.Global optimal solutions can be reached more rapidly by self-adjusting the path searching behaviors of the ants according to objective values. The performance of the proposed algorithm is compared with a basic ant colony algorithm and a Square Quadratic Programming approach in solving two benchmark problems with multiple extremes. The results indicated that the efficiency and reliability of the proposed algorithm were greatly improved.
基金Project supported by the National Natural Science Foundation of China (Grant No.50608069)
文摘To overcome the default of single search tendency, the ants in the colony are divided into several sub-groups. The ants in different subgroups have different trail information and expectation coefficients. The simulated annealing method is introduced to the algorithm. Through setting the temperature changing with the iterations, after each turn of tours, the solution set obtained by the ants is taken as the candidate set. The update set is obtained by adding the solutions in the candidate set to the previous update set with the probability determined by the temperature. The solutions in the candidate set are used to update the trail information. In each turn of updating, the current best solution is also used to enhance the trail information on the current best route. The trail information is reset when the algorithm is in stagnation state. The computer experiments demonstrate that the proposed algorithm has higher stability and convergence speed.
基金supported by Natural Science Foundation of Liaoning Province under Grant 2021-MS-272Educational Committee project of Liaoning Province under Grant LJKQZ2021088.
文摘Feature Selection(FS)is considered as an important preprocessing step in data mining and is used to remove redundant or unrelated features from high-dimensional data.Most optimization algorithms for FS problems are not balanced in search.A hybrid algorithm called nonlinear binary grasshopper whale optimization algorithm(NL-BGWOA)is proposed to solve the problem in this paper.In the proposed method,a new position updating strategy combining the position changes of whales and grasshoppers population is expressed,which optimizes the diversity of searching in the target domain.Ten distinct high-dimensional UCI datasets,the multi-modal Parkinson's speech datasets,and the COVID-19 symptom dataset are used to validate the proposed method.It has been demonstrated that the proposed NL-BGWOA performs well across most of high-dimensional datasets,which shows a high accuracy rate of up to 0.9895.Furthermore,the experimental results on the medical datasets also demonstrate the advantages of the proposed method in actual FS problem,including accuracy,size of feature subsets,and fitness with best values of 0.913,5.7,and 0.0873,respectively.The results reveal that the proposed NL-BGWOA has comprehensive superiority in solving the FS problem of high-dimensional data.
基金Project supported by Dutch Organization for Scientific Research(Grant No .613 .000 .010)
文摘In this paper, primal-dual interior-point algorithm with dynamic step size is implemented for linear programming （LP） problems. The algorithms are based on a few kernel functions, including both serf-regular functions and non-serf-regular ones. The dynamic step size is compared with fixed step size for the algorithms in inner iteration of Newton step. Numerical tests show that the algorithms with dynaraic step size are more efficient than those with fixed step size.
文摘In response to the shortcomings of the Salp Swarm Algorithm (SSA) such as low convergence accuracy and slow convergence speed, a Multi-Strategy-Driven Salp Swarm Algorithm (MSD-SSA) was proposed. First, food sources or random leaders were associated with the current bottle sea squirt at the beginning of the iteration, to which Levy flight random walk and crossover operators with small probability were added to improve the global search and ability to jump out of local optimum. Secondly, the position mean of the leader was used to establish a link with the followers, which effectively avoided the blind following of the followers and greatly improved the convergence speed of the algorithm. Finally, Brownian motion stochastic steps were introduced to improve the convergence accuracy of populations near food sources. The improved method switched under changes in the adaptive parameters, balancing the exploration and development of SSA. In the simulation experiments, the performance of the algorithm was examined using SSA and MSD-SSA on the commonly used CEC benchmark test functions and CEC2017-constrained optimization problems, and the effectiveness of MSD-SSA was verified by solving three real engineering problems. The results showed that MSD-SSA improved the convergence speed and convergence accuracy of the algorithm, and achieved good results in practical engineering problems.
文摘Binary wolf pack algorithm (BWPA) is a kind of intelligence algorithm which can solve combination optimization problems in discrete spaces.Based on BWPA, an improved binary wolf pack algorithm (AIBWPA) can be proposed by adopting adaptive step length and improved update strategy of wolf pack. AIBWPA is applied to 10 classic 0-1 knapsack problems and compared with BWPA, DPSO, which proves that AIBWPA has higher optimization accuracy and better computational robustness. AIBWPA makes the parameters simple, protects the population diversity and enhances the global convergence.
