Adaptive genetic algorithm-based design of gamma-graphyne nanoribbon incorporating diamond-shaped segment with high thermoelectric conversion efficiency

The gamma-graphyne nanoribbons(γ-GYNRs) incorporating diamond-shaped segment(DSSs) with excellent thermoelectric properties are systematically investigated by combining nonequilibrium Green’s functions with adaptive genetic algorithm. Our calculations show that the adaptive genetic algorithm is efficient and accurate in the process of identifying structures with excellent thermoelectric performance. In multiple rounds, an average of 476 candidates(only 2.88% of all16512 candidate structures) are calculated to obtain the structures with extremely high thermoelectric conversion efficiency.The room temperature thermoelectric figure of merit(ZT) of the optimal γ-GYNR incorporating DSSs is 1.622, which is about 5.4 times higher than that of pristine γ-GYNR(length 23.693 nm and width 2.660 nm). The significant improvement of thermoelectric performance of the optimal γ-GYNR is mainly attributed to the maximum balance of inhibition of thermal conductance(proactive effect) and reduction of thermal power factor(side effect). Moreover, through exploration of the main variables affecting the genetic algorithm, it is revealed that the efficiency of the genetic algorithm can be improved by optimizing the initial population gene pool, selecting a higher individual retention rate and a lower mutation rate. The results presented in this paper validate the effectiveness of genetic algorithm in accelerating the exploration of γ-GYNRs with high thermoelectric conversion efficiency, and could provide a new development solution for carbon-based thermoelectric materials.

Solar Radiation Estimation Based on a New Combined Approach of Artificial Neural Networks (ANN) and Genetic Algorithms (GA) in South Algeria

When designing solar systems and assessing the effectiveness of their many uses,estimating sun irradiance is a crucial first step.This study examined three approaches(ANN,GA-ANN,and ANFIS)for estimating daily global solar radiation(GSR)in the south of Algeria:Adrar,Ouargla,and Bechar.The proposed hybrid GA-ANN model,based on genetic algorithm-based optimization,was developed to improve the ANN model.The GA-ANN and ANFIS models performed better than the standalone ANN-based model,with GA-ANN being better suited for forecasting in all sites,and it performed the best with the best values in the testing phase of Coefficient of Determination(R=0.9005),Mean Absolute Percentage Error(MAPE=8.40%),and Relative Root Mean Square Error(rRMSE=12.56%).Nevertheless,the ANFIS model outperformed the GA-ANN model in forecasting daily GSR,with the best values of indicators when testing the model being R=0.9374,MAPE=7.78%,and rRMSE=10.54%.Generally,we may conclude that the initial ANN stand-alone model performance when forecasting solar radiation has been improved,and the results obtained after injecting the genetic algorithm into the ANN to optimize its weights were satisfactory.The model can be used to forecast daily GSR in dry climates and other climates and may also be helpful in selecting solar energy system installations and sizes.

Adaptive genetic algorithm with the criterion of premature convergence

To counter the defect of traditional genetic algorithms, an improved adaptivegenetic algorithm with the criterion of premature convergence is provided. The occurrence ofpremature convergence is forecasted using colony entropy and colony variance. When prematureconvergence occurs, new individuals are generated in proper scale randomly based on superiorindividuals in the colony. We use these new individuals to replace some individuals in the oldcolony. The updated individuals account for 30 percent - 40 percent of all individuals and the sizeof scale is related to the distribution of the extreme value of the target function. Simulationtests show that there is much improvement in the speed of convergence and the probability of globalconvergence.

ADAPTIVE GENETIC ALGORITHM BASED ON SIX FUZZY LOGIC CONTROLLERS

The performance of genetic algorithm(GA) is determined by the capability of search and optimization for satisfactory solutions. The new adaptive genetic algorithm(AGA) is built for inducing suitable search and optimization relationship. The use of six fuzzy logic controllers(6FLCs) is proposed for dynamic control genetic operating parameters of a symbolic-coded GA. This paper uses AGA based on 6FLCs to deal with the travelling salesman problem (TSP). Experimental results show that AGA based on 6FLCs is more efficient than a standard GA in solving combinatorial optimization problems similar to TSP.

