Multi-Strategy Boosted Spider Monkey Optimization Algorithm for Feature Selection

To solve the problem of slow convergence and easy to get into the local optimum of the spider monkey optimization algorithm,this paper presents a new algorithm based on multi-strategy(ISMO).First,the initial population is generated by a refracted opposition-based learning strategy to enhance diversity and ergodicity.Second,this paper introduces a non-linear adaptive dynamic weight factor to improve convergence efficiency.Then,using the crisscross strategy,using the horizontal crossover to enhance the global search and vertical crossover to keep the diversity of the population to avoid being trapped in the local optimum.At last,we adopt a Gauss-Cauchy mutation strategy to improve the stability of the algorithm by mutation of the optimal individuals.Therefore,the application of ISMO is validated by ten benchmark functions and feature selection.It is proved that the proposed method can resolve the problem of feature selection.

Genetic Algorithm-Based Approaches for Optimizing S-Boxes

Multi-objective genetic algorithm is much suitable for solving multi-objective optimization problems. By use of Genetic algorithm, the optimization of S-boxes is explored in this paper. Results of the experiments show that, with heuristic mutation strategy, the algorithm has high searching efficiency and fast convergence speed. Meanwhile, we also have take the avalanche probability of S-boxes into account, besides nonlinearity and difference uniformity. Under this method, an effective genetic algorithm for 6×6 S-boxes is provided and a number of S-boxes with good cryptographic capability can be obtained.

Research of Rural Power Network Reactive Power Optimization Based on Improved ACOA

In view of the serious reactive power loss in the rural network, improved ant colony optimization algorithm （ACOA） was used to optimize the reactive power compensation for the rural distribution system. In this study, the traditional ACOA was improved in two aspects： one was the local search strategy, and the other was pheromone mutation and re-initialization strategies. The reactive power optimization for a county＇s distribution network showed that the improved ACOA was practicable.

Harris Hawks Algorithm Incorporating Tuna Swarm Algorithm and Differential Variance Strategy

Because of the low convergence accuracy of the basic Harris Hawks algorithm,which quickly falls into the local optimal,a Harris Hawks algorithm combining tuna swarm algorithm and differential mutation strategy(TDHHO)is proposed.The escape energy factor of nonlinear periodic energy decline balances the ability of global exploration and regional development.The parabolic foraging approach of the tuna swarm algorithm is introduced to enhance the global exploration ability of the algorithm and accelerate the convergence speed.The difference variation strategy is used to mutate the individual position and calculate the fitness,and the fitness of the original individual position is compared.The greedy technique is used to select the one with better fitness of the objective function,which increases the diversity of the population and improves the possibility of the algorithm jumping out of the local extreme value.The test function tests the TDHHO algorithm,and compared with other optimization algorithms,the experimental results show that the convergence speed and optimization accuracy of the improved Harris Hawks are improved.Finally,the enhanced Harris Hawks algorithm is applied to engineering optimization and wireless sensor networks(WSN)coverage optimization problems,and the feasibility of the TDHHO algorithm in practical application is further verified.

Feedback Mechanism-driven Mutation Reptile Search Algorithm for Optimizing Interpolation Developable Surfaces

Curvature lines are special and important curves on surfaces.It is of great significance to construct developable surface interpolated on curvature lines in engineering applications.In this paper,the shape optimization of generalized cubic ball developable surface interpolated on the curvature line is studied by using the improved reptile search algorithm.Firstly,based on the curvature line of generalized cubic ball curve with shape adjustable,this paper gives the construction method of SGC-Ball developable surface interpolated on the curve.Secondly,the feedback mechanism,adaptive parameters and mutation strategy are introduced into the reptile search algorithm,and the Feedback mechanism-driven improved reptile search algorithm effectively improves the solving precision.On IEEE congress on evolutionary computation 2014,2017,2019 and four engineering design problems,the feedback mechanism-driven improved reptile search algorithm is compared with other representative methods,and the result indicates that the solution performance of the feedback mechanism-driven improved reptile search algorithm is competitive.At last,taking the minimum energy as the evaluation index,the shape optimization model of SGC-Ball interpolation developable surface is established.The developable surface with the minimum energy is achieved with the help of the feedback mechanism-driven improved reptile search algorithm,and the comparison experiment verifies the superiority of the feedback mechanism-driven improved reptile search algorithm for the shape optimization problem.

An Improved Tunicate Swarm Algorithm with Best-random Mutation Strategy for Global Optimization Problems

The Tunicate Swarm Algorithm(TSA)inspires by simulating the lives of Tunicates at sea and how food is obtained.This algorithm is easily entrapped to local optimization despite the simplicity and optimal,leading to early convergence compared to some metaheuristic algorithms.This paper sought to improve this algorithm's performance using mutating operators such as the lévy mutation operator,the Cauchy mutation operator,and the Gaussian mutation operator for global optimization problems.Thus,we introduced a version of this algorithm called the QLGCTSA algorithm.Each of these operators has a different performance,increasing the QLGCTSA algorithm performance at a specific optimization operation stage.This algorithm has been run on benchmark functions,including three different compositions,unimodal(UM),and multimodal(MM)groups and its performance evaluate six large-scale engineering problems.Experimental results show that the QLGCTSA algorithm had outperformed other competing optimization algorithms.