EJS: Multi-Strategy Enhanced Jellyfish Search Algorithm for Engineering Applications

Gang Hu (), Jiao Wang, Min Li, Abdelazim G. Hussien and Muhammad Abbas
Additional contact information
Gang Hu: Department of Applied Mathematics, Xi’an University of Technology, Xi’an 710054, China
Jiao Wang: School of Mechanical and Precision Instrument Engineering, Xi’an University of Technology, Xi’an 710048, China
Min Li: Department of Applied Mathematics, Xi’an University of Technology, Xi’an 710054, China
Abdelazim G. Hussien: Department of Computer and Information Science, Linköping University, 581 83 Linköping, Sweden
Muhammad Abbas: Department of Mathematics, University of Sargodha, Sargodha 40100, Pakistan

Mathematics, 2023, vol. 11, issue 4, 1-32

Abstract: The jellyfish search (JS) algorithm impersonates the foraging behavior of jellyfish in the ocean. It is a newly developed metaheuristic algorithm that solves complex and real-world optimization problems. The global exploration capability and robustness of the JS algorithm are strong, but the JS algorithm still has significant development space for solving complex optimization problems with high dimensions and multiple local optima. Therefore, in this study, an enhanced jellyfish search (EJS) algorithm is developed, and three improvements are made: (i) By adding a sine and cosine learning factors strategy, the jellyfish can learn from both random individuals and the best individual during Type B motion in the swarm to enhance optimization capability and accelerate convergence speed. (ii) By adding a local escape operator, the algorithm can skip the trap of local optimization, and thereby, can enhance the exploitation ability of the JS algorithm. (iii) By applying an opposition-based learning and quasi-opposition learning strategy, the population distribution is increased, strengthened, and more diversified, and better individuals are selected from the present and the new opposition solution to participate in the next iteration, which can enhance the solution’s quality, meanwhile, convergence speed is faster and the algorithm’s precision is increased. In addition, the performance of the developed EJS algorithm was compared with those of the incomplete improved algorithms, and some previously outstanding and advanced methods were evaluated on the CEC2019 test set as well as six examples of real engineering cases. The results demonstrate that the EJS algorithm can skip the trap of local optimization, can enhance the solution’s quality, and can increase the calculation speed. In addition, the practical engineering applications of the EJS algorithm also verify its superiority and effectiveness in solving both constrained and unconstrained optimization problems, and therefore, suggests future possible applications for solving such optimization problems.

Keywords: metaheuristic algorithm; jellyfish search algorithm; sine and cosine learning factors; local escape operator; opposition-based learning (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/4/851/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/4/851/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:4:p:851-:d:1060776

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().