As the bat algorithm (BA) is slow in convergence and the Hooke-Jeeves algorithm is easy to be trapped into local optimization, this paper combines advantages of the two algorithms and comes up with a hybrid algorithm called Hooke-Jeeves bat algorithm to solve nonlinear equations. Hooke-Jeeves bat algorithm not only is capable of searching the globally optimal solution, but also can realize local fine search. Experimental results show that Hooke-Jeeves bat algorithm is an effective optimization method for solving nonlinear equations and can be applied to the settlement of other unconstrained optimization problems.