To solve the weakness of bat algorithm of slow convergence in demand of higher precision and easiness of trapping in local optimum, based on the framework of the bat algorithm, Lévy flights with good randomness was used to enhance the global search ability of the algorithm, and the simplex method was combined with bat algorithm to improve the performance during the local mining period.By mapping the solution of clustering problem in bat algorithm, results of the simulation indicate the proposed isomeric bat algorithm has outstanding efficiency and optimization performance.It also shows that the algorithm has high accuracy and convergence speed, and it can provide a reference for solving the clustering problem.
bat algorithmLévy-flightsclustering problemsimplex methodheterogeneous bat algorithm
NETL
NSTL
万方数据
维普
