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.

基于小波变换与IAGA-BP神经网络的短期风电功率预测

为提高风功率预测精度,减轻输出风能波动性对风电并网不利影响,提出了基于WT-IAGA-BP神经网络的短期风电功率预测方法。利用风速分区、3σ准则及拉格朗日插值法清洗风电场历史数据;其次,依据小波重构误差,选择db4小波分别提取风速、风向、历史风功率的不同频率特征信号,并引入改进自适应遗传算法(IAGA)对各序列BP神经网络的初始权值与阈值寻优,使用Sigmiod函数通过适应度值自适应改变交叉概率与变异概率;构建各序列的WT-IAGA-BP模型对短期风功率组合预测。通过仿真分析,并与ELM、IAGA-BP、WT-ELM及WT-LSSVM方法对比,验证该方法具有更高的预测精度和更好的预测性能。

基于IAGA的多行设施布局优化方法

针对横向和纵向通道位置和数量均不确定的多行设施布局问题,提出一种基于IAGA的多行设施布局优化方法。考虑设施最大纵横比约束,建立以物流成本、搬运设备空载成本及占地面积成本的加权平均值最小化为优化目标的布局优化模型;设计基于柔性隔间结构编码的改进自适应遗传算法(IAGA)对模型进行求解。算法中设计了自适应调整交叉概率、自适应选择交叉算子(双点交叉算子和单亲单点交换算子)及分别针对隔间结构和设施编号排列的基本位变异算子,提高了其收敛速度和搜索能力。最后,通过案例分析验证了IAGA算法的有效性。

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.

基于NAGA的物流企业自有及外包运力配置鲁棒优化

为深入优化物流企业的自有及外包运力配置,综合考虑运输需求不确定性和运输车型异质性,以全年运输利润最大化为目标,构建了多车型参与下运力配置鲁棒优化模型.依据决策变量的层次特性,设计了一种内外双层结构的嵌套式自适应遗传算法(NAGA).依托上海某物流企业的实际数据,进行了需求确定及不确定情形下的实例分析.结果表明,所构建的鲁棒优化模型兼顾经济性与鲁棒性,NAGA能对该模型进行高效求解.在需求确定情形下,优化后的运输利润提高了6.2%,且NAGA在求解质量及稳定性方面表现优于典型嵌套式启发算法;在需求不确定情形下,采用所提出的运力配置方法,决策者可根据市场波动水平及风险偏好调整鲁棒优化模型参数取值,以灵活获取合适的自有及外包运力配置方案.

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.

基于AGA-RBF神经网络模型的叶绿素a质量浓度预测研究

叶绿素a质量浓度是预测湖泊水华形成的重要影响因子,但常用的径向基(radial basis function,RBF)神经网络存在容易陷入局部极值,导致预测精度欠佳.针对这一问题,采用自适应遗传算法(adaptive genetic algorithm,AGA)对RBF神经网络进行优化,构建基于AGA-RBF神经网络预测模型,以莆田东圳水库为应用案例,对叶绿素a质量浓度进行预测,通过采集到的数据对预测模型进行仿真,对比均方根误差(RMSE)、相对误差(RE)以及平均相对误差(MRE),验证改进后的AGA-RBF模型具有更好的预测精度,以期对叶绿素a质量浓度进行长期预测.

GCAGA: A Gini Coefficient-Based Optimization Strategy for Computation Offloading in Multi-User-Multi-Edge MEC System

To support the explosive growth of Information and Communications Technology(ICT),Mobile Edge Comput-ing(MEC)provides users with low latency and high bandwidth service by offloading computational tasks to the network’s edge.However,resource-constrained mobile devices still suffer from a capacity mismatch when faced with latency-sensitive and compute-intensive emerging applications.To address the difficulty of running computationally intensive applications on resource-constrained clients,a model of the computation offloading problem in a network consisting of multiple mobile users and edge cloud servers is studied in this paper.Then a user benefit function EoU(Experience of Users)is proposed jointly considering energy consumption and time delay.The EoU maximization problem is decomposed into two steps,i.e.,resource allocation and offloading decision.The offloading decision is usually given by heuristic algorithms which are often faced with the challenge of slow convergence and poor stability.Thus,a combined offloading algorithm,i.e.,a Gini coefficient-based adaptive genetic algorithm(GCAGA),is proposed to alleviate the dilemma.The proposed algorithm optimizes the offloading decision by maximizing EoU and accelerates the convergence with the Gini coefficient.The simulation compares the proposed algorithm with the genetic algorithm(GA)and adaptive genetic algorithm(AGA).Experiment results show that the Gini coefficient and the adaptive heuristic operators can accelerate the convergence speed,and the proposed algorithm performs better in terms of convergence while obtaining higher EoU.The simulation code of the proposed algorithm is available:https://github.com/Grox888/Mobile_Edge_Computing/tree/GCAGA.

Generalized Self-Adaptive Genetic Algorithms

In order to solve the problem between searching performance and convergence of genetic algorithms, a fast genetic algorithm generalized self-adaptive genetic algorithm (GSAGA) is presented. (1) Evenly distributed initial population is generated. (2) Superior individuals are not broken because of crossover and mutation operation for they are sent to subgeneration directly. (3) High quality im- migrants are introduced according to the condition of the population schema. (4) Crossover and mutation are operated on self-adaptation. Therefore, GSAGA solves the coordination problem between convergence and searching performance. In GSAGA, the searching per- formance and global convergence are greatly improved compared with many existing genetic algorithms. Through simulation, the val- idity of this modified genetic algorithm is proved.

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.

基于BAS-AGA的多层级多类型的设施选址-分配问题

针对物流网络的复杂度不断提高,物流网络中的设施选址存在诸多不确定因素的问题,建立考虑多种类型的产品、同一层级有多种类型的设施、同一类型设施可以处理多种类型产品的N层级的选址-分配模型,并考虑4种不确定场景,设计改进的天牛须-遗传混合算法(beetle antennae search and adaptive genetic algorithm,BAS-AGA)进行求解。改进的算法以遗传算法为基本框架,混合天牛须算法增强局部搜索能力、引入自适应算子平衡局部搜索能力与全局搜索能力,算例测试验证了BAS-AGA算法的有效性。铁路工程某标段的实例验证了模型的合理性。结果表明:通过适当增加设施数量及科学选择设施位置可以降低物流成本,从而降低总成本。

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.

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.