A Novel Hybrid Vortex Search And Artificial Bee Colony Algorithms For Numerical Optimization Problems

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 with the artificial bee colony algorithm(ABC)which has good performance in exploration,we present a HVS 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 we adopt the vortex search algorithm to find the best solution.In the meantime,we cannot treat the best solution so far as the center all the time.The algorithm is tested by 50 benchmark functions.We have compared the mean,the variance,the best solution,the worst solution and the runtime of the algorithms.In order to know whether there is significance between each algorithm,The pairwise statistical test called Wilcoxon Signed-Rank Test with a statistical significance value =0.05 is employed.In the meantime,we observe the convergence of the algorithms.The numerical results show the HVS algorithm has superior performance over the ABC and the VS algorithms.