Whale Optimization Algorithm Based on Chaotic Elite and Lévy Flight Strategy
For the problems of slow convergence and low accuracy of Whale Optimization Algorithm(WO A),the WO A based on Tent chaotic Elite and Lévy flight strategy(TELWOA)is proposed.The whale population is initialized by Tent chaotic mapping to maintain the population diversity,and the algorithm convergence speed is accelerated by introducing an elite opposition-based learning strategy to generate the inverse solution for the elite individuals of the initial population and select the population with high adaptation as the next generation whale population.Secondly,by using a nonlinear convergence factor,the imbalance between the algorithm's global search and local search ability is alleviated.Finally,the Lévy flight strategy is used in the whale location search process to avoid the algorithm from falling into local optimum and to improve the global search ability of the algorithm.By analyzing the effectiveness of different improvement strategies and comparing with other intelligent algorithms,it is proved that TELWOA has significant improvement in convergence accuracy,algorithmic stability and global optimization searching ability with comparison algorithms,and it has certain practical engineering application ability.