Research on multiple-strategy improved coati optimization algorithm for engineering applications

In this paper,a multi-strategy improved coati optimization algorithm(MICOA)for engineering applications is proposed to improve the performance of the coati optimization algorithm(COA)in terms of convergence speed and convergence accuracy.First,a chaotic mapping is applied to initial-ize the population in order to improve the quality of the population and thus the convergence speed of the algorithm.Second,the prey’s position is improved during the prey-hunting phase.Then,the COA is combined with the particle swarm optimization(PSO)and the golden sine algorithm(Gold-SA),and the position is updated with probabilities to avoid local extremes.Finally,a population decreasing strategy is applied as a way to improve the performance of the algorithm in a comprehen-sive approach.The paper compares the proposed algorithm MICOA with 7 well-known meta-heuristic optimization algorithms and evaluates the algorithm in 23 test functions as well as engineering appli-cation.Experimental results show that the MICOA proposed in this paper has good effectiveness and superiority,and has a strong competitiveness compared with the comparison algorithms.

A new adaptive mutative scale chaos optimization algorithm and its application

Based on results of chaos characteristics comparing one-dimensional iterative chaotic self-map x = sin（2/x） with infinite collapses within the finite region[-1, 1] to some representative iterative chaotic maps with finite collapses （e.g., Logistic map, Tent map, and Chebyshev map）, a new adaptive mutative scale chaos optimization algorithm （AMSCOA） is proposed by using the chaos model x = sin（2/x）. In the optimization algorithm, in order to ensure its advantage of speed convergence and high precision in the seeking optimization process, some measures are taken： 1） the searching space of optimized variables is reduced continuously due to adaptive mutative scale method and the searching precision is enhanced accordingly; 2） the most circle time is regarded as its control guideline. The calculation examples about three testing functions reveal that the adaptive mutative scale chaos optimization algorithm has both high searching speed and precision.

A new optimization algorithm based on chaos

In this article, some methods are proposed for enhancing the converging velocity of the COA (chaos optimization algorithm) based on using carrier wave two times, which can greatly increase the speed and efficiency of the first carrier wave’s search for the optimal point in implementing the sophisticated searching during the second carrier wave is faster and more accurate. In addition, the concept of using the carrier wave three times is proposed and put into practice to tackle the multi-variables opti- mization problems, where the searching for the optimal point of the last several variables is frequently worse than the first several ones.

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.

Multi-Level Image Segmentation Combining Chaotic Initialized Chimp Optimization Algorithm and Cauchy Mutation

To enhance the diversity and distribution uniformity of initial population,as well as to avoid local extrema in the Chimp Optimization Algorithm(CHOA),this paper improves the CHOA based on chaos initialization and Cauchy mutation.First,Sin chaos is introduced to improve the random population initialization scheme of the CHOA,which not only guarantees the diversity of the population,but also enhances the distribution uniformity of the initial population.Next,Cauchy mutation is added to optimize the global search ability of the CHOA in the process of position(threshold)updating to avoid the CHOA falling into local optima.Finally,an improved CHOA was formed through the combination of chaos initialization and Cauchy mutation(CICMCHOA),then taking fuzzy Kapur as the objective function,this paper applied CICMCHOA to natural and medical image segmentation,and compared it with four algorithms,including the improved Satin Bowerbird optimizer(ISBO),Cuckoo Search(ICS),etc.The experimental results deriving from visual and specific indicators demonstrate that CICMCHOA delivers superior segmentation effects in image segmentation.

Hardware/software partitioning based on dynamic combination of maximum entropy and chaos optimization algorithm

This paper presents an algorithm that combines the chaos optimization algorithm with the maximum entropy ( COA-ME) by using entropy model based on chaos algorithm,in which the maximum entropy is used as the second method of searching the excellent solution. The search direction is improved by chaos optimization algorithm and realizes the selective acceptance of wrong solution. The experimental result shows that the presented algorithm can be used in the partitioning of hardware/software of reconfigurable system. It effectively reduces the local extremum problem,and search speed as well as performance of partitioning is improved.

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.

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 Chaos Sparrow Search Algorithm with Logarithmic Spiral and Adaptive Step for Engineering Problems

The sparrow search algorithm(SSA)is a newly proposed meta-heuristic optimization algorithm based on the sparrowforaging principle.Similar to other meta-heuristic algorithms,SSA has problems such as slowconvergence speed and difficulty in jumping out of the local optimum.In order to overcome these shortcomings,a chaotic sparrow search algorithm based on logarithmic spiral strategy and adaptive step strategy(CLSSA)is proposed in this paper.Firstly,in order to balance the exploration and exploitation ability of the algorithm,chaotic mapping is introduced to adjust the main parameters of SSA.Secondly,in order to improve the diversity of the population and enhance the search of the surrounding space,the logarithmic spiral strategy is introduced to improve the sparrow search mechanism.Finally,the adaptive step strategy is introduced to better control the process of algorithm exploitation and exploration.The best chaotic map is determined by different test functions,and the CLSSA with the best chaotic map is applied to solve 23 benchmark functions and 3 classical engineering problems.The simulation results show that the iterative map is the best chaotic map,and CLSSA is efficient and useful for engineering problems,which is better than all comparison algorithms.

Random Fuzzy Chance-constrained Programming Based on Adaptive Chaos Quantum Honey Bee Algorithm and Robustness Analysis

This paper proposes an adaptive chaos quantum honey bee algorithm （CQHBA） for solving chance-constrained program- ming in random fuzzy environment based on random fuzzy simulations. Random fuzzy simulation is designed to estimate the chance of a random fuzzy event and the optimistic value to a random fuzzy variable. In CQHBA, each bee carries a group of quantum bits representing a solution. Chaos optimization searches space around the selected best-so-far food source. In the marriage process, random interferential discrete quantum crossover is done between selected drones and the queen. Gaussian quantum mutation is used to keep the diversity of whole population. New methods of computing quantum rotation angles are designed based on grads. A proof of con- vergence for CQHBA is developed and a theoretical analysis of the computational overhead for the algorithm is presented. Numerical examples are presented to demonstrate its superiority in robustness and stability, efficiency of computational complexity, success rate, and accuracy of solution quality. CQHBA is manifested to be highly robust under various conditions and capable of handling most random fuzzy programmings with any parameter settings, variable initializations, system tolerance and confidence level, perturbations, and noises.

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.

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.

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.

Modified evolutionary algorithm for global optimization

A modification of evolutionary programming or evolution strategies for ndimensional global optimization is proposed. Based on the ergodicity and inherentrandomness of chaos, the main characteristic of the new algorithm which includes two phases is that chaotic behavior is exploited to conduct a rough search of the problem space in order to find the promising individuals in Phase I. Adjustment strategy of steplength and intensive searches in Phase II are employed. The population sequences generated by the algorithm asymptotically converge to global optimal solutions with probability one. The proposed algorithm is applied to several typical test problems. Numerical results illustrate that this algorithm can more efficiently solve complex global optimization problems than evolutionary programming and evolution strategies in most cases.

An Improved Whale Optimization Algorithm for Global Optimization and Realized Volatility Prediction

The original whale optimization algorithm(WOA)has a low initial population quality and tends to converge to local optimal solutions.To address these challenges,this paper introduces an improved whale optimization algorithm called OLCHWOA,incorporating a chaos mechanism and an opposition-based learning strategy.This algorithm introduces chaotic initialization and opposition-based initialization operators during the population initialization phase,thereby enhancing the quality of the initial whale population.Additionally,including an elite opposition-based learning operator significantly improves the algorithm’s global search capabilities during iterations.The work and contributions of this paper are primarily reflected in two aspects.Firstly,an improved whale algorithm with enhanced development capabilities and a wide range of application scenarios is proposed.Secondly,the proposed OLCHWOA is used to optimize the hyperparameters of the Long Short-Term Memory(LSTM)networks.Subsequently,a prediction model for Realized Volatility(RV)based on OLCHWOA-LSTM is proposed to optimize hyperparameters automatically.To evaluate the performance of OLCHWOA,a series of comparative experiments were conducted using a variety of advanced algorithms.These experiments included 38 standard test functions from CEC2013 and CEC2019 and three constrained engineering design problems.The experimental results show that OLCHWOA ranks first in accuracy and stability under the same maximum fitness function calls budget.Additionally,the China Securities Index 300(CSI 300)dataset is used to evaluate the effectiveness of the proposed OLCHWOA-LSTM model in predicting RV.The comparison results with the other eight models show that the proposed model has the highest accuracy and goodness of fit in predicting RV.This further confirms that OLCHWOA effectively addresses real-world optimization problems.

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.

基于WD-COA-LSTM模型的月降水量预测

为进一步提高月降水量预测精度,提出了基于小波分解(WD)和郊狼优化(COA)算法的长短期记忆神经网络(LSTM)降水量预测模型(WD-COA-LSTM)。首先用小波分解对时间序列进行预处理,消除序列的非平稳性,得到1个低频序列和3个高频序列;然后通过郊狼优化算法对神经网络(LSTM)模型进行参数优化;最后将各子序列预测值叠加得到月降水量预测值。将提出的模型应用于洛阳市栾川县白土镇和洛宁县故县镇两个雨量站的月降水量预测中,并与LSTM、COA-LSTM、WD-LSTM模型预测结果进行对比。结果表明:提出的WD-COA-LSTM模型的预测精度最高,说明小波分解和郊狼优化算法能有效加强LSTM模型预测的精度和泛化能力,为月降水量的预测提供了一种新的途径。

基于RTSMFE、M-KRCDA与COA-SVM的行星齿轮箱故障诊断

针对从行星齿轮箱非线性、非平稳振动信号中提取故障特征困难的问题,提出了一种基于精细时移多尺度模糊熵(refined time-shift multiscale fuzzy entropy,RTSMFE)、马氏距离的核正则化共面判别分析(Mahalanobis-kernel regularized coplanar discriminant analysis,M-KRCDA)以及郊狼优化算法优化支持向量机(coyote optimization algorithm-support vector machine,COA-SVM)的行星齿轮箱故障诊断方法。首先利用RTSMFE计算和组合行星齿轮箱原始故障信号的特征向量,构建原始高维故障特征集;然后采用M-KRCDA的特征筛选方法,减少了特征的维数并提高特征故障识别的准确性和效率;最后将低维特征输入到COA-SVM进行故障类型的判别。行星齿轮箱故障诊断试验结果分析表明,所提方法能够准确识别行星齿轮箱的常见故障,具有一定的应用前景。