A Linear Domain System Identification for Small Unmanned Aerial Rotorcraft Based on Adaptive Genetic Algorithm

This paper proposes a new adaptive linear domain system identification method for small unmanned aerial rotorcraft.Byusing the flash memory integrated into the micro guide navigation control module, system records the data sequences of flighttests as inputs (control signals for servos) and outputs (aircraft’s attitude and velocity information).After data preprocessing, thesystem constructs the horizontal and vertical dynamic model for the small unmanned aerial rotorcraft using adaptive geneticalgorithm.The identified model is verified by a series of simulations and tests.Comparison between flight data and the one-stepprediction data obtained from the identification model shows that the dynamic model has a good estimation for real unmannedaerial rotorcraft system.Based on the proposed dynamic model, the small unmanned aerial rotorcraft can perform hovering,turning, and straight flight tasks in real flight tests.

Optimization of linear induction machines based on a novel adaptive genetic algorithm

In order to improve the thrust-power ratio index of the linear induction motor（LIM）, a novel adaptive genetic algorithm （NAGA） is proposed for the design optimization of the LIM. A good-point set theory that helps to produce a uniform initial population is used to enhance the optimization efficiency of the genetic algorithm. The crossover and mutation probabilities are improved by using the function of sigmoid and they can be adjusted nonlinearly between average fitness and maximal fitness with individual fitness. Based on the analyses of different structures between the LIM and the rotary induction motor （RIM） and referring to the analysis method of the RIM, the steady-state characteristics of the LIM that considers the end effects of the LIM is calculated and the optimal design model of the thrust-power ratio index is also presented. Through the comparison between the optimal scheme and the old scheme, the thrust-power ratio index of the LIM is obviously increased and the validity of the NAGA is proved.

An adaptive genetic algorithm with diversity-guided mutation and its global convergence property

An adaptive genetic algorithm with diversity-guided mutation, which combines adaptive probabilities of crossover and mutation was proposed. By means of homogeneous finite Markov chains, it is proved that adaptive genetic algorithm with diversity-guided mutation and genetic algorithm with diversity-guided mutation converge to the global optimum if they maintain the best solutions, and the convergence of adaptive genetic algorithms with adaptive probabilities of crossover and mutation was studied. The performances of the above algorithms in optimizing several unimodal and multimodal functions were compared. The results show that for multimodal functions the average convergence generation of the adaptive genetic algorithm with diversity-guided mutation is about 900 less than that of (adaptive) genetic algorithm with adaptive probabilities and genetic algorithm with diversity-guided mutation, and the adaptive genetic algorithm with diversity-guided mutation does not lead to premature convergence. It is also shown that the better balance between overcoming premature convergence and quickening convergence speed can be gotten.

Fuzzy adaptive genetic algorithm based on auto-regulating fuzzy rules

There are defects such as the low convergence rate and premature phenomenon on the performance of simple genetic algorithms （SGA） as the values of crossover probability （Pc） and mutation probability （Pro） are fixed. To solve the problems, the fuzzy control method and the genetic algorithms were systematically integrated to create a kind of improved fuzzy adaptive genetic algorithm （FAGA） based on the auto-regulating fuzzy rules （ARFR-FAGA）. By using the fuzzy control method, the values of Pc and Pm were adjusted according to the evolutional process, and the fuzzy rules were optimized by another genetic algorithm. Experimental results in solving the function optimization problems demonstrate that the convergence rate and solution quality of ARFR-FAGA exceed those of SGA, AGA and fuzzy adaptive genetic algorithm based on expertise （EFAGA） obviously in the global search.

Alternative Fuzzy Cluster Segmentation of Remote Sensing Images Based on Adaptive Genetic Algorithm

Remote sensing image segmentation is the basis of image understanding and analysis. However,the precision and the speed of segmentation can not meet the need of image analysis,due to strong uncertainty and rich texture details of remote sensing images. We proposed a new segmentation method based on Adaptive Genetic Algorithm(AGA) and Alternative Fuzzy C-Means(AFCM) . Segmentation thresholds were identified by AGA. Then the image was segmented by AFCM. The results indicate that the precision and the speed of segmentation have been greatly increased,and the accuracy of threshold selection is much higher compared with traditional Otsu and Fuzzy C-Means(FCM) segmentation methods. The segmentation results also show that multi-thresholds segmentation has been achieved by combining AGA with AFCM.

Sparse Planar Retrodirective Antenna Array Using Improved Adaptive Genetic Algorithm

An improved adaptive genetic algorithm is presented in this paper. It primarily includes two modified methods： one is novel adaptive probabilities of crossover and mutation, the other is truncated selection approach. This algorithm has been validated to be superior to the simple genetic algorithm （SGA） by a complicated binary testing function. Then the proposed algorithm is applied to optimizing the planar retrodirective array to reduce the cost of the hardware. The fitness function is discussed in the optimization example. After optimization, the sparse planar retrodirective antenna array keeps excellent retrodirectivity, while the array architecture has been simplified by 34%. The optimized antenna array can replace uniform full array effectively. Results show that this work will gain more engineering benefits in practice.

An adaptive reanalysis method for genetic algorithm with application to fast truss optimization

Although the genetic algorithm （GA） for structural optimization is very robust, it is very computationally intensive and hence slower than optimality criteria and mathematical programming methods. To speed up the design process, the authors present an adaptive reanalysis method for GA and its applications in the optimal design of trusses. This reanalysis technique is primarily derived from the Kirsch＇s combined approximations method. An iteration scheme is adopted to adaptively determine the number of basis vectors at every generation. In order to illustrate this method, three classical examples of optimal truss design are used to validate the proposed reanalysis-based design procedure. The presented numerical results demonstrate that the adaptive reanalysis technique affects very slightly the accuracy of the optimal solutions and does accelerate the design process, especially for large-scale structures.

Estimation of Kinetic Parameters for Autocatalytic Oxidation of Cyclohexane Based on a Modified Adaptive Genetic Algorithm

A modified genetic algorithm of multiple selection strategies, crossover strategies and adaptive operator is constructed, and it is used to estimate the kinetic parameters in autocatalytic oxidation of cyclohexane. The influences of selection strategy, crossover strategy and mutation strategy on algorithm performance are discussed. This algorithm with a specially designed adaptive operator avoids the problem of local optimum usually associated with using standard genetic algorithm and simplex method. The kinetic parameters obtained from the modified genetic algorithm are credible and the calculation results using these parameters agree well with experimental data. Furthermore, a new kinetic model of cyclohexane autocatalytic oxidation is established and the kinetic parameters are estimated by using the modified genetic algorithm.

An improved self-calibration approach based on adaptive genetic algorithm for position-based visual servo

An improved self-calibrating algorithm for visual servo based on adaptive genetic algorithm is proposed in this paper. Our approach introduces an extension of Mendonca-Cipolla and G. Chesi＇s self-calibration for the positionbased visual servo technique which exploits the singular value property of the essential matrix. Specifically, a suitable dynamic online cost function is generated according to the property of the three singular values. The visual servo process is carried out simultaneous to the dynamic self-calibration, and then the cost function is minimized using the adaptive genetic algorithm instead of the gradient descent method in G. Chesi＇s approach. Moreover, this method overcomes the limitation that the initial parameters must be selected close to the true value, which is not constant in many cases. It is not necessary to know exactly the camera intrinsic parameters when using our approach, instead, coarse coding bounds of the five parameters are enough for the algorithm, which can be done once and for all off-line. Besides, this algorithm does not require knowledge of the 3D model of the object. Simulation experiments are carried out and the results demonstrate that the proposed approach provides a fast convergence speed and robustness against unpredictable perturbations of camera parameters, and it is an effective and efficient visual servo algorithm.

Adaptive template filter method for image processing based on immune genetic algorithm

To preserve the original signal as much as possible and filter random noises as many as possible in image processing,a threshold optimization-based adaptive template filtering algorithm was proposed.Unlike conventional filters whose template shapes and coefficients were fixed,multi-templates were defined and the right template for each pixel could be matched adaptively based on local image characteristics in the proposed method.The superiority of this method was verified by former results concerning the matching experiment of actual image with the comparison of conventional filtering methods.The adaptive search ability of immune genetic algorithm with the elitist selection and elitist crossover(IGAE) was used to optimize threshold t of the transformation function,and then combined with wavelet transformation to estimate noise variance.Multi-experiments were performed to test the validity of IGAE.The results show that the filtered result of t obtained by IGAE is superior to that of t obtained by other methods,IGAE has a faster convergence speed and a higher computational efficiency compared with the canonical genetic algorithm with the elitism and the immune algorithm with the information entropy and elitism by multi-experiments.

Adaptive genetic algorithm for path planning of loosely coordinated multi-robot manipulators

Adaptive genetic algorithm A SA GA, a novel algorithm, which can dynamically modify the parameters of Genetic Algorithms in terms of simulated annealing mechanism, is proposed for path planning of loosely coordinated multi robot manipulators. Over the task space of a multi robot, a strategy of decoupled planning is also applied to the evolutionary process, which enables a multi robot to avoid falling into deadlock and calculating of composite C space. Finally, two representative tests are given to validate A SA GA and the strategy of decoupled planning.

Composition of Web Services of Multi-Population Adaptive Genetic Algorithm Based on Cosine Improvement

Web quality of service (QoS) awareness requires not only the selection of specific services to complete specific tasks, but also the comprehensive quality of service of the whole web service composition. How to select the web service composition with the highest comprehensive QoS is a NP hard problem. In this paper, an improved multi population genetic algorithm is proposed. Cosine adaptive operator is added to the algorithm to avoid premature algorithm caused by improper genetic operator and the disadvantage of destroying excellent individuals in later period. Experimental results show that compared with the common genetic algorithm and multi population genetic algorithm, this algorithm has the advantages of shorter time consumption and higher accuracy, and effectively avoids the loss of effective genes in the population.

Self-adaptive PID controller of microwave drying rotary device tuning on-line by genetic algorithms

The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and with multivariable nonlinear interaction of microwave and materials. The conventional PID control strategy incorporated with optimization GA was put forward to maintain the optimum drying temperature in order to keep the moisture content below 1%, whose adaptation ability included the cost function of optimization GA according to the output change. Simulations on five different industrial process models and practical temperature process control system for selenium-enriched slag drying intensively by using IMDRDWM were carried out systematically, indicating the reliability and effectiveness of control design. The parameters of proposed control design are all on-line implemented without iterative predictive calculations, and the closed-loop system stability is guaranteed, which makes the developed scheme simpler in its synthesis and application, providing the practical guidelines for the control implementation and the parameter design.

A New Fuzzy Adaptive Genetic Algorithm

Multiple genetic algorithms (GAs) need a large population size, which will take a long time for evolution. A new fuzzy adaptive GA is proposed in this paper. This algorithm is more effective in global search while keeping the overall population size constant. The simulation results of function optimization show that with the proposed algorithm, the phenomenon of premature convergence can be overcome effectively, and a satisfying optimization result is obtained.

Optimal Time-Frequency Atom Search Based on Adaptive Genetic Algorithm

Adaptive signal decomposition is an important signal processing method.The chirp-based signal representation,for example,the Gaussian chirplet decomposition,has been an active research topic in the field of signal processing.A main challenge of the Gaussian chirplet decomposition is the numerical implementation of the matching pursuit,which is an adaptive signal decomposition scheme,and the challenge remains an open research topic.In this paper,a new optimal time-frequency atom search method based on the adaptive genetic algorithm is proposed,aiming to the low precision problem of the traditional methods.Firstly,a discrete formula of finite length time-frequency atom sequence is derived.Secondly,an algorithm based on the adaptive genetic algorithm is described in detail.Finally,a simulation is carried out,and the result displays its validity and stability.