EJS: Multi-Strategy Enhanced Jellyfish Search Algorithm for En-Gineering Applications

Jellyfish search (JS) algorithm impersonates the foraging behavior of jellyfish in the ocean. It is a new developed meta-heuristic algorithm that solves complex and real world optimization problems. The global explore capability and robustness of JS are strong, but JS still has great development space in solving complex optimization problems with high dimensions and multiple local optima. Therefore, an enhanced jellyfish search (EJS) algorithm is developed in this study, and three improvements are made: (i) By adding sine and cosine learning factors, the jellyfish can learn from both random individual and best individual during Type B motion in swarm to enhance the optimization capability and convergence speed; (ii) Adding local escape operator can skip local optimal trap and boost the exploitation ability of JS; (iii) Opposition-based learning operator and quasi-opposition learning operator can increase and strengthen the population distribution more diversified, and better individuals are selected from present and new opposition-solution to participates in the next iteration, which can boost the solution’s quality, meanwhile convergence speed is fasted and its precision is increased. In addition, the performance contrast of the developed EJS and some previous outstanding and advanced methods are evaluated on CEC2017, CEC2019 test suite and six real engineering example of case. It is demonstrated that EJS algorithm escaped the trap of local optimum, enhanced the solution’s quality and the calculation speed. What’s more, the practical engineering applications of EJS algorithm also verify its superiority and effectiveness in solving both constrained and unconstrained optimization problems, and it stretched one’s mind for solving such optimization problems.