This study evaluates the undrained uplift capacity of open-caisson anchors embedded in anisotropic clay using Finite Element Limit Analysis(FELA)and a hybrid machine learning framework.The FELA simulations inves-tigat...This study evaluates the undrained uplift capacity of open-caisson anchors embedded in anisotropic clay using Finite Element Limit Analysis(FELA)and a hybrid machine learning framework.The FELA simulations inves-tigate the influence of the radius ratio(R/B),anisotropic ratio(re),interface roughness factor(α),and inclination angle(β).Specifically,the results reveal that increasingβsignificantly enhances Nc,especially as soil behavior approaches isotropy.Higherαimproves resistance at steeper inclinations by mobilizing greater interface shear.Nc increases with re,reflecting enhanced strength under isotropic conditions.To enhance predictive accuracy and generalization,a hybrid machine learning model was developed by integrating Extreme Gradient Boosting(XGBoost)with Genetic Algorithm(GA)and Mutation-Based Genetic Algorithm(MGA)for hyperparameter tuning.Among the models,MGA-XGBoost outperformed GA-XGBoost,achieving higher predictive accuracy(R^(2)=0.996 training,0.993 testing).Furthermore,SHAP analysis consistently identified anisotropic ratio(re)as the most influential factor in predicting uplift capacity,followed by interface roughness factor(α),inclination angle(β),and radius ratio(R/B).The proposed framework serves as a scalable decision-support tool adaptable to various soil types and foundation geometries,offering a more efficient and data-driven approach to uplift-resistant design in anisotropic cohesive soils.展开更多
Wind energy has emerged as a potential replacement for fossil fuel-based energy sources.To harness maximum wind energy,a crucial decision in the development of an efficient wind farm is the optimal layout design.This ...Wind energy has emerged as a potential replacement for fossil fuel-based energy sources.To harness maximum wind energy,a crucial decision in the development of an efficient wind farm is the optimal layout design.This layout defines the specific locations of the turbines within the wind farm.The process of finding the optimal locations of turbines,in the presence of various technical and technological constraints,makes the wind farm layout design problem a complex optimization problem.This problem has traditionally been solved with nature-inspired algorithms with promising results.The performance and convergence of nature-inspired algorithms depend on several parameters,among which the algorithm termination criterion plays a crucial role.Timely convergence is an important aspect of efficient algorithm design because an inefficient algorithm results in wasted computational resources,unwarranted electricity consumption,and hardware stress.This study provides an in-depth analysis of several termination criteria while using the genetic algorithm as a test bench,with its application to the wind farm layout design problem while considering various wind scenarios.The performance of six termination criteria is empirically evaluated with respect to the quality of solutions produced and the execution time involved.Due to the conflicting nature of these two attributes,fuzzy logic-based multi-attribute decision-making is employed in the decision process.Results for the fuzzy decision approach indicate that among the various criteria tested,the criterion Phi achieves an improvement in the range of 2.44%to 32.93%for wind scenario 1.For scenario 2,Best-worst termination criterion performed well compared to the other criteria evaluated,with an improvement in the range of 1.2%to 9.64%.For scenario 3,Hitting bound was the best performer with an improvement of 1.16%to 20.93%.展开更多
Natural Language Processing(NLP)has become essential in text classification,sentiment analysis,machine translation,and speech recognition applications.As these tasks become complex,traditionalmachine learning and deep...Natural Language Processing(NLP)has become essential in text classification,sentiment analysis,machine translation,and speech recognition applications.As these tasks become complex,traditionalmachine learning and deep learning models encounter challenges with optimization,parameter tuning,and handling large-scale,highdimensional data.Bio-inspired algorithms,which mimic natural processes,offer robust optimization capabilities that can enhance NLP performance by improving feature selection,optimizing model parameters,and integrating adaptive learning mechanisms.This review explores the state-of-the-art applications of bio-inspired algorithms—such as Genetic Algorithms(GA),Particle Swarm Optimization(PSO),and Ant Colony Optimization(ACO)—across core NLP tasks.We analyze their comparative advantages,discuss their integration with neural network models,and address computational and scalability limitations.Through a synthesis of existing research,this paper highlights the unique strengths and current challenges of bio-inspired approaches in NLP,offering insights into hybrid models and lightweight,resource-efficient adaptations for real-time processing.Finally,we outline future research directions that emphasize the development of scalable,effective bio-inspired methods adaptable to evolving data environments.展开更多
The distribution of shear-wave velocities in the subsurface is generally used to assess the potential forseismic liquefaction and soil amplification effects and to classify seismic sites. Newly developeddistributed ac...The distribution of shear-wave velocities in the subsurface is generally used to assess the potential forseismic liquefaction and soil amplification effects and to classify seismic sites. Newly developeddistributed acoustic sensing (DAS) technology enables estimation of the shear-wave distribution as ahigh-density seismic observation system. This technology is characterized by low maintenance costs,high-resolution outputs, and real-time data transmission capabilities, albeit with the challenge ofmanaging massive data generation. Rapid and efficient interpretation of data is the key to advancingapplication of the DAS technology. In this study, field tests were carried out to record ambient noise overa short period using DAS technology, from which the surface-wave dispersion curves were extracted. Inorder to reduce the influence of directional effects on the results, an unsupervised clustering method isused to select appropriate clusters to extract the Green's function. A combination of a genetic algorithmand Monte Carlo (GA-MC) simulation is proposed to invert the subsurface velocity structure. Thestratigraphic profiles obtained by the GA-MC method are in agreement with the borehole profiles.Compared to other methods, the proposed optimization method not only improves the solution qualitybut also reduces the solution time.展开更多
This paper introduced the Genetic Algorithms (GAs) and Artificial Neural Networks (ANNs), which have been widely used in optimization of allocating. The combination way of the two optimizing algorithms was used in boa...This paper introduced the Genetic Algorithms (GAs) and Artificial Neural Networks (ANNs), which have been widely used in optimization of allocating. The combination way of the two optimizing algorithms was used in board allocating of furniture production. In the experiment, the rectangular flake board of 3650 mm 1850 mm was used as raw material to allocate 100 sets of Table Bucked. The utilizing rate of the board reached 94.14 % and the calculating time was only 35 s. The experiment result proofed that the method by using the GA for optimizing the weights of the ANN can raise the utilizing rate of the board and can shorten the time of the design. At the same time, this method can simultaneously searched in many directions, thus greatly in-creasing the probability of finding a global optimum.展开更多
To establish a parallel fusion approach of processing high dimensional information, the model and criterion of multisensor fuzzy stochastic data fusion were presented. In order to design genetic algorithm fusion, the ...To establish a parallel fusion approach of processing high dimensional information, the model and criterion of multisensor fuzzy stochastic data fusion were presented. In order to design genetic algorithm fusion, the fusion parameter coding, initial population and fitness function establishing, and fuzzy logic controller designing for genetic operations and probability choosing were completed. The discussion on the highly dimensional fusion was given. For a moving target with the division of 1 64 (velocity) and 1 75 (acceleration), the precision of fusion is 0 94 and 0 98 respectively. The fusion approach can improve the reliability and decision precision effectively.展开更多
A compound algorithm of genetic annealing is designed for optimizing the luffing mechanism locus of a plane link by means of random optimal algorithm, genetic and annealing algorithm. The computing experiment shows th...A compound algorithm of genetic annealing is designed for optimizing the luffing mechanism locus of a plane link by means of random optimal algorithm, genetic and annealing algorithm. The computing experiment shows that the algorithm has much better steady convergence performance of optimal process and can hunt out the global optimal solution by biggish probability for objective function of multi peak value.展开更多
Although the genetic algorithm (GA) has very powerful robustness and fitness, it needs a large size of population and a large number of iterations to reach the optimum result. Especially when GA is used in complex str...Although the genetic algorithm (GA) has very powerful robustness and fitness, it needs a large size of population and a large number of iterations to reach the optimum result. Especially when GA is used in complex structural optimization problems, if the structural reanalysis technique is not adopted, the more the number of finite element analysis (FEA) is, the more the consuming time is. In the conventional structural optimization the number of FEA can be reduced by the structural reanalysis technique based on the approximation techniques and sensitivity analysis. With these techniques, this paper provides a new approximation model-segment approximation model, adopted for the GA application. This segment approximation model can decrease the number of FEA and increase the convergence rate of GA. So it can apparently decrease the computation time of GA. Two examples demonstrate the availability of the new segment approximation model.展开更多
An approach to addressing the stereo correspondence problem is presented using genetic algorithms (GAs) to obtain a dense disparity map. Different from previous methods, this approach casts the stereo matching as a mu...An approach to addressing the stereo correspondence problem is presented using genetic algorithms (GAs) to obtain a dense disparity map. Different from previous methods, this approach casts the stereo matching as a multi-extrema optimization problem such that finding the fittest solution from a set of potential disparity maps. Among a wide variety of optimization techniques, GAs are proven to be potentially effective methods for the global optimization problems with large search space. With this idea, each disparity map is viewed as an individual and the disparity values are encoded as chromosomes, so each individual has lots of chromosomes in the approach. Then, several matching constraints are formulated into an objective function, and GAs are used to search the global optimal solution for the problem. Furthermore, the coarse-to-fine strategy has been embedded in the approach so as to reduce the matching ambiguity and the time consumption. Finally, experimental results on synthetic and real images show the performance of the work.展开更多
The methods of moment and genetic algorithm (GA) are combined to optimize the Yagi Uda antenna array and Log periodic dipole antenna (LPDA) array. The element lengths and spacing are optimized for the Yagi Uda arra...The methods of moment and genetic algorithm (GA) are combined to optimize the Yagi Uda antenna array and Log periodic dipole antenna (LPDA) array. The element lengths and spacing are optimized for the Yagi Uda array; while the ratio factor of spacing to length as well as the ratio of length to diameter of the elements are optimized for LPDA array. The results show that the main parameters, such as gain and pattern, have been improved apparently; and the high back lobe level of LPDA can be reduced greatly, therefore, GA is a very competent method for optimizing the linear array as well as in other fields.展开更多
In this paper, an ‘in-house＇ genetic algorithm is described and applied to an optimization problem for improving the aerodynamic performances of an aircraft wing tip through upper surface morphing. The algorithm＇s ...In this paper, an ‘in-house＇ genetic algorithm is described and applied to an optimization problem for improving the aerodynamic performances of an aircraft wing tip through upper surface morphing. The algorithm＇s performances were studied from the convergence point of view, in accordance with design conditions. The algorithm was compared to two other optimization methods,namely the artificial bee colony and a gradient method, for two optimization objectives, and the results of the optimizations with each of the three methods were plotted on response surfaces obtained with the Monte Carlo method, to show that they were situated in the global optimum region. The optimization results for 16 wind tunnel test cases and 2 objective functions were presented. The 16 cases used for the optimizations were included in the experimental test plan for the morphing wing-tip demonstrator, and the results obtained using the displacements given by the optimizations were evaluated.展开更多
Compression index Ccis an essential parameter in geotechnical design for which the effectiveness of correlation is still a challenge.This paper suggests a novel modelling approach using machine learning(ML)technique.T...Compression index Ccis an essential parameter in geotechnical design for which the effectiveness of correlation is still a challenge.This paper suggests a novel modelling approach using machine learning(ML)technique.The performance of five commonly used machine learning(ML)algorithms,i.e.back-propagation neural network(BPNN),extreme learning machine(ELM),support vector machine(SVM),random forest(RF)and evolutionary polynomial regression(EPR)in predicting Cc is comprehensively investigated.A database with a total number of 311 datasets including three input variables,i.e.initial void ratio e0,liquid limit water content wL,plasticity index Ip,and one output variable Cc is first established.Genetic algorithm(GA)is used to optimize the hyper-parameters in five ML algorithms,and the average prediction error for the 10-fold cross-validation(CV)sets is set as thefitness function in the GA for enhancing the robustness of ML models.The results indicate that ML models outperform empirical prediction formulations with lower prediction error.RF yields the lowest error followed by BPNN,ELM,EPR and SVM.If the ranges of input variables in the database are large enough,BPNN and RF models are recommended to predict Cc.Furthermore,if the distribution of input variables is continuous,RF model is the best one.Otherwise,EPR model is recommended if the ranges of input variables are small.The predicted correlations between input and output variables using five ML models show great agreement with the physical explanation.展开更多
A genetic algorithm (GA)-based method is proposed to solve the nonlinearoptimization problem of minimum zone cylindricity evaluation. First, the background of the problemis introduced. Then the mathematical model and ...A genetic algorithm (GA)-based method is proposed to solve the nonlinearoptimization problem of minimum zone cylindricity evaluation. First, the background of the problemis introduced. Then the mathematical model and the fitness function are derived from themathematical definition of dimensioning and tolerancing principles. Thirdly with the least squaressolution as the initial values, the whole implementation process of the algorithm is realized inwhich some key techniques, for example, variables representing, population initializing and suchbasic operations as selection, crossover and mutation, are discussed in detail. Finally, examplesare quoted to verify the proposed algorithm. The computation results indicate that the GA-basedoptimization method performs well on cylindricity evaluation. The outstanding advantages concludehigh accuracy, high efficiency and capabilities of solving complicated nonlinear and large spaceproblems.展开更多
Some variational data assimilation （VDA） problems of time- and space-discrete models with on/off parameterizations can be regarded as non-smooth optimization problems. Same as the sub-gradient type method, intellige...Some variational data assimilation （VDA） problems of time- and space-discrete models with on/off parameterizations can be regarded as non-smooth optimization problems. Same as the sub-gradient type method, intelligent optimization algorithms, which are widely used in engineering optimization, can also be adopted in VDA in virtue of their no requirement of cost function＇s gradient （or sub-gradient） and their capability of global convergence. Two typical intelligent optimization algorithms, genetic algorithm （GA） and particle swarm optimization （PSO）, are introduced to VDA of modified Lorenz equations with on-off parameterizations, then two VDA schemes are proposed, that is, GA based VDA （GA-VDA） and PSO based VDA （PSO-VDA）. After revealing the advantage of GA and PSO over conventional adjoint methods in the ability of global searching at the existence of cost function＇s discontinuity induced by on-off switches, sensitivities of GA-VDA and PSO-VDA to population size, observational noise, model error and observational density are detailedly analyzed. It＇s shown that, in the context of modified Lorenz equations, with proper population size, GA-VDA and PSO-VDA can effectively estimate the global optimal solution, while PSO-VDA consumes much less computational time than GA-VDA with the same population size, and requires a much lower population size with nearly the same results, both methods are not very sensitive to observation noise and model error, while PSO-VDA shows a better performance with observational noise than GA-VDA. It is encouraging that both methods are not sensitive to observational density, especially PSO-VDA, using which almost the same perfect assimilation results can be obtained with comparatively sparse observations.展开更多
In this paper, a mathematical model consisting of forward and backward models is built on parallel genetic algorithms (PGAs) for fault diagnosis in a transmission power system. A new method to reduce the scale of faul...In this paper, a mathematical model consisting of forward and backward models is built on parallel genetic algorithms (PGAs) for fault diagnosis in a transmission power system. A new method to reduce the scale of fault sections is developed in the forward model and the message passing interface (MPI) approach is chosen to parallel the genetic algorithms by global sin-gle-population master-slave method (GPGAs). The proposed approach is applied to a sample system consisting of 28 sections, 84 protective relays and 40 circuit breakers. Simulation results show that the new model based on GPGAs can achieve very fast computation in online applications of large-scale power systems.展开更多
Dynamic optimization problems are a kind of optimization problems that involve changes over time. They pose a serious challenge to traditional optimization methods as well as conventional genetic algorithms since the ...Dynamic optimization problems are a kind of optimization problems that involve changes over time. They pose a serious challenge to traditional optimization methods as well as conventional genetic algorithms since the goal is no longer to search for the optimal solution（s） of a fixed problem but to track the moving optimum over time. Dynamic optimization problems have attracted a growing interest from the genetic algorithm community in recent years. Several approaches have been developed to enhance the performance of genetic algorithms in dynamic environments. One approach is to maintain the diversity of the population via random immigrants. This paper proposes a hybrid immigrants scheme that combines the concepts of elitism, dualism and random immigrants for genetic algorithms to address dynamic optimization problems. In this hybrid scheme, the best individual, i.e., the elite, from the previous generation and its dual individual are retrieved as the bases to create immigrants via traditional mutation scheme. These elitism-based and dualism-based immigrants together with some random immigrants are substituted into the current population, replacing the worst individuals in the population. These three kinds of immigrants aim to address environmental changes of slight, medium and significant degrees respectively and hence efficiently adapt genetic algorithms to dynamic environments that are subject to different severities of changes. Based on a series of systematically constructed dynamic test problems, experiments are carried out to investigate the performance of genetic algorithms with the hybrid immigrants scheme and traditional random immigrants scheme. Experimental results validate the efficiency of the proposed hybrid immigrants scheme for improving the performance of genetic algorithms in dynamic environments.展开更多
The problem of joint radio and cloud resources allocation is studied for heterogeneous mobile cloud computing networks. The objective of the proposed joint resource allocation schemes is to maximize the total utility ...The problem of joint radio and cloud resources allocation is studied for heterogeneous mobile cloud computing networks. The objective of the proposed joint resource allocation schemes is to maximize the total utility of users as well as satisfy the required quality of service(QoS) such as the end-to-end response latency experienced by each user. We formulate the problem of joint resource allocation as a combinatorial optimization problem. Three evolutionary approaches are considered to solve the problem: genetic algorithm(GA), ant colony optimization with genetic algorithm(ACO-GA), and quantum genetic algorithm(QGA). To decrease the time complexity, we propose a mapping process between the resource allocation matrix and the chromosome of GA, ACO-GA, and QGA, search the available radio and cloud resource pairs based on the resource availability matrixes for ACOGA, and encode the difference value between the allocated resources and the minimum resource requirement for QGA. Extensive simulation results show that our proposed methods greatly outperform the existing algorithms in terms of running time, the accuracy of final results, the total utility, resource utilization and the end-to-end response latency guaranteeing.展开更多
In this paper, an underwater vehicle was modeled with six dimensional nonlinear equations of motion, controlled by DC motors in all degrees of freedom. Near-optimal trajectories in an energetic environment for underwa...In this paper, an underwater vehicle was modeled with six dimensional nonlinear equations of motion, controlled by DC motors in all degrees of freedom. Near-optimal trajectories in an energetic environment for underwater vehicles were computed using a nnmerical solution of a nonlinear optimal control problem （NOCP）. An energy performance index as a cost function, which should be minimized, was defmed. The resulting problem was a two-point boundary value problem （TPBVP）. A genetic algorithm （GA）, particle swarm optimization （PSO）, and ant colony optimization （ACO） algorithms were applied to solve the resulting TPBVP. Applying an Euler-Lagrange equation to the NOCP, a conjugate gradient penalty method was also adopted to solve the TPBVP. The problem of energetic environments, involving some energy sources, was discussed. Some near-optimal paths were found using a GA, PSO, and ACO algorithms. Finally, the problem of collision avoidance in an energetic environment was also taken into account.展开更多
The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job ther...The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed.However,JSP with alternative machines for various operations is an extension of the classical JSP,which allows an operation to be processed by any machine from a given set of machines.Since this problem requires an additional decision of machine allocation during scheduling,it is much more complex than JSP.We present a domain independent genetic algorithm(GA) approach for the job shop scheduling problem with alternative machines.The GA is implemented in a spreadsheet environment.The performance of the proposed GA is analyzed by comparing with various problem instances taken from the literatures.The result shows that the proposed GA is competitive with the existing approaches.A simplified approach that would be beneficial to both practitioners and researchers is presented for solving scheduling problems with alternative machines.展开更多
In this paper, a multi-objective particle swarm optimization （MOPSO） algorithm and a nondominated sorting genetic algorithm II （NSGA-II） are used to optimize the operating parameters of a 1.6 L, spark ignition （S...In this paper, a multi-objective particle swarm optimization （MOPSO） algorithm and a nondominated sorting genetic algorithm II （NSGA-II） are used to optimize the operating parameters of a 1.6 L, spark ignition （SI） gasoline engine. The aim of this optimization is to reduce engine emissions in terms of carbon monoxide （CO）, hydrocarbons （HC）, and nitrogen oxides （NOx）, which are the causes of diverse environmental problems such as air pollution and global warming. Stationary engine tests were performed for data generation, covering 60 operating conditions. Artificial neural networks （ANNs） were used to predict exhaust emissions, whose inputs were from six engine operating parameters, and the outputs were three resulting exhaust emissions. The outputs of ANNs were used to evaluate objective functions within the optimization algorithms： NSGA-II and MOPSO. Then a decision-making process was conducted, using a fuzzy method to select a Pareto solution with which the best emission reductions can be achieved. The NSGA-II algorithm achieved reductions of at least 9.84%, 82.44%, and 13.78% for CO, HC, and NOx, respectively. With a MOPSO algorithm the reached reductions were at least 13.68%, 83.80%, and 7.67% for CO, HC, and NOx, respectively.展开更多
文摘This study evaluates the undrained uplift capacity of open-caisson anchors embedded in anisotropic clay using Finite Element Limit Analysis(FELA)and a hybrid machine learning framework.The FELA simulations inves-tigate the influence of the radius ratio(R/B),anisotropic ratio(re),interface roughness factor(α),and inclination angle(β).Specifically,the results reveal that increasingβsignificantly enhances Nc,especially as soil behavior approaches isotropy.Higherαimproves resistance at steeper inclinations by mobilizing greater interface shear.Nc increases with re,reflecting enhanced strength under isotropic conditions.To enhance predictive accuracy and generalization,a hybrid machine learning model was developed by integrating Extreme Gradient Boosting(XGBoost)with Genetic Algorithm(GA)and Mutation-Based Genetic Algorithm(MGA)for hyperparameter tuning.Among the models,MGA-XGBoost outperformed GA-XGBoost,achieving higher predictive accuracy(R^(2)=0.996 training,0.993 testing).Furthermore,SHAP analysis consistently identified anisotropic ratio(re)as the most influential factor in predicting uplift capacity,followed by interface roughness factor(α),inclination angle(β),and radius ratio(R/B).The proposed framework serves as a scalable decision-support tool adaptable to various soil types and foundation geometries,offering a more efficient and data-driven approach to uplift-resistant design in anisotropic cohesive soils.
基金funded by King Fahd University of Petroleum&Minerals,Saudi Arabia under IRC-SES grant#INRE 2217.
文摘Wind energy has emerged as a potential replacement for fossil fuel-based energy sources.To harness maximum wind energy,a crucial decision in the development of an efficient wind farm is the optimal layout design.This layout defines the specific locations of the turbines within the wind farm.The process of finding the optimal locations of turbines,in the presence of various technical and technological constraints,makes the wind farm layout design problem a complex optimization problem.This problem has traditionally been solved with nature-inspired algorithms with promising results.The performance and convergence of nature-inspired algorithms depend on several parameters,among which the algorithm termination criterion plays a crucial role.Timely convergence is an important aspect of efficient algorithm design because an inefficient algorithm results in wasted computational resources,unwarranted electricity consumption,and hardware stress.This study provides an in-depth analysis of several termination criteria while using the genetic algorithm as a test bench,with its application to the wind farm layout design problem while considering various wind scenarios.The performance of six termination criteria is empirically evaluated with respect to the quality of solutions produced and the execution time involved.Due to the conflicting nature of these two attributes,fuzzy logic-based multi-attribute decision-making is employed in the decision process.Results for the fuzzy decision approach indicate that among the various criteria tested,the criterion Phi achieves an improvement in the range of 2.44%to 32.93%for wind scenario 1.For scenario 2,Best-worst termination criterion performed well compared to the other criteria evaluated,with an improvement in the range of 1.2%to 9.64%.For scenario 3,Hitting bound was the best performer with an improvement of 1.16%to 20.93%.
基金supported by AIT Laboratory,FPT University,Danang Campus,Vietnam,2024.
文摘Natural Language Processing(NLP)has become essential in text classification,sentiment analysis,machine translation,and speech recognition applications.As these tasks become complex,traditionalmachine learning and deep learning models encounter challenges with optimization,parameter tuning,and handling large-scale,highdimensional data.Bio-inspired algorithms,which mimic natural processes,offer robust optimization capabilities that can enhance NLP performance by improving feature selection,optimizing model parameters,and integrating adaptive learning mechanisms.This review explores the state-of-the-art applications of bio-inspired algorithms—such as Genetic Algorithms(GA),Particle Swarm Optimization(PSO),and Ant Colony Optimization(ACO)—across core NLP tasks.We analyze their comparative advantages,discuss their integration with neural network models,and address computational and scalability limitations.Through a synthesis of existing research,this paper highlights the unique strengths and current challenges of bio-inspired approaches in NLP,offering insights into hybrid models and lightweight,resource-efficient adaptations for real-time processing.Finally,we outline future research directions that emphasize the development of scalable,effective bio-inspired methods adaptable to evolving data environments.
基金supported by the National Natural Science Foundation of China(Grant Nos.42225702 and 42077235)the Natural Science Foundation of Jiangsu Province(Grant No.BK20211086)the open fund of the Key Laboratory of Earth Fissures Geological Disaster,Ministry of Natural Resources.
文摘The distribution of shear-wave velocities in the subsurface is generally used to assess the potential forseismic liquefaction and soil amplification effects and to classify seismic sites. Newly developeddistributed acoustic sensing (DAS) technology enables estimation of the shear-wave distribution as ahigh-density seismic observation system. This technology is characterized by low maintenance costs,high-resolution outputs, and real-time data transmission capabilities, albeit with the challenge ofmanaging massive data generation. Rapid and efficient interpretation of data is the key to advancingapplication of the DAS technology. In this study, field tests were carried out to record ambient noise overa short period using DAS technology, from which the surface-wave dispersion curves were extracted. Inorder to reduce the influence of directional effects on the results, an unsupervised clustering method isused to select appropriate clusters to extract the Green's function. A combination of a genetic algorithmand Monte Carlo (GA-MC) simulation is proposed to invert the subsurface velocity structure. Thestratigraphic profiles obtained by the GA-MC method are in agreement with the borehole profiles.Compared to other methods, the proposed optimization method not only improves the solution qualitybut also reduces the solution time.
基金This paper is supported by the Nature Science Foundation of Heilongjiang Province.
文摘This paper introduced the Genetic Algorithms (GAs) and Artificial Neural Networks (ANNs), which have been widely used in optimization of allocating. The combination way of the two optimizing algorithms was used in board allocating of furniture production. In the experiment, the rectangular flake board of 3650 mm 1850 mm was used as raw material to allocate 100 sets of Table Bucked. The utilizing rate of the board reached 94.14 % and the calculating time was only 35 s. The experiment result proofed that the method by using the GA for optimizing the weights of the ANN can raise the utilizing rate of the board and can shorten the time of the design. At the same time, this method can simultaneously searched in many directions, thus greatly in-creasing the probability of finding a global optimum.
文摘To establish a parallel fusion approach of processing high dimensional information, the model and criterion of multisensor fuzzy stochastic data fusion were presented. In order to design genetic algorithm fusion, the fusion parameter coding, initial population and fitness function establishing, and fuzzy logic controller designing for genetic operations and probability choosing were completed. The discussion on the highly dimensional fusion was given. For a moving target with the division of 1 64 (velocity) and 1 75 (acceleration), the precision of fusion is 0 94 and 0 98 respectively. The fusion approach can improve the reliability and decision precision effectively.
文摘A compound algorithm of genetic annealing is designed for optimizing the luffing mechanism locus of a plane link by means of random optimal algorithm, genetic and annealing algorithm. The computing experiment shows that the algorithm has much better steady convergence performance of optimal process and can hunt out the global optimal solution by biggish probability for objective function of multi peak value.
文摘Although the genetic algorithm (GA) has very powerful robustness and fitness, it needs a large size of population and a large number of iterations to reach the optimum result. Especially when GA is used in complex structural optimization problems, if the structural reanalysis technique is not adopted, the more the number of finite element analysis (FEA) is, the more the consuming time is. In the conventional structural optimization the number of FEA can be reduced by the structural reanalysis technique based on the approximation techniques and sensitivity analysis. With these techniques, this paper provides a new approximation model-segment approximation model, adopted for the GA application. This segment approximation model can decrease the number of FEA and increase the convergence rate of GA. So it can apparently decrease the computation time of GA. Two examples demonstrate the availability of the new segment approximation model.
文摘An approach to addressing the stereo correspondence problem is presented using genetic algorithms (GAs) to obtain a dense disparity map. Different from previous methods, this approach casts the stereo matching as a multi-extrema optimization problem such that finding the fittest solution from a set of potential disparity maps. Among a wide variety of optimization techniques, GAs are proven to be potentially effective methods for the global optimization problems with large search space. With this idea, each disparity map is viewed as an individual and the disparity values are encoded as chromosomes, so each individual has lots of chromosomes in the approach. Then, several matching constraints are formulated into an objective function, and GAs are used to search the global optimal solution for the problem. Furthermore, the coarse-to-fine strategy has been embedded in the approach so as to reduce the matching ambiguity and the time consumption. Finally, experimental results on synthetic and real images show the performance of the work.
文摘The methods of moment and genetic algorithm (GA) are combined to optimize the Yagi Uda antenna array and Log periodic dipole antenna (LPDA) array. The element lengths and spacing are optimized for the Yagi Uda array; while the ratio factor of spacing to length as well as the ratio of length to diameter of the elements are optimized for LPDA array. The results show that the main parameters, such as gain and pattern, have been improved apparently; and the high back lobe level of LPDA can be reduced greatly, therefore, GA is a very competent method for optimizing the linear array as well as in other fields.
基金the Consortium in Research and Aerospace in Canada (CRIAQ)the Natural Sciences and Engineering Research Council of Canada (NSERC) for their financial support
文摘In this paper, an ‘in-house＇ genetic algorithm is described and applied to an optimization problem for improving the aerodynamic performances of an aircraft wing tip through upper surface morphing. The algorithm＇s performances were studied from the convergence point of view, in accordance with design conditions. The algorithm was compared to two other optimization methods,namely the artificial bee colony and a gradient method, for two optimization objectives, and the results of the optimizations with each of the three methods were plotted on response surfaces obtained with the Monte Carlo method, to show that they were situated in the global optimum region. The optimization results for 16 wind tunnel test cases and 2 objective functions were presented. The 16 cases used for the optimizations were included in the experimental test plan for the morphing wing-tip demonstrator, and the results obtained using the displacements given by the optimizations were evaluated.
基金financial support provided by the RIF project(Grant No.PolyU R5037-18F)from the Research Grants Council(RGC)of Hong Kong is gratefully acknowledged。
文摘Compression index Ccis an essential parameter in geotechnical design for which the effectiveness of correlation is still a challenge.This paper suggests a novel modelling approach using machine learning(ML)technique.The performance of five commonly used machine learning(ML)algorithms,i.e.back-propagation neural network(BPNN),extreme learning machine(ELM),support vector machine(SVM),random forest(RF)and evolutionary polynomial regression(EPR)in predicting Cc is comprehensively investigated.A database with a total number of 311 datasets including three input variables,i.e.initial void ratio e0,liquid limit water content wL,plasticity index Ip,and one output variable Cc is first established.Genetic algorithm(GA)is used to optimize the hyper-parameters in five ML algorithms,and the average prediction error for the 10-fold cross-validation(CV)sets is set as thefitness function in the GA for enhancing the robustness of ML models.The results indicate that ML models outperform empirical prediction formulations with lower prediction error.RF yields the lowest error followed by BPNN,ELM,EPR and SVM.If the ranges of input variables in the database are large enough,BPNN and RF models are recommended to predict Cc.Furthermore,if the distribution of input variables is continuous,RF model is the best one.Otherwise,EPR model is recommended if the ranges of input variables are small.The predicted correlations between input and output variables using five ML models show great agreement with the physical explanation.
基金This project is supported by National Natural Science Foundation of China (No.59975025)
文摘A genetic algorithm (GA)-based method is proposed to solve the nonlinearoptimization problem of minimum zone cylindricity evaluation. First, the background of the problemis introduced. Then the mathematical model and the fitness function are derived from themathematical definition of dimensioning and tolerancing principles. Thirdly with the least squaressolution as the initial values, the whole implementation process of the algorithm is realized inwhich some key techniques, for example, variables representing, population initializing and suchbasic operations as selection, crossover and mutation, are discussed in detail. Finally, examplesare quoted to verify the proposed algorithm. The computation results indicate that the GA-basedoptimization method performs well on cylindricity evaluation. The outstanding advantages concludehigh accuracy, high efficiency and capabilities of solving complicated nonlinear and large spaceproblems.
基金funded by the National Natural Science Foundation of China(Grant No.40830955)
文摘Some variational data assimilation （VDA） problems of time- and space-discrete models with on/off parameterizations can be regarded as non-smooth optimization problems. Same as the sub-gradient type method, intelligent optimization algorithms, which are widely used in engineering optimization, can also be adopted in VDA in virtue of their no requirement of cost function＇s gradient （or sub-gradient） and their capability of global convergence. Two typical intelligent optimization algorithms, genetic algorithm （GA） and particle swarm optimization （PSO）, are introduced to VDA of modified Lorenz equations with on-off parameterizations, then two VDA schemes are proposed, that is, GA based VDA （GA-VDA） and PSO based VDA （PSO-VDA）. After revealing the advantage of GA and PSO over conventional adjoint methods in the ability of global searching at the existence of cost function＇s discontinuity induced by on-off switches, sensitivities of GA-VDA and PSO-VDA to population size, observational noise, model error and observational density are detailedly analyzed. It＇s shown that, in the context of modified Lorenz equations, with proper population size, GA-VDA and PSO-VDA can effectively estimate the global optimal solution, while PSO-VDA consumes much less computational time than GA-VDA with the same population size, and requires a much lower population size with nearly the same results, both methods are not very sensitive to observation noise and model error, while PSO-VDA shows a better performance with observational noise than GA-VDA. It is encouraging that both methods are not sensitive to observational density, especially PSO-VDA, using which almost the same perfect assimilation results can be obtained with comparatively sparse observations.
基金the National Natural Science Foundation of China (No. 50677062)the New Century Excellent Talents in Uni-versity of China (No. NCET-07-0745)the Natural Science Foundation of Zhejiang Province, China (No. R107062)
文摘In this paper, a mathematical model consisting of forward and backward models is built on parallel genetic algorithms (PGAs) for fault diagnosis in a transmission power system. A new method to reduce the scale of fault sections is developed in the forward model and the message passing interface (MPI) approach is chosen to parallel the genetic algorithms by global sin-gle-population master-slave method (GPGAs). The proposed approach is applied to a sample system consisting of 28 sections, 84 protective relays and 40 circuit breakers. Simulation results show that the new model based on GPGAs can achieve very fast computation in online applications of large-scale power systems.
基金This work was supported by UK EPSRC(No.EP/E060722/01)Broil FAPESP(Proc.04/04289-6).
文摘Dynamic optimization problems are a kind of optimization problems that involve changes over time. They pose a serious challenge to traditional optimization methods as well as conventional genetic algorithms since the goal is no longer to search for the optimal solution（s） of a fixed problem but to track the moving optimum over time. Dynamic optimization problems have attracted a growing interest from the genetic algorithm community in recent years. Several approaches have been developed to enhance the performance of genetic algorithms in dynamic environments. One approach is to maintain the diversity of the population via random immigrants. This paper proposes a hybrid immigrants scheme that combines the concepts of elitism, dualism and random immigrants for genetic algorithms to address dynamic optimization problems. In this hybrid scheme, the best individual, i.e., the elite, from the previous generation and its dual individual are retrieved as the bases to create immigrants via traditional mutation scheme. These elitism-based and dualism-based immigrants together with some random immigrants are substituted into the current population, replacing the worst individuals in the population. These three kinds of immigrants aim to address environmental changes of slight, medium and significant degrees respectively and hence efficiently adapt genetic algorithms to dynamic environments that are subject to different severities of changes. Based on a series of systematically constructed dynamic test problems, experiments are carried out to investigate the performance of genetic algorithms with the hybrid immigrants scheme and traditional random immigrants scheme. Experimental results validate the efficiency of the proposed hybrid immigrants scheme for improving the performance of genetic algorithms in dynamic environments.
基金supported by the National Natural Science Foundation of China (No. 61741102, No. 61471164)China Scholarship Council
文摘The problem of joint radio and cloud resources allocation is studied for heterogeneous mobile cloud computing networks. The objective of the proposed joint resource allocation schemes is to maximize the total utility of users as well as satisfy the required quality of service(QoS) such as the end-to-end response latency experienced by each user. We formulate the problem of joint resource allocation as a combinatorial optimization problem. Three evolutionary approaches are considered to solve the problem: genetic algorithm(GA), ant colony optimization with genetic algorithm(ACO-GA), and quantum genetic algorithm(QGA). To decrease the time complexity, we propose a mapping process between the resource allocation matrix and the chromosome of GA, ACO-GA, and QGA, search the available radio and cloud resource pairs based on the resource availability matrixes for ACOGA, and encode the difference value between the allocated resources and the minimum resource requirement for QGA. Extensive simulation results show that our proposed methods greatly outperform the existing algorithms in terms of running time, the accuracy of final results, the total utility, resource utilization and the end-to-end response latency guaranteeing.
文摘In this paper, an underwater vehicle was modeled with six dimensional nonlinear equations of motion, controlled by DC motors in all degrees of freedom. Near-optimal trajectories in an energetic environment for underwater vehicles were computed using a nnmerical solution of a nonlinear optimal control problem （NOCP）. An energy performance index as a cost function, which should be minimized, was defmed. The resulting problem was a two-point boundary value problem （TPBVP）. A genetic algorithm （GA）, particle swarm optimization （PSO）, and ant colony optimization （ACO） algorithms were applied to solve the resulting TPBVP. Applying an Euler-Lagrange equation to the NOCP, a conjugate gradient penalty method was also adopted to solve the TPBVP. The problem of energetic environments, involving some energy sources, was discussed. Some near-optimal paths were found using a GA, PSO, and ACO algorithms. Finally, the problem of collision avoidance in an energetic environment was also taken into account.
文摘The classical job shop scheduling problem(JSP) is the most popular machine scheduling model in practice and is known as NP-hard.The formulation of the JSP is based on the assumption that for each part type or job there is only one process plan that prescribes the sequence of operations and the machine on which each operation has to be performed.However,JSP with alternative machines for various operations is an extension of the classical JSP,which allows an operation to be processed by any machine from a given set of machines.Since this problem requires an additional decision of machine allocation during scheduling,it is much more complex than JSP.We present a domain independent genetic algorithm(GA) approach for the job shop scheduling problem with alternative machines.The GA is implemented in a spreadsheet environment.The performance of the proposed GA is analyzed by comparing with various problem instances taken from the literatures.The result shows that the proposed GA is competitive with the existing approaches.A simplified approach that would be beneficial to both practitioners and researchers is presented for solving scheduling problems with alternative machines.
文摘In this paper, a multi-objective particle swarm optimization （MOPSO） algorithm and a nondominated sorting genetic algorithm II （NSGA-II） are used to optimize the operating parameters of a 1.6 L, spark ignition （SI） gasoline engine. The aim of this optimization is to reduce engine emissions in terms of carbon monoxide （CO）, hydrocarbons （HC）, and nitrogen oxides （NOx）, which are the causes of diverse environmental problems such as air pollution and global warming. Stationary engine tests were performed for data generation, covering 60 operating conditions. Artificial neural networks （ANNs） were used to predict exhaust emissions, whose inputs were from six engine operating parameters, and the outputs were three resulting exhaust emissions. The outputs of ANNs were used to evaluate objective functions within the optimization algorithms： NSGA-II and MOPSO. Then a decision-making process was conducted, using a fuzzy method to select a Pareto solution with which the best emission reductions can be achieved. The NSGA-II algorithm achieved reductions of at least 9.84%, 82.44%, and 13.78% for CO, HC, and NOx, respectively. With a MOPSO algorithm the reached reductions were at least 13.68%, 83.80%, and 7.67% for CO, HC, and NOx, respectively.
