A Novel Genetic Algorithm Preventing Premature Convergence by Chaos Operator

An improved genetic algorithm (GA) is proposed based on the analysis of population diversity within the framework of Markov chain. The chaos operator to combat premature convergence concerning two goals of maintaining diversity in the population and sustaining the convergence capacity of the GA is introduced. In the CHaos Genetic Algorithm (CHGA), the population is recycled dynamically whereas the most highly fit chromosome is intact so as to restore diversity and reserve the best schemata which may belong to the optimal solution. The characters of chaos as well as advanced operators and parameter settings can improve both exploration and exploitation capacities of the algorithm. The results of multimodal function optimization show that CHGA performs simple genetic algorithms and effectively alleviates the problem of premature convergence.

Application of Chaos in Genetic Algorithms

Through replacing Gaussian mutation operator in real-coded genetic algorithm with a chaotic mapping, wepresent a genetic algorithm with chaotic mutation. To examine this new algorithm, we applied our algorithm to functionoptimization problems and obtained good results. Furthermore the orbital points' distribution of chaotic mapping andthe effects of chaotic mutation with different parameters were studied in order to make the chaotic mutation mechanismbe utilized efficiently.

A novel adaptive mutative scale optimization algorithm based on chaos genetic method and its optimization efficiency evaluation

By combing the properties of chaos optimization method and genetic algorithm,an adaptive mutative scale chaos genetic algorithm(AMSCGA) was proposed by using one-dimensional iterative chaotic self-map with infinite collapses within the finite region of [-1,1].Some measures in the optimization algorithm,such as adjusting the searching space of optimized variables continuously by using adaptive mutative scale method and making the most circle time as its control guideline,were taken to ensure its speediness and veracity in seeking the optimization process.The calculation examples about three testing functions reveal that AMSCGA has both high searching speed and high precision.Furthermore,the average truncated generations,the distribution entropy of truncated generations and the ratio of average inertia generations were used to evaluate the optimization efficiency of AMSCGA quantificationally.It is shown that the optimization efficiency of AMSCGA is higher than that of genetic algorithm.

A hybrid genetic algorithm based on mutative scale chaos optimization strategy

In order to avoid such problems as low convergent speed and local optimalsolution in simple genetic algorithms, a new hybrid genetic algorithm is proposed. In thisalgorithm, a mutative scale chaos optimization strategy is operated on the population after agenetic operation. And according to the searching process, the searching space of the optimalvariables is gradually diminished and the regulating coefficient of the secondary searching processis gradually changed which will lead to the quick evolution of the population. The algorithm hassuch advantages as fast search, precise results and convenient using etc. The simulation resultsshow that the performance of the method is better than that of simple genetic algorithms.

Optimization of HMM Parameters Based on Chaos and Genetic Algorithm for Hand Gesture Recognition

In order to prevent standard genetic algorithm (SGA) from being premature, chaos is introduced into GA, thus forming chaotic anneal genetic algorithm (CAGA). Chaos ergodicity is used to initialize the population, and chaotic anneal mutation operator is used as the substitute for the mutation operator in SGA. CAGA is a unified framework of the existing chaotic mutation methods. To validate the proposed algorithm, three algorithms, i. e. Baum-Welch, SGA and CAGA, are compared on training hidden Markov model (HMM) to recognize the hand gestures. Experiments on twenty-six alphabetical gestures show the CAGA validity.

Worst-case tolerance analysis on array antenna based on chaos-genetic algorithm

This paper studies the effect of amplitude-phase errors on the antenna performance. Via builting on a worst-case error tolerance model, a simple and practical worst error tolerance analysis based on the chaos-genetic algorithm （CGA） is proposed. The proposed method utilizes chaos to optimize initial population for the genetic algorithm （GA） and introduces chaotic disturbance into the genetic mutation, thereby improving the ability of the GA to search for the global optimum. Numerical simulations demonstrate that the accuracy and stability of the worst-case analysis of the proposed approach are superior to the GA. And the proposed algorithm can be used easily for the error tolerant design of antenna arrays.

A chaos genetic algorithm for optimizing an artificial neural network of predicting silicon content in hot metal

A genetic algorithm based on the nested intervals chaos search (NICGA) hasbeen given. Because the nested intervals chaos search is introduced into the NICGA to initialize thepopulation and to lead the evolution of the population, the NICGA has the advantages of decreasingthe population size, enhancing the local search ability, and improving the computational efficiencyand optimization precision. In a multi4ayer feed forward neural network model for predicting thesilicon content in hot metal, the NICGA was used to optimize the connection weights and thresholdvalues of the neural network to improve the prediction precision. The application results show thatthe precision of predicting the silicon content has been increased.

A combination algorithm of Chaos optimization and genetic algorithm and its application in maneuvering multiple targets data association

The most important problem in targets tracking is data association which may be represented as a sort of constraint combinational optimization problem. Chaos optimization and adaptive genetic algorithm were used to deal with the problem of multi-targets data association separately. Based on the analysis of the limitation of chaos optimization and genetic algorithm, a new chaos genetic optimization combination algorithm was presented. This new algorithm first applied the "rough" search of chaos optimization to initialize the population of GA, then optimized the population by real-coded adaptive GA. In this way, GA can not only jump out of the "trap" of local optimal results easily but also increase the rate of convergence. And the new method can also avoid the complexity and time-consumed limitation of conventional way. The simulation results show that the combination algorithm can obtain higher correct association percent and the effect of association is obviously superior to chaos optimization or genetic algorithm separately. This method has better convergence property as well as time property than the conventional ones.

New Iris Localization Method Based on Chaos Genetic Algorithm

This paper present a new method based on Chaos Genetic Algorithm (CGA) to localize the human iris in a given image. First, the iris image is preprocessed to estimate the range of the iris localization, and then CGA is used to extract the boundary of the ~iris . Simulation results show that the proposed algorithms is efficient and robust, and can achieve sub pixel precision. Because Genetic Algorithms (GAs) can search in a large space, the algorithm does not need accurate estimation of iris center for subsequent localization, and hence can lower the requirement for original iris image processing. On this point, the present localization algirithm is superior to Daugman's algorithm.

Chaotic migration-based pseudo parallel genetic algorithm and its application in inventory optimization

Considering premature convergence in the searching process of genetic algorithm, a chaotic migration-based pseudo parallel genetic algorithm (CMPPGA) is proposed, which applies the idea of isolated evolution and information exchanging in distributed Parallel Genetic Algorithm by serial program structure to solve optimization problem of low real-time demand. In this algorithm, asynchronic migration of individuals during parallel evolution is guided by a chaotic migration sequence. Information exchanging among sub-populations is ensured to be efficient and sufficient due to that the sequence is ergodic and stochastic. Simulation study of CMPPGA shows its strong global search ability, superiority to standard genetic algorithm and high immunity against premature convergence. According to the practice of raw material supply, an inventory programming model is set up and solved by CMPPGA with satisfactory results returned.

OPTIMIZATION BASED ON LMPROVED REAL—CODED GENETIC ALGORITHM

An improved real-coded genetic algorithm is pro-posed for global optimization of functionsl.The new algo-rithm is based om the judgement of the searching perfor-mance of basic real-coded genetic algorithm.The opera-tions of basic real-coded genetic algorithm are briefly dis-cussed and selected.A kind of chaos sequence is described in detail and added in the new algorithm ad a disturbance factor.The strategy of field partition is also used to im-prove the strcture of the new algorithm.Numerical ex-periment shows that the mew genetic algorithm can find the global optimum of complex funtions with satistaiting precision.

GENERATION OF STRANGE ATTRACTOR IMAGES WITH GENETIC ALGORITHM

This paper presents a method for the generation of satisfied strange attractor images, which is based on the idea of Genetic Algorithm and is realized by adding a controller to a chaotic system.The principle of the method is introduced. Some problems which exist in genetic algorithm’s parameter optimization are discussed in detail. Finally, the effectiveness of the method for finding pretty strange attractors is verified. It is helpful to pattern design and works of arts and crafts.

基于CGA-BP神经网络的好氧堆肥曝气供氧量预测模型

为提高好氧堆肥曝气供氧量的曝气效率以及预测精度,该研究利用遗传算法(genetic algorithm,GA)对标准反向传播(back propagation,BP)神经网络的初始权值和阈值进行优化,再利用克隆选择算法(clonal genetic algorithm,CGA)优化遗传算法中的变异算子并复制算子,加快获取最优参数的速度,构建基于CGA-BP神经网络的曝气供氧量预测模型。为验证CGA-BP模型的有效性,与BP模型、GA-BP模型预测结果进行对比。试验结果表明:克隆遗传算法优化BP神经网络能加快获得最优解,效率相比BP模型和GA-BP模型分别提高了75.36%、51.30%;在曝气供氧量预测模型中,CGA-BP模型具有更准确的预测效果,预测精度为99.65%,而BP模型与GA-BP模型预测精度分别为96.99%、99.26%;CGA-BP模型评价指标的均方误差、平均绝对误差、平均绝对百分误差分别为0.0034、0.0389和0.3506,均小于BP神经网络和GA-BP神经网络模型评价指标的误差;利用CGA-BP好氧堆肥曝气供氧量预测模型对好氧堆肥发酵过程进行精准曝气,提高了3.22%的曝气控制效率。由此可知CGA-BP神经网络模型有更好的预测效果,可满足好氧堆肥在发酵过程中曝气供氧量的需求,提高曝气效率,为精准控制曝气提供更直接有效的方法。

基于Chaos-EEMD-PFBD分解和GA-BP神经网络的光伏发电功率超短期预测法

为进一步提高光伏发电功率超短期预测的准确度,提出一种基于混沌理论(Chaos)-集合经验模态分解(ensemble empirical mode decomposition,EEMD)-峰值频段划分(peak frequency band division,PFBD)和GA-BP神经网络的光伏发电功率组合预测法。首先,在光伏发电功率序列相空间重构的基础上,采用EEMD和PFBD对隐含混沌特征进行优化提取,以深度挖掘数据隐含波动信息,提取平稳性好、可预测性强的聚合分量;然后,利用GA优化BP神经网络(BPNN)的初始权值与阈值,构建GA-BP神经网络预测模型,进行光伏发电功率单步和三步预测;最后基于实测功率数据进行有效性验证。仿真结果表明:所提预测法通过数据分解重构和GA优化可实现预测准确度的提高,显示出良好预测性能。

A novel chaotic optimization algorithm and its applications

This paper presents a chaos-genetic algorithm (CGA) that combines chaos and genetic algorithms. It can be used to avoid trapping in local optima profiting from chaos'randomness,ergodicity and regularity. Its property of global asymptotical convergence has been proved with Markov chains in this paper. CGA was applied to the optimization of complex benchmark functions and artificial neural network's (ANN) training. In solving the complex benchmark functions,CGA needs less iterative number than GA and other chaotic optimization algorithms and always finds the optima of these functions. In training ANN,CGA uses less iterative number and shows strong generalization. It is proved that CGA is an efficient and convenient chaotic optimization algorithm.

面向准时化生产的船体分段排产分析

针对国内某典型船厂存在的智能化程度低、作业方案可控性差和库存成本高等问题,以减少船体分段的库存时间、满足分段的开工时间限制和保证胎位负荷均衡为目标建立数学模型,并引入遗传算法解决此类NP-Hard问题。在算法运行过程中采用混沌映射、精英保留策略和自适应交叉变异算子增强算法的全局寻优性和收敛性。对某船厂的实际生产数据进行计算和对比分析,结果表明,采用改进算法所得结果比船厂排产计划库存时间更少,资源利用率更高,该算法有效。

混沌遗传算法(CGA)的应用研究及其优化效率评价

利用混沌运动的遍历性 ,提出了一种求解优化问题的混沌遗传算法 (CGA,Chaos Ge-netic Algorithm) .该算法的基本思想是把混沌变量加载于遗传算法的变量群体中 ,利用混沌变量对子代群体进行微小扰动并随着搜索过程的进行逐渐调整扰动幅度 .研究结果表明 ,该方法效果显著 ,明显提高了优化计算效率 .本文将“平均截止代数”和“截止代数分布熵”作为评价指标 ,对混沌遗传算法 (CGA)的优化效率进行了研究 ,定量地评价了 CGA的优化效率 ,通过与遗传算法 (GA)进行比较 ,进一步说明了 CGA的优化效率高于 GA.

基于CGA和ICA的人脸特征提取方法研究

独立分量分析方法是一种有效的人脸特征提取方法。为了提高独立分量分析法表征人脸特征空间的能力,采用遗传算法对特征空间进行选择优化,获得最优的人脸特征子集。针对遗传算法的随机初始化个体分布不均匀性问题,采用混沌种群生成算法,使遗传算法的搜索更具有全局性。仿真实验表明,该方法的识别率明显优于单一独立分量分析方法。