MVSA: Multiple vortex search algorithm

摘要

In recent years, many different metaheuristic algorithms have been proposed; the Vortex Search Algorithm (VSA) is one of them that has been inspired from the vertical flow of the fluids. It is a single-solution based optimization algorithm which moves to better positions in its neighborhood, in each iteration. But, this mechanism may trap in a local optimum. Hence, in this paper, we propose a modified version of it. In other words, we consider a number of parallel vortices as a parent vortex and many child vortices, instead of one vortex in the VSA; besides in each iteration, they attract by best child vortex and parent vortex. Experiments have been performed on some benchmark functions which the VSA failed to find optimum of them or gained poor performances. The proposed method has shown good results in comparison with VSA and other metaheuristic algorithms.