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.

Model selection for SVM using mutative scale chaos optimization algorithm

This paper proposes a new search strategy using mutative scale chaos optimization algorithm （MSCO） for model selection of support vector machine （SVM）. It searches the parameter space of SVM with a very high efficiency and finds the optimum parameter setting for a practical classification problem with very low time cost. To demonstrate the performance of the proposed method it is applied to model selection of SVM in ultrasonic flaw classification and compared with grid search for model selection. Experimental results show that MSCO is a very powerful tool for model selection of SVM, and outperforms grid search in search speed and precision in ultrasonic flaw classification.

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.

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.

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 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.

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.

NEW LIMITED MEMORY SYMMETRIC RANK ONE ALGORITHM FOR LARGE-SCALE UNCONSTRAINED OPTIMIZATION

A new limited memory symmetric rank one algorithm is proposed. It combines a modified self-scaled symmetric rank one （SSR1） update with the limited memory and nonmonotone line search technique. In this algorithm, the descent search direction is generated by inverse limited memory SSR1 update, thus simplifying the computation. Numerical comparison of the algorithm and the famous limited memory BFGS algorithm is given. Comparison results indicate that the new algorithm can process a kind of large-scale unconstrained optimization problems.

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.

Multidisciplinary design optimization on production scale of underground metal mine

In order to ensure overall optimization of the underground metal mine production scale, multidisciplinary design optimization model of production scale which covers the subsystem objective function of income of production, safety and environmental impact in the underground metal mine was established by using multidisciplinary design optimization method. The coupling effects from various disciplines were fully considered, and adaptive mutative scale chaos immunization optimization algorithm was adopted to solve multidisciplinary design optimization model of underground metal mine production scale. Practical results show that multidisciplinary design optimization on production scale of an underground lead and zinc mine reflect the actual operating conditions more realistically, the production scale is about 1.25 Mt/a (Lead and zinc metal content of 160 000 t/a), the economic life is approximately 14 a, corresponding coefficient of production profits can be increased to 15.13%, safety factor can be increased to 5.4% and environmental impact coefficient can be reduced by 9.52%.

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.

Short-term Load Prediction of Integrated Energy System with Wavelet Neural Network Model Based on Improved Particle Swarm Optimization and Chaos Optimization Algorithm

To improve energy efficiency and protect the environment,the integrated energy system(IES)becomes a significant direction of energy structure adjustment.This paper innovatively proposes a wavelet neural network(WNN)model optimized by the improved particle swarm optimization(IPSO)and chaos optimization algorithm(COA)for short-term load prediction of IES.The proposed model overcomes the disadvantages of the slow convergence and the tendency to fall into the local optimum in traditional WNN models.First,the Pearson correlation coefficient is employed to select the key influencing factors of load prediction.Then,the traditional particle swarm optimization(PSO)is improved by the dynamic particle inertia weight.To jump out of the local optimum,the COA is employed to search for individual optimal particles in IPSO.In the iteration,the parameters of WNN are continually optimized by IPSO-COA.Meanwhile,the feedback link is added to the proposed model,where the output error is adopted to modify the prediction results.Finally,the proposed model is employed for load prediction.The experimental simulation verifies that the proposed model significantly improves the prediction accuracy and operation efficiency compared with the artificial neural network(ANN),WNN,and PSO-WNN.

A New Class of Hybrid Particle Swarm Optimization Algorithm

A new class of hybrid particle swarm optimization （PSO） algorithm is developed for solving the premature convergence caused by some particles in standard PSO fall into stagnation. In this algorithm, the linearly decreasing inertia weight technique （LDIW） and the mutative scale chaos optimization algorithm （MSCOA） are combined with standard PSO, which are used to balance the global and local exploration abilities and enhance the local searching abilities, respectively. In order to evaluate the performance of the new method, three benchmark functions are used. The simulation results confirm the proposed algorithm can greatly enhance the searching ability and effectively improve the premature convergence.

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.

Multidisciplinary design optimization for air-condition production system based on multi-agent technique

In order to guarantee the overall production performance of the multiple departments in an air-condition production industry, multidisciplinary design optimization model for production system is established based on the multi-agent technology. Local operation models for departments of plan, marketing, sales, purchasing, as well as production and warehouse are formulated into individual agents, and their respective local objectives are collectively formulated into a multi-objective optimization problem. Considering the coupling effects among the correlated agents, the optimization process is carried out based on self-adaptive chaos immune optimization algorithm with mutative scale. The numerical results indicate that the proposed multi-agent optimization model truly reflects the actual situations of the air-condition production system. The proposed multi-agent based multidisciplinary design optimization method can help companies enhance their income ratio and profit by about 33% and 36%, respectively, and reduce the total cost by about 1.8%.

Control of Neural Network Feedback Linearization Based on Chaotic Particle Swarm Optimization

A new chaotic particle swarm algorithm is proposed in order to avoid the premature convergence of the particle swarm optimization and the shortcomings of the chaotic optimization, such as slow searching speed and low accuracy when used in the multivariable systems or in large search space. The new algorithm combines the particle swarm algorithm and the chaotic optimization, using randomness and ergodicity of chaos to overcome the premature convergence of the particle swarm optimization. At the same time, a new neural network feedback linearization control system is built to control the single-machine infinite-bus system. The network parameters are trained by the chaos particle swarm algorithm, which makes the control achieve optimization and the control law of prime mover output torque obtained. Finally, numerical simulation and practical application validate the effectiveness of the method.

Empirical Review of Standard Benchmark Functions Using Evolutionary Global Optimization

We have employed a recent implementation of genetic algorithms to study a range of standard benchmark functions for global optimization. It turns out that some of them are not very useful as challenging test functions, since they neither allow for a discrimination between different variants of genetic operators nor exhibit a dimensionality scaling resembling that of real-world problems, for example that of global structure optimization of atomic and molecular clusters. The latter properties seem to be simulated better by two other types of benchmark functions. One type is designed to be deceptive, exemplified here by Lunacek’s function. The other type offers additional advantages of markedly increased complexity and of broad tunability in search space characteristics. For the latter type, we use an implementation based on randomly distributed Gaussians. We advocate the use of the latter types of test functions for algorithm development and benchmarking.

Simplified Group Search Optimizer Algorithm for Large Scale Global Optimization

A simplified group search optimizer algorithm denoted as"SGSO"for large scale global optimization is presented in this paper to obtain a simple algorithm with superior performance on high-dimensional problems.The SGSO adopts an improved sharing strategy which shares information of not only the best member but also the other good members,and uses a simpler search method instead of searching by the head angle.Furthermore,the SGSO increases the percentage of scroungers to accelerate convergence speed.Compared with genetic algorithm(GA),particle swarm optimizer(PSO)and group search optimizer(GSO),SGSO is tested on seven benchmark functions with dimensions 30,100,500 and 1 000.It can be concluded that the SGSO has a remarkably superior performance to GA,PSO and GSO for large scale global optimization.