Though vortex search(VS) algorithm has good performance in solving global numerical optimization problems, it cannot fully search the whole space occasionally. Combining the vortex search algorithm and the artificial bee colony algorithm(ABC) which has good performance in exploration, we present a HVS(hybrid vortex search) algorithm to solve the numerical optimization problems. We first use the employed bees and onlooker bees of ABC algorithm to find a solution, and then adopt the VS algorithm to find the best solution. In the meantime, we cannot treat the best solution so far as the center of the algorithm all the time. The algorithm is tested by 50 benchmark functions. The numerical results show the HVS algorithm has superior performance over the ABC and the VS algorithms. While vortex search (VS) algorithm has good performance in solving global numerical optimization problems, it can not be fully searched the whole space occasionally. Combining the vortex search algorithm and the artificial bee colony algorithm (ABC) which has good performance in exploration, we present a We first use the employed bees and onlooker bees of ABC algorithm to find a solution, and then adopt the VS algorithm to find the best solution. In the meantime, we can not treat The best solution so far as the center of the algorithm all the time. The algorithm results were tested by 50 benchmark functions. The numerical results show the HVS algorithm has superior performance over the ABC and the VS algorithms.