A modified whale optimization algorithm with single-dimensional swimming for global optimization problems

Abstract

As a novel meta-heuristic algorithm, the Whale Optimization Algorithm (WOA) has well performance in solving optimization problems. However, WOA usually tends to trap in local optimal and it suffers slow convergence speed for large-scale and high-dimension optimization problems. A modified whale optimization algorithm with single-dimensional swimming (abbreviated as SWWOA) is proposed in order to overcome the shortcoming. First, tent map is applied to generate the initialize population for maximize search ability. Second, quasi-opposition learning is adopted after every iteration for further improving the search ability. Third, a novel nonlinearly control parameter factor that is based on logarithm function is presented in order to balance exploration and exploitation. Additionally, the last, single-dimensional swimming is proposed in order to replace the prey behaviour in standard WOA for tuning. The simulation experiments were conducted on 20 well-known benchmark functions. The results show that the proposed SWWOA has better performance in solution precision and higher convergence speed than the comparison methods.