关键词: 蝙蝠算法, 混沌, Powell搜索方法, 变异, 粒子群优化

Abstract: The Bat Algorithm（BA） has a few disadvantages in the global searching, including slow convergence speed, high possibility of being trapped in local optimum and low solving precision. A hybrid bat algorithm based on Powell search method is proposed to solve unconstrained optimization problems. Firstly, chaotic sequence is used to initiate individual position and velocity, which strengthens the diversity of global searching. It combines the bat algorithm and Powell search to enhance the ability of local search and improve the convergence speed of algorithm. Mutation strategy is used to prevent the algorithm into a local optimum in a certain extent. The experimental results show that the proposed algorithm is more effective and feasible than the standard BA and Particle Swarm Optimization（PSO） algorithm.

Key words: Bat Algorithm（BA）, chaotic, Powell search method, hybrid, Particle Swarm Optimization（PSO）