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.

Neural Network Nonlinear Predictive Control Based on Tent-map Chaos Optimization

With the unique erggdicity, i rregularity, and.special ability to avoid being trapped in local optima, chaos optimization has been a novel global optimization technique and has attracted considerable attention for application in various fields, such as nonlinear programming problems. In this article, a novel neural network nonlinear predic-tive control （NNPC） strategy baseed on the new Tent-map chaos optimization algorithm （TCOA） is presented. Thefeedforward neural network＇is used as the multi-step predictive model. In addition, the TCOA is applied to perform the nonlinear rolling optimization to enhance the convergence and accuracy in the NNPC. Simulation on a labora-tory-scale liquid-level system is given to illustrate the effectiveness of the proposed method.

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

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.

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.

Chaos quantum particle swarm optimization for reactive power optimization considering voltage stability

The reactive power optimization considering voltage stability is an effective method to improve voltage stablity margin and decrease network losses,but it is a complex combinatorial optimization problem involving nonlinear functions having multiple local minima and nonlinear and discontinuous constraints. To deal with the problem,quantum particle swarm optimization (QPSO) is firstly introduced in this paper,and according to QPSO,chaotic quantum particle swarm optimization (CQPSO) is presented,which makes use of the randomness,regularity and ergodicity of chaotic variables to improve the quantum particle swarm optimization algorithm. When the swarm is trapped in local minima,a smaller searching space chaos optimization is used to guide the swarm jumping out the local minima. So it can avoid the premature phenomenon and to trap in a local minima of QPSO. The feasibility and efficiency of the proposed algorithm are verified by the results of calculation and simulation for IEEE 14-buses and IEEE 30-buses systems.

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.

Intelligent Cybersecurity Classification Using Chaos Game Optimization with Deep Learning Model

Cyberattack detection has become an important research domain owing to increasing number of cybercrimes in recent years.Both Machine Learning(ML)and Deep Learning(DL)classification models are useful in effective identification and classification of cyberattacks.In addition,the involvement of hyper parameters in DL models has a significantly influence upon the overall performance of the classification models.In this background,the current study develops Intelligent Cybersecurity Classification using Chaos Game Optimization with Deep Learning(ICC-CGODL)Model.The goal of the proposed ICC-CGODL model is to recognize and categorize different kinds of attacks made upon data.Besides,ICC-CGODL model primarily performs min-max normalization process to normalize the data into uniform format.In addition,Bidirectional Gated Recurrent Unit(BiGRU)model is utilized for detection and classification of cyberattacks.Moreover,CGO algorithm is also exploited to adjust the hyper parameters involved in BiGRU model which is the novelty of current work.A wide-range of simulation analysis was conducted on benchmark dataset and the results obtained confirmed the significant performance of ICC-CGODL technique than the recent approaches.

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.

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

Combination forecast for urban rail transit passenger flow based on fuzzy information granulation and CPSO-LS-SVM

In order to obtain the trend of urban rail transit traffic flow and grasp the fluctuation range of passenger flow better,this paper proposes a combined forecasting model of passenger flow fluctuation range based on fuzzy information granulation and least squares support vector machine(LS-SVM)optimized by chaos particle swarm optimization(CPSO).Due to the nonlinearity and fluctuation of the passenger flow,firstly,fuzzy information granulation is used to extract the valid data from the window according to the requirement.Secondly,CPSO that has strong global search ability is applied to optimize the parameters of the LS-SVM forecasting model.Finally,the combined model is used to forecast the fluctuation range of early peak passenger flow at Tiyu Xilu Station of Guangzhou Metro Line 3 in 2014,and the results are compared and analyzed with other models.Simulation results demonstrate that the combined forecasting model can effectively track the fluctuation of passenger flow,which provides an effective method for predicting the fluctuation range of short-term passenger flow in the future.

Novel chaos game optimization tuned-fractional-order PID fractional-order PI controller for load-frequency control of interconnected power systems

In this work,chaos game optimization(CGO),a robust optimization approach,is employed for efficient design of a novel cascade controller for four test systems with interconnected power systems(IPSs)to tackle load-frequency con-trol(LFC)difficulties.The CGO method is based on chaos theory principles,in which the structure of fractals is seen via the chaotic game principle and the fractals’self-similarity characteristics are considered.CGO is applied in LFC studies as a novel application,which reveals further research gaps to be filled.For practical implementation,it is also highly desirable to keep the controller structure simple.Accordingly,in this paper,a CGO-based controller of fractional-order(FO)proportional-integral-derivative-FO proportional-integral(FOPID-FOPI)controller is proposed,and the integral time multiplied absolute error performance function is used.Initially,the proposed CGO-based FOPID-FOPI controller is tested with and without the nonlinearity of the governor dead band for a two-area two-source model of a non-reheat unit.This is a common test system in the literature.A two-area multi-unit system with reheater-hydro-gas in both areas is implemented.To further generalize the advantages of the proposed scheme,a model of a three-area hydrothermal IPS including generation rate constraint nonlinearity is employed.For each test system,comparisons with relevant existing studies are performed.These demonstrate the superiority of the proposed scheme in reducing settling time,and frequency and tie-line power deviations.

Selection of logistics distribution center location for SDN enterprises

The location selection of the logistics distribution center for a supply and demand network(SDN)enterprises directly affected the efficiency of the logistics system operation and the customer service level.In this paper,we present a location selection model of the logistics distribution center for SDN enterprises.In order to improve the optimization effectiveness of the traditional methods in solving the location selection problem,an improved firefly algorithm was presented.By introducing a coordination factor,the search step can be automatically adjusted,and the accuracy of the algorithm can be improved.By introducing a chaotic search strategy,the diversity of firefly populations and the global optimization ability of the algorithm can be improved.The simulation experiments showed that the improved firefly algorithm achieved a more favorable effectiveness than three other algorithms we tested.

A Chaotic Approach for the Bi-level Discrete Equilibrium Network Design Problem

A chaotic algorithm for providing a solution to the bi-level Discrete Equilibrium Network Design Problem （NDP） is discussed following an introduction of the Discrete Network Design Problem （DNDP） model and Chaos Optimization Algorithms （COA）. A description of the chaotic approach for the DNDP model is described in details. Then a numerical example for the DNDP is carried out to investigate the chaotic approach. The results have been encouraging, indicating that the chaotic approach has great potential ability in finding the optimal solution of DNDP models.