Heim / Blog / Jüngste Fortschritte bei der Verwendung von Bio

Jüngste Fortschritte bei der Verwendung von Bio

Aug 09, 2023Aug 09, 2023

Scientific Reports volume 12, Article number: 19157 (2022) Cite this article

4008 Accesses

11 Citations

2 Altmetric

Metrics details

The complexity of engineering optimization problems is increasing. Classical gradient-based optimization algorithms are a mathematical means of solving complex problems whose ability to do so is limited. Metaheuristics have become more popular than exact methods for solving optimization problems because of their simplicity and the robustness of the results that they yield. Recently, population-based bio-inspired algorithms have been demonstrated to perform favorably in solving a wide range of optimization problems. The jellyfish search optimizer (JSO) is one such bio-inspired metaheuristic algorithm, which is based on the food-finding behavior of jellyfish in the ocean. According to the literature, JSO outperforms many well-known meta-heuristics in a wide range of benchmark functions and real-world applications. JSO can also be used in conjunction with other artificial intelligence-related techniques. The success of JSO in solving diverse optimization problems motivates the present comprehensive discussion of the latest findings related to JSO. This paper reviews various issues associated with JSO, such as its inspiration, variants, and applications, and will provide the latest developments and research findings concerning JSO. The systematic review contributes to the development of modified versions and the hybridization of JSO to improve upon the original JSO and present variants, and will help researchers to develop superior metaheuristic optimization algorithms with recommendations of add-on intelligent agents.

Optimization is a process that is used to find the best inputs to maximize/minimize outputs at affordable computational cost1, 2. The complexity of engineering optimization problems is increasing. Classical gradient-based optimization algorithms have a limited ability to solve complex optimization problems using conventional mathematical methods3,4,5. Obviously, some traditional methods can be used to solve optimization problems, but they may not yield optimal results. Furthermore, traditional methods cannot resolve all difficult non-linear problems in an acceptable time6, 7. Metaheuristics have become more popular than exact methods for solving optimization problems because of their simplicity and the robustness of the results that they yield8,9,10. Population-based bio-inspired algorithms have recently been demonstrated to perform well in solving a wide range of optimization problems.

Recently developed original algorithms include forensic-based investigation algorithm (FBI)8, the slime mould algorithm (SMA)11, the group teaching optimization algorithm (GTOA)12, dynamic group optimization (DGO)13, the African vultures optimization algorithm (AVOA)14, the Rao-3 algorithm15, the gorilla troops optimizer (GTO)16, smell agent optimization (SAO)17, the sparrow search algorithm (SSA)18, the artificial ecosystem optimizer (AEO)19, the starling murmuration optimizer (SMO)20, the dwarf mongoose optimization algorithm (DMOA)21, the war strategy optimization algorithm (WSOA)22, the dynamic butterfly optimization algorithm (DBOA)23, the artificial hummingbird optimization technique (AHOT)24, and the antlion optimization algorithm (ALOA)25.

Newly enhanced algorithms include the fractional-order modified Harris hawks optimizer (FMHHO)26, the modified manta ray foraging optimization algorithm (MMRFOA)27, an enhanced slime mould algorithm28, the hybrid marine predator algorithm (HMPA)29, partitioned step particle swarm optimization (PSPSO)30, the improved chimp optimization algorithm (ICHOA)31, the high performance cuckoo search algorithm (HPCSA)32, the comprehensive learning marine predator algorithm (CLMPA)33, the enhanced sparrow search algorithm (ESSA)34, the hybrid algorithm that is known as three-learning strategy PSO (TLS-PSO)35, the enhanced shuffled shepherd optimization algorithm (ESSOA)36, the hybrid salp swarm algorithm with teaching-learning-based optimization (HSSATLBO)37, and an enhanced hybrid of crisscross optimization and the arithmetic optimization algorithm (CSOAOA)38. Both original and enhanced metaheuristic optimization algorithms are used in a wide range of fields, including engineering, business, transportation, energy, and even the social sciences.

Bio-inspired metaheuristics can be classified into four main categories based on the source of inspiration for their development; these are evolution-based, physics-based, swarm-based, and human-based. Recently, a novel swarm-based metaheuristic algorithm, called the jellyfish search optimizer (JSO)39, was developed based on the food-finding behavior of jellyfish in the ocean. According to Chou and Truong39, jellyfish move in the ocean in search of planktonic organisms such as fish eggs, larvae, and phytoplankton, and their movement patterns are of two major types, which are (1) following the ocean current and (2) within a jellyfish swarm. The simulation of JSO involves two phases which are diversification and intensification of the search. A time control mechanism governs the switching between these patterns of movement.

JSO can be used in conjunction with other AI-related methods, such as machine and deep learning tools, to optimize their hyper-parameters. The success of JSO in solving a wide range of optimization problems has inspired the present authors to discuss comprehensively the latest findings concerning JSO. This paper reviews various issues around JSO, including its inspiration, variants, and applications, and will provide the latest developments and research findings associated with JSO. The rest of the paper is organized as follows. “Bio-inspired jellyfish search algorithm” outlines the theoretical framework of JSO and explains its implementation in detail. “Recent improvements on and variants of JSO” presents improvements to JSO and corresponding, recently developed variants. “Applications” briefly explains novel applications of JSO in the real world and the field of artificial intelligence. “Discussion” compares performance among, and discusses potential enhancements of, JSO variants. “Conclusion and recommendations” draws conclusions and offers recommendations.

The jellyfish search optimizer (JSO) is a newly developed swarm-based optimization algorithm that was designed and proposed by Chou and Truong39. The following sections discuss the inspiration by jellyfish behavior and mathematical formulations of population initialization, the movement of jellyfish in an ocean current and in a swarm, time control mechanism, and the boundary conditions. The advantages and limitations of the algorithm will also be considered.

Jellyfish live in water of various depths and temperatures around the world. They are shaped like bells; some have a diameter of less than a centimeter while others are very large39, 40. They have a wide range of colors, sizes, and shapes. All of the many species exhibit particular adaptations to the oceanic environment. Their methods of feeding vary: some jellyfish use tentacles to bring food to their mouths while others use filter-feeding to eat whatever the current brings them; yet others actively hunt prey and immobilize them by stinging them with their tentacles39, 41. Jellyfish use their tentacles to sting their prey, and then release a venom that paralyzes it. They do not attack creatures, but those who swim up against or touch them may be stung to death. Jellyfish are most dangerous when gathered together in a jellyfish bloom39, 42.

Jellyfish have special features that enable them to control their movements. Their undersides close like an umbrella, pushing water out to propel their bodies forward. Despite this ability, they mostly drift in the water, so their motion is determined by currents and tides43. Jellyfish can form a swarm, and a large mass thereof is called a jellyfish bloom39, 44. In particular, jellyfish are weak swimming organisms and their orientations with respect to currents are key to the maintenance of blooms and ensuring that they do not become stranded. Numerous factors govern the formation of a swarm, including ocean currents, available nutrients, the availability of oxygen, the presence of predators, and temperature. Among these factors, ocean currents are the most important as they can collect jellyfish into a swarm39, 45.

The swarming of jellyfish, their movements inside swarms and the formation of blooms as jellyfish follow ocean currents have distributed jellyfish species almost everywhere in the ocean. The quantity of food at sites that are visited by a jellyfish varies. Jellyfish thus compare the amounts of food available at various sites and identify the best of them. Accordingly, a new algorithm, called the jellyfish search optimizer (JSO)39 and inspired by the search behavior and movements of jellyfish in the ocean is developed. Figure 1 shows the simulated search behavior and movement of jellyfish in ocean46, 47. In the next section, the behavior and movements of jellyfish in the ocean will be mathematically modeled, and a bio-inspired optimization algorithm that is based on the mathematical model will then be presented39.

Search behavior and movement of jellyfish in ocean.

The two main phases of a metaheuristic optimization algorithm are exploration and exploitation. In JSO, movement toward an ocean current is exploration, movement within a jellyfish swarm is exploitation, and a time control mechanism switches between them. Initially, the probability of exploration exceeds that of exploitation to find areas that contain promising optimal positions with respect to finding of food; over time, the probability of exploitation becomes much higher than that of exploration, and the jellyfish identify the best location inside the searched areas. Figures 2 and 3 present the flowchart and pseudocode of the single objective jellyfish search (SOJS) optimizer, respectively.

Schematic flowchart of SOJS algorithm, adapted from Ref.39.

Pseudocode of JSO algorithm, adapted from Ref.39.

The proposed optimization algorithm is based on three idealized rules39.

Jellyfish either follow the ocean current or move inside the swarm; a time control mechanism governs the switching between these types of movement.

Jellyfish move in the ocean in search of food. They are more attracted to locations where more food is present.

The quantity of food found is determined by the location and the corresponding objective function.

The population of an artificial optimization algorithm is normally initialized at random. The disadvantages of this method are its slow convergence and its tendency to become trapped at local optima as a result of low population diversity. To improve the diversity of the initial population while maintaining simplicity, JSO uses a chaotic map39 known as the logistic map48 which provides more diverse initial populations than does random selection and it yields a lower probability of premature convergence as shown in Eq. (1)39.

where, \({\text{X}}_{i+1}\) is the location of the ith jellyfish;\({\mathbf{X}}_{i}\) is the logistic chaotic value of the location of the ith jellyfish; \({\mathbf{X}}_{i}\) is used to generate an initial population of jellyfish; \({\mathbf{X}}_{o}\in \left(\text{0,1}\right)\text{,}{ \, {\text{X}}}_{o}\notin \left\{\text{0.0,0.25,0.75,0.5,1.0}\right\},\) and the parameter \(\eta\) is set to 4.039, 49, 50.

An ocean current contains large quantities of nutrients, so the jellyfish are attracted to it. The direction of the ocean current (\(\overrightarrow{\text{trend}}\)) is determined by averaging all of the vectors from all jellyfish in the population to the jellyfish that is currently in the best location. The ocean current can be simulated using Eq. (2) 39.

where \({\mathrm{X}}^{*}\) is the jellyfish that is currently is in the best location in the swarm; \({\varvec{\upmu}}\) is the mean location of all jellyfish, and \(\beta\) > 0 is a distribution coefficient that is related to the length of the ocean current (\(\overrightarrow{\text{trend}}\)). Based on the results of a sensitivity analysis in numerical experiments39, \(\beta\) =3. Thus, the new location of each jellyfish is given by Eqs. (3) and (4)39.

where \({\mathbf{X}}_{i}(t)\) is the current location of the jellyfish and \({\mathbf{X}}_{i}({\text{t}}+ \text{1} )\) is the new location of the jellyfish.

In a swarm, jellyfish exhibit passive (type A) and active (type B) motions42, 51. Initially, when a swarm has just been formed, most jellyfish exhibit type A motion. Over time, they increasingly exhibit type B motion.

Type A motion is that of jellyfish around their own locations. The corresponding updated location of each jellyfish is given by Eq. (5)39.

where \(\mathbf{U}\mathbf{b}\) and \(\mathbf{L}\mathbf{b}\) are the upper bound and lower bound on the search space, respectively, and \(\gamma\) > 0 is a motion coefficient, which is related to the length of the motion around each jellyfish’s location. The results of a sensitivity analysis in a numerical experiment39 yield \(\gamma\) = 0.1.

To simulate type B motion, a jellyfish (j) other than the one of interest is selected at random and a vector from the jellyfish of interest (i) to the selected jellyfish (j) is used to determine the direction of movement. When the quantity of food at the location of the selected jellyfish (j) exceeds that at the location of the jellyfish (i) of interest, the latter moves toward the former; it moves directly away from it if the quantity of food available to the selected jellyfish (j) is lower than that available to the jellyfish of interest (i). Consequently, each jellyfish in a swarm moves toward a better location to find food. Equations (6), (7) and (8) simulate the direction of motion and the updated location of a jellyfish39, respectively. This movement is considered to be effective exploitation of the local search space.

where \(f\) is an objective function of location X.

The ocean current contains large amounts of nutritious food so jellyfish are attracted to it43. Over time, more jellyfish gather together and a swarm is formed. When the temperature or wind changes the ocean current, the jellyfish in the swarm move toward another ocean current, and another jellyfish swarm is formed. The movements of jellyfish inside a jellyfish swarm are type A (passive motions) and type B (active motions), between which the jellyfish switch. Type A is favored in the beginning; as time goes by, type B becomes more favored39.

The time control mechanism is introduced to simulate this situation. To regulate the movement of jellyfish between following the ocean current and moving inside the jellyfish swarm, the time control mechanism includes a time control function \(\mathrm{c}\left(t\right)\) and a constant \({\mathrm{c}}_{o}\). The time control function is a random value that fluctuates from zero to unity over time. Equation (9)39 provides the time control function over time; when its value exceeds \({\mathrm{c}}_{o}\), the jellyfish follow the ocean current. When its value is less than \({\mathrm{c}}_{o}\), they move inside the swarm. An exact \({\mathrm{c}}_{o}\) value is not known and the time control varies randomly from zero to one. Hence, \({\mathrm{c}}_{o}\) is set to 0.5, which is the mean of zero and one.

where \(\mathrm{c}\left(t\right)\) is the time control function;\({\mathrm{c}}_{o}\) is a constant that is set to 0.5;\(t\) is the time that is specified by the iteration number, and \({\text{Maxiter}}\) denotes the maximum number of iterations, which is an initialized parameter.

The term \(\left(\text{1-c}\left(t\right)\right)\) is used to simulate the movement inside a swarm (type A or B)39. When \(rand\left(\text{0,1}\right)\) exceeds \(\left(\text{1-c}\left(t\right)\right)\), the jellyfish exhibits type A motion. When \(rand\left(\text{0,1}\right)\) is lower than \(\left(\text{1-c}\left(t\right)\right)\), the jellyfish exhibits type B motion. Since \(\left(\text{1-c}\left(t\right)\right)\) increases from zero to one over time, the probability that \(rand\left(\text{0,1}\right)>\left(\text{1-c}\left(t\right)\right)\) initially exceeds the probability that \(rand\left(\text{0,1}\right)<\left(\text{1-c}\left(t\right)\right)\). Therefore, type A motion is preferred to type B. As time goes by, \(\left(\text{1-c}\left(t\right)\right)\) approaches one, and the probability that \(rand\left(\text{0,1}\right)<\left(\text{1-c}\left(t\right)\right)\) ultimately exceeds the probability that \(rand\left(\text{0,1}\right)>\left(\text{1-c}\left(t\right)\right)\). So, type B motion is favored.

Oceans are located around the world. The earth is approximately spherical, so when a jellyfish moves outside the bounded search area, it will return to the opposite bound Eq. (10) presents this re-entering process39.

where,\({\text{X}}_{i\text{,d}}\) is the location of the ith jellyfish in the dth dimension;\({\text{X}}_{i\text{,d}}^{^{\prime}}\) is the updated location after the boundary constraints have been applied, and \({\text{U}}_{\text{b,d}}\) and \({\text{L}}_{\text{b,d}}\) are the upper bound and lower bound in the dth dimension of the search space, respectively.

The jellyfish search optimizer (JSO) is one of the newest swarm intelligence algorithms; it is inspired by the behavior of jellyfish in the ocean. JSO converges more rapidly and has a stronger search ability than classic optimization methods with few algorithmic parameters. Furthermore, JSO maintains a better balance between exploration and exploitation than other algorithms. Maintaining a balance between the exploration and exploitation of a search space greatly influences the performance of an algorithm. Exploration refers to visiting entirely new regions within the search space. Exploitation refers to visiting those regions of a search space within the neighborhood of previously visited points. JSO can also be used in conjunction with other artificial intelligence (AI)-related techniques.

JSO has been shown to be efficient in solving numerous standard benchmark problems and to have both constrained and unconstrained real-world applications. However, JSO has some minor shortcomings. The algorithm may sometimes become stuck in local optima, suffer from premature convergence52, or take a long time to converge55. Therefore, it has room for improvement. Necessary improvements can be made by regulating the exploration and exploitation search, preserving the diversity of its search, and accelerating convergence. The following section introduces JSO variants that have been proposed in the literature with improved optimization performance.

The literature includes variants or enhancements of JSO, hybridization, and multi‑objective versions of JSO, as shown in Fig. 4. This section will present an overview of these variants of JSO.

JSO enhancement and its variants.

Table 1 presents the enhancements of the JSO variants in recent studies with respect to population diversity, exploration, exploitation, boundary handling, and the time control mechanism. This subsection briefly describes the intelligent agents that have been proposed.

Bio-inspired optimization algorithms are sometimes enhanced to improve on one or more processes such as those associated with the algorithm parameters. Rajpurohit and Sharma56 proposed a chaotic active swarm method (CASM) for initializing the population in JSO. They tested seven chaotic maps (logistic map, circle map, Kent map, piecewise map, sine map, sinusoidal map and tent map) and compared them on benchmark functions and classical constrained engineering design problems. These chaotic maps are implemented to modify the active swarm motion step of the original JSO algorithm. The analysis of the results suggests that the sinusoidal map outperforms all the other chaotic maps that are adopted in JSO to increase population diversity.

In the early stages of the search process, the mean of the jellyfish swarm moves toward the location of the current best jellyfish of the swarm. This situation may lead to undesirable premature convergence in the early stages of the search because the swarm probably does not comprise high-quality jellyfish. To address this issue and to improve the exploration capacity of the original JSO, a quantum-based update rule named quantum JSO (QJSO) was proposed by Kaveh et al.52, based on quantum theory for use in the exploration phase of the classical JSO.

The QJSO involves the quantum-based update rule, which is applied to encourage diversification in the search space. The local attractor of each jellyfish of the swarm is determined using Eq. (11)52:

where \({\mathbf{X}}_{i\text{,d}}^{t}(t)\) is the local attractor of the ith jellyfish of the swarm;\({\mathbf{X}}_{i\text{,d}}({\text{t}})\) is the current location of the ith jellyfish in the swarm; \({\mathbf{X}}_{\mathrm{d}}^{\text{best}}\) is the best jellyfish identified so far, and rand1 is a random number that is uniformly distributed on (0, 1). Equation (11) indicates that \({\mathbf{X}}_{i\text{,d}}\left({\text{t}}\right),\) the local attractor of the ith jellyfish, lies on the line that connects \({\mathbf{X}}_{i\text{,d}}({\text{t}})\) and \({\mathbf{X}}_{\mathrm{d}}^{\text{best}}\) so that it moves following \({\mathbf{X}}_{i\text{,d}}({\text{t}})\) and \({\mathbf{X}}_{\mathrm{d}}^{\text{best}}.\)

The location of each jellyfish is updated according to Eqs. (12) and (13)52.

\({\mathbf{X}}_{i\text{,d}}({\text{t}}+ \text{1} )\) represents the new location; \({\mathbf{X}}_{i\text{,d}}^{t}(t)\) is the current location of the ith jellyfish; rand2 and rand3 are random numbers that are uniformly distributed in (0, 1); \(randi\)(1, 2) generates uniformly distributed random integers in (1, 2); \({\upmu}_{\mathrm{d}}\) is the mean location of all jellyfish of the swarm, and \(\beta (t)\) controls the convergence of the jellyfish toward the best location that has been identified so far.

In the original JSO, distribution coefficient β was used in the global exploration phase of following the ocean current (Eq. (2)). Chou and Truong39 recommended setting β = 3, which achieves very promising results. The distribution coefficient β influences the degree of diversity of the population that is used to determine a new jellyfish position. A higher β means the new position is farther from the current best position. Naturally, when the diversity of the population is small, a higher β helps to generate new positions at a greater distance from the best solution. Bujok53 proposed an enhancement to this dynamic diversity control that uses a transformed adaptation of the distribution coefficient (\(\beta\)) during the search, based on the current diversity of the jellyfish population, which is estimated using Eq. (14)53:

where D represents the dimensionality of the problem; N is the population size; \({\mathbf{X}}_{ij}\) is the location of jellyfish (i) at dimension (j); and \({\upmu}\) is the mean location of all jellyfish of the swarm.

Bujok further used an eigen transformation-method to improve the diversity of population. The eigen-transformation in JSO is controlled by two parameters—the proportion of individuals that are chosen from the current population and used to calculate the covariance matrix and the pseudo-spectrum that is obtained using the eigenvector method. The former controls the proportion of the population N that is used to compute eigenvector B in Eq. (15)53 .

where \({\textbf{C}}\) is the covariance matrix of the selected part of the population; \({\varvec{B}}\) is the eigenvector and \({\text{D}}\) is the eigenvalue. Then, the eigenvectors are employed to transform the original coordinates of the selected individual.

In each JSO generation, either the original coordinate system or the new eigen-transformed coordinate system is applied, as determined by the second control parameter, the pseudo-spectrum, using the eigenvector method. If rand < pseig, then the eigen transformation is applied to the whole generation and several subsequent steps of JSO are affected by this transformation53. In the following ocean current phase (Eq. (4)), when the new position \({\mathbf{X}}_{i}({\text{t}}+ \text{1} )\) is computed, all three individual positions, \({\text{X}}_{i}(t)\), \({\mathbf{X}}^{*}\) and the average population vector, are transformed using the eigen-transformation that is given by Eq. (16)53. Similarly, in the active motion phase, the eigen-transformation is applied.

After the position-updating rule is implemented, the position (\({{\mathbf{X}}^{^{\prime}}}_{i}\)) is transformed from the eigen coordinate system back to the original coordinate system using Eq. (17)53.

Lastly, Bujok53 proposed the archiving of good old positions for use in subsequent generations to prevent getting sticking around the local optima and to improve the exploration capacity. The idea of the archive is very simple. Archive A is introduced as empty, and in every selection step, when the current and new jellyfish positions are compared, the old (current) solution is added to A if the new position is better \(\left(f\left({\mathrm{x}}_{i+ \text{1} }\text{)>}f( \, {\text{x}}_{i}\right)\right)\). When an archive of size N has been filled, the newly added old good solution randomly replaces one previously added. Notably, the storage of positions in A is assumed to occur in all three phases of JSO. Positions in A is used only in the following ocean current phase (Eq. (4)) to compute the average coordinates of the jellyfish population.

In the newly proposed JSO variant, the average vector is computed from the union of population N and archive A. Doing so reduces the speed of convergence (older good positions are used) but increases the probability of avoiding a local solution area, as formulated in Eq. (18)53.

where \({\mathbf{X}}_{i+ \text{1} }\) is the new position of the jellyfish; \({\mathbf{X}}_{i}\) is the current position of the jellyfish;\({\mathbf{X}}_{\text{best}}\) is the position of the current best jellyfish in the swarm; N is swarm size, and \(\beta\) is the distribution coefficient (\(\beta\) > 0, \(\beta\) = 3).

The JSO search process is effective for exploration because the search pattern is sufficiently random for it. However, it sometimes works poorly for exploitation and so provides poor convergence. The search equation of the original JSO is based on a random selection of a solution vector from the current population that is combined randomly with the current solution vector in order to generate a new candidate solution vector. However, this search strategy is inefficient because one solution vector may contain good information on some dimensions while the other one may contain good information on other dimensions. Hence, some new JSO variants have been proposed.

Manita and Zermani54 proposed a modified version of the jellyfish search optimizer that is known as the orthogonal learning jellyfish search optimizer (OLJSO) to solve global optimization problems. The purpose of the proposed algorithm is to increase the exploitation ability of the JSO algorithm. The original JSO can be updated as OLJSO with an orthogonal learning strategy. This strategy is based on the orthogonal learning design (OLD) concept and addresses particularly the exploitation capability. The orthogonal learning design (OLD) finds the best candidate solution by testing only a few representative combinations from the search space.

The main idea behind this method of OLD is to use the properties of the fractional experiment to determine the best sequence of levels. Based on the orthogonal design, (M + 1) offspring (solutions) are generated and these are regarded as the new search mechanism. The purpose of this procedure is to improve the exploitation capacity of the original JSO algorithm. This new strategy begins with two candidate solutions. The first one is randomly selected from the current population. The other one will be generated as given by Eq. (19)54.

where,\({\mathbf{X}}_{i}\) is the new location of a jellyfish; \({\mathbf{X}}_{a}\), \({\mathbf{X}}_{b}\) and \({\mathbf{X}}_{c}\) are randomly chosen locations that are determined by the population size (NP), \(i\in\){1, 2,…, NP}, a, b, c \(\in\) {1, 2,…, NP}. The experimental results reveal that the proposed algorithm strongly outperforms the original algorithm in all respects, except for execution time.

Abdel-Basset et al.55 presented an improved version of JSO (IJSO) by integrating a novel method called the premature convergence strategy (PCS), to promote exploitation in search space and address the parameter extraction problem of photovoltaic (PV) models that are based on a single diode model (SDM) and a double diode model (DDM). This method works by preserving diversity among the members of the population while accelerating convergence toward the best solution based on two motions of the particles, which are as follows: (i) moving the current solution between two particles that are selected randomly from the population, and (ii) identifying the better of the best-so-far solution and a random solution from the population. These two motions are managed using a weight variable (a control variable) that is generated randomly in the range (0, 1). When the weight variable has a large value, the relative motion of two selected randomly particles is large, but if it is small, then the premature convergence method attends to the area between the best-so-far and the randomly selected solution.

The proposed PCS method improves the ability of the algorithm to exploit the best-so-far solution when the weight variable r is small and improves exploration around the particles to reach other regions when r is high. Mathematically, the premature convergence method is formulated as Eq. (20)55:

where r1, r2, and r3 are the indices of three solutions that are picked randomly from the population, and r is the control parameter and is a random number between (0, 1) that is used to control the motion of the current solution. If it is small, then the current solution moves to a location between the best-so-far and \({\mathbf{X}}_{{r}_{3}}(t)\) to accelerate convergence; if it is high, then the current solution is updated based on two randomly selected solutions from the population to improve the ability of the algorithm to reach other regions. This method is then combined with JSO to modify its performance to find better solutions in fewer iterations than the original JSO. Numerical simulations and results confirm the dominance of the proposed algorithm in terms of the accuracy and the rate of convergence.

Kaveh et al.52 proposed QJSO, to enhance the exploitation capability of the original JSO and accelerate its convergence without loss of diversity. The jellyfish exhibit passive (type A) motion around the location of the best jellyfish found so far, as follows52.

where \({\mathbf{X}}_{i}(t)\) is the current location of the jellyfish;\({\mathbf{X}}^{\text{best}}\) is the location of the best jellyfish found so far; and randi [1,2] returns a pseudorandom scalar integer in (1, 2). The term randi ([1,2]) allows exploration of the whole neighborhood of the best jellyfish found so far. Numerical results confirm that the proposed QJSO considerably outperforms the original JSO and has superior or comparable performance to those of other state-of-the-art optimization algorithms.

Following ocean currents encourages diversification in the search space (global exploration), while exploitation of the search involves passive and active motions inside jellyfish swarms. Thus, the classical JSO seems to suffer from a lack of global exploration of the search space, focusing mainly on local exploitation of the best solutions found. In the quantum jellyfish search optimizer (QJSO), proposed by Kaveh et al.52, a better balance between diversification and intensification of the search process is achieved using a proposed simple linear time control mechanism as follows52.

Such a deterministic time control mechanism results in a simple trade-off between intensification and diversification during the search.

Truong and Chou47 proposed a fuzzy adaptive time control mechanism to improve exploration and exploitation during the movement of the jellyfish, where the ocean current rate (OCR) and the jellyfish swarm rate (JSR) are inputs and the output is bar movement bar(t). The bar(t) is used to tune the time control function c(t), according to the following equation47.

where c(t − 1) is a time control function at time (t − 1) and c(0) = 0.5.

In the classical JSO, if a solution exceeds the boundary of the search space, then the boundary handling mechanism of Eq. (10) brings it back to the opposite bound. Such a boundary handling mechanism may cause difficulties in the convergence process. Indeed, optimal solutions often lie close to (or even on) the boundary of the search space39. Thus, during the optimization process, especially in its final stages, many solutions, which are probably close to optimal, are likely to move beyond the boundaries of the search space. However, the boundary handling mechanism of Eq. (10) significantly alters the values of the design variables fall outside their corresponding bounds.

As a consequence of this boundary handling mechanism, some potentially good solutions, which fall slightly beyond the boundary of the search space, may be lost during the search process. QJSO, proposed by Kaveh et al.52, addresses this issue. The boundary handling mechanism of the original JSO that brings solutions back to the violated bound when they fall outside the boundary of the search space is updated using Eq. (24)52:

where \({\mathbf{X}}_{i\text{,d}}^{^{\prime}}\) is the updated position of the jellyfish i with d dimensions of decision variables, and \({\mathbf{U}}_{\text{b, d}}\) and \({\mathbf{L}}_{\text{b, d}}\) are the upper and lower bounds, respectively.

Shaheen et al.57 proposed the optimization of combined heat and power economic dispatch (CHPED) using a novel amalgamated heap-based and jellyfish optimizer (AHJFO). They improved the efficiency of two newly developed techniques, the heap-based optimizer (HBO) and JSO. Their proposed AHJFO incorporates an adjustment strategy function (ASF) to improve exploration in a few iterations by improving solutions that are generated using HBO. Further, as the iterations proceed, exploitation is improved by updating the solutions that are generated using JSO. The proposed AHJFO is more effective than HBO and JSO in solving the CHPED problem for medium-sized 24 unit and large 96-unit systems. Simulation results reveal the superiority of the proposed AHJFO over HBO, JSO, and other algorithms in solving CHPED problems.

Ginidi et al.58 proposed a heap-based jellyfish search optimizer (HBJSO) to enhance the performance of two recently developed algorithms: the heap-based optimizer (HBO) and JSO. The proposed hybrid HBJSO seeks to make use of the explorative features of HBO and the exploitative features of JSO to overcome some of the issues associated with their standard forms. The proposed hybrid HBJSO, HBO, and JSO were validated and statistically compared by using them to solve a real-world optimization problem of combined heat and power economic dispatch in electrical grids. The proposed hybrid HBJSO, HBO, and JSO were applied to two medium-sized systems of 24 and 48 units, and two large systems of 84- and 96-units. The experimental results demonstrated that the proposed hybrid HBJSO outperforms the standard HBO and JSO and other reported techniques in power economic dispatch.

Rajpurohit and Sharma59 proposed a hybrid metaheuristic (jellyfish search optimizer (JSO) and sine–cosine algorithm (SCA)) algorithm that combines the advantages of both constituents algorithms and outperforms them. They first used opposition-based learning in population initialization and then introduced a modified position update operator of the SCA into the original structure of JSO. They tested their proposed hybrid metaheuristic (JSO-SCA) on a set of benchmark functions to find the minimum weight design of a transmission tower, and it outperformed both JSO and SCA.

Utama et al.60 proposed the hybrid-jellyfish (HJF) algorithm which combines JSO and the neighborhood exchange strategy. HJF has five major stages: (1) initializing the position of the jellyfish swarm and ocean currents; (2) updating position based on jellyfish movement; (3) applying the time control mechanism; (4) applying the rules of large rank value; and (5) improving solutions based on neighborhood exchange procedures. Their proposed algorithm was used to solve the fuel consumption capacity vehicle routing problem (FCCVRP) and numerical results indicate that it effectively reduces the total cost of fuel.

Lei et al.61 proposed an enhanced algorithm, known as the fractional-order modified strategy and Gaussian mutation mechanism jellyfish search optimizer (FOGJSO). The fractional-order modified strategy and Gaussian mutation mechanism are integrated with the original JSO to electively enhance the convergence precision tracking performance of the original JSO. The proposed algorithm outperforms various classical methods on IEEE Congress on Evolutionary Computation (CEC) 2017 and CEC 2019 test functions with respect to accuracy, stability, and convergence acceleration.

Chou and Truong46 developed the multi-objective jellyfish search (MOJS) optimizer to solve engineering problems. MOJS integrates Lévy flight, an elite population, a fixed-size archive, a chaotic map, and the opposition-based jumping method to obtain Pareto-optimal solutions. These techniques are employed to define the motions of jellyfish in an ocean current or a swarm in multi-objective search spaces. They tested their proposed algorithm on 20 multi-objective mathematical benchmark problems and compared it with six well-known metaheuristic optimization algorithms such as MOALO (multi-objective antlion optimization), MOGWO (multi-objective grey wolf optimization), and MOPSO (multi-objective particle swarm optimization). They used MOJS to solve three constrained structural problems (25, 160, and 942-bar tower design) to minimize structural weight and maximum allowable nodal deflection. The results thus obtained indicate that the MOJS algorithm finds highly accurate approximations to Pareto-optimal fronts with a uniform distribution of solutions for the test functions. The advantages of using MOJS in solving real engineering problems and finding the best Pareto-optimal fronts are thus demonstrated.

Shaheen et al.62 proposed an enhanced multi-objective quasi-reflected JSO (MOQRJSO) for solving multi-dimensional optimal power flow (MDOPF) problems. They made the following two modifications to the standard JSO algorithm. (1) A cluster of a random size that represents the social community was proposed. Data are shared in the cluster and (2) quasi-opposition-based learning is incorporated into JSO to support the exploration phase. A fuzzy decision-making strategy is integrated into MOQRJSO to select the best solutions. The concept of Pareto optimality is used to extract the non-dominated solutions. The superiority of the MOQRJSO was proved by its application to an IEEE 30-bus system, an IEEE 57-bus system, the West Delta Region System of 52 buses (WDRS-52) in Egypt, and a large 118-bus system. The outcomes achieved using the proposed MOQRJSO were compared with those achieved using the conventional MOJS algorithm and other techniques in the literature. MOQRJSO yields lower fuel costs and power losses than those other techniques revealing its robustness, effectiveness, and superiority in handling MDOPF problems.

This section focuses on the use of jellyfish search optimizer (JSO) in engineering optimization, prediction and classification, and the algorithmic fine-tuning of artificial intelligence.

The jellyfish search optimizer (JSO) has been used in various engineering fields, such as power systems and energy generation, communication and networking, and civil and construction engineering as detailed below.

This section examines the uses of JSO in power systems and energy-related fields. Rai and Verma63 used JSO to find the economic load dispatch of generating units, considering transmission losses. The effectiveness of the proposed method was evaluated by testing it on six systems under various loads. It was compared with the lambda-iterative and PSO algorithms to find the most efficient among them. JSO yielded the lowest fuel cost and transmission losses of the compared methods.

Tiwari et al.64 used JSO to analyze the effect of the installation of distributed generation (DG) and a capacitor bank (CB) on a radial distribution system (RDS). They carried out a cost-based analysis that considered the major expenses that are incurred due to the installation, operation, and maintenance of DG and CB units. They tested JSO on the IEEE 33-bus RDS. The results of their simulation were compared with those of simulations of other methods in the literature. JSO outperformed these other methods in terms of both power loss minimization and profit maximization.

Farhat et al.65 used JSO to propose a power flow model that included three types of energy sources, which were thermal power generators representing conventional energy sources, wind power generators (WPGs), and solar photovoltaic generators (SPGs). They used a modified IEEE 30-bus test system to determine its feasibility. To examine the effectiveness of the proposed power flow model, the results of its simulation were compared with the results of simulations of four other nature-inspired global optimization algorithms. The results established the effectiveness of JSO in solving the optimal power flow (OPF) problem with respect to both minimization of total generation cost and solution convergence.

Shaheen et al.66 introduced an efficient and robust technique that used JSO for optimal Volt/VAr coordination based on a joint distribution system reconfiguration (DSR)with the integration of distributed generation units (DGs) and the operation of distribution static VAr compensators (SVCs). JSO yielded the best solution and a comparison of the proposed JSO with similar approaches demonstrated its usefulness in modern control centers.

Alam et al.67 used JSO to track the global maximum power point (GMPP) of the solar photovoltaic (PV) module under partial shading conditions. Their results suggested that the JSO method has good tracking speed and accuracy. They also found that the JSO strategy tracks the GMPP in half of the time that is taken by the PSO algorithm under both uniform and shaded conditions.

Boutasseta et al.68 used the JSO technique to modify the voltage of a photovoltaic array using a boost direct current to direct current (DC–DC) converter. Their experimental results revealed that JSO performs well under both normal and disturbed operating conditions.

Abdulnasser et al.69 used JSO for the optimal sizing and placement of DGs and capacitor banks (CBs). To elucidate the efficiency of the proposed algorithm, they considered various cases; the allocation of CBs only, the allocation of DGs only, and the allocation of both CBs and DGs. The results thus obtained reveal that the JSO delivered the best results with respect to technical, economic, and emission objectives.

Ngo70 used JSO to solve the economic dispatch problem and to reduce costs and fuel consumption in power systems. To verify the feasibility and the effectiveness of the proposed scheme, they conducted two case studies to test the optimization performance of the proposed method from multiple economic perspectives. The validation results reveal that the proposed scheme provided more speed, convergence, and robustness than the methods to which it was compared.

Nusair et al.71 used JSO and other recently developed algorithms (slime mould algorithm (SMA), artificial ecosystem-based optimization (AEO), and marine predators algorithm (MPA)) to solve both multi- and single-OPF objective problems for a power network that incorporate flexible alternating current transmission system (FACTS) and stochastic renewable energy sources. They compared these algorithms to commonly available alternatives in the literature such as PSO, moth flame optimization (MFO), and grey wolf optimization (GWO), using an IEEE 30-bus test system. Their results reveal that JSO and other recently presented algorithms (MPA, SMA, and AEO) are more effective than PSO, GWO, and MFO in solving OPF problems.

Eid72 used JSO to allocate distributed generators (DG) and shunt capacitor (SC) banks optimally in distribution systems. He found JSO to be practical and effective in solving such nonlinear optimization problems, yielding better results than other algorithms in the literature. Huang and Lin73 used an improved jellyfish search optimizer (IJSO) to track the maximum power point (MPPT) under partial shade conditions. Their results showed that IJSO can accurately track the global maximum power point, and that it converged more quickly than an improved particle swarm optimization (IPSO) algorithm.

Shaheen et al.57 integrated a novel amalgamated heap-based agent with jellyfish optimizer (AHJFO) to optimize combined heat and power economic dispatch (CHPED). They improved the efficiency of two newly developed techniques: the heap-based optimizer (HBO) and JSO. AHJFO incorporates an adjustment strategy function (ASF) to improve exploration in a few iterations by improving the solutions that are generated using HBO. As the iterations proceed, exploitation is improved by updating solutions that are generated using JSO. AHJFO is more effective than HBO and JSO in solving the CHPED problem for medium-sized 24-unit and large 96-unit systems. Simulation results reveal the superiority of the proposed AHJFO over HBO, JSO and other algorithms for solving the CHPED problems.

Ginidi et al.58 proposed an innovative hybrid heap-based JSO (HBJSO) to improve upon the performance of two recently developed algorithms: the heap-based optimizer (HBO) and JSO. HBJSO uses the explorative features of HBO and the exploitative features of JSO to overcome some of the weaknesses of these algorithms in their standard forms. HBJSO, HBO, and JSO were validated and statistically compared by using them to solve a real-world optimization problem of combined heat and power (CHP) economic dispatch. HBJSO, HBO, and JSO were applied to two medium-sized 24-unit and 48-unit systems, and two large 84 unit and 96-unit systems. The experimental results demonstrate that the proposed hybrid HBJSO outperforms the standard HBO, JSO and other reported techniques when, applied to CHP economic dispatch.

Shaheen et al.74 proposed an enhanced quasi-reflection jellyfish optimization (QRJFO) algorithm for solving the optimal power flow problem. Fuel costs, transmission losses and pollutant emissions were considered as multi-objective functions. The performance of the proposed QRJFO algorithm was evaluated on the IEEE 57-bus, the practical West Delta Region system and a large IEEE 118-bus. Simulation results demonstrate the quality of the solutions and resilience of QRJFO.

Boriratrit et al.75 used jellyfish search extreme learning machine (JS-ELM), the Harris hawk extreme learning machine (HH-ELM), and the flower pollination extreme learning machine (FP-ELM) to increase accuracy and reduce overfitting in electric energy demand forecasting. Their results show that the JS-ELM provided a better minimum root mean square error than the state-of-the-art forecasting models.

Ali et al.76 presented an effective optimal sizing technique for a hybrid micro-grid using JSO. Their proposed sizing approach considers uncertainty associated with hybrid renewable resources. They investigated several operating scenarios to evaluate the effectiveness of the proposed approach and compared it to various optimization techniques. Their results demonstrate the applicability of JSO to their problem of interest.

Rai and Verma77 used JSO to solve a combined economic emission problem for an isolated micro-grid. They conducted tests on this micro-grid system, comprising traditional generators and renewable energy sources in two scenarios. They compared the results with those obtained using available algorithms to prove that the JSO algorithm was more effective than the others.

Yuan et al.78 used the improved jellyfish search optimizer and support vector regression (IJSO-SVR) to solve the problems of grid connection and power dispatching that are caused by non stationary wind power output. IJSO exhibits good convergence ability, search stability, and optimum-seeking ability, and it is more effective than conventional methods in solving optimization problems. The IJSO-SVR model outperformed other models in the literature and presents a more economical and effective means of optimizing wind power generation to solve problems with its uncertainty and can be used in grid power generation planning and power system economic dispatch.

Chou et al.79 used JSO and convolutional neural networks (CNNs) to evaluate the power generation capacity of plant microbial fuel cells (PMFCs) on building rooftops. Their results demonstrate the superior performance of JSO-optimized deep CNNs in learning image features and their consequent suitability for constructing models for estimating power generation by PMFCs.

This section investigates the use of JSO in the field of communication and networking. Selvakumar and Manivannan80 used JSO to overcome the shortcomings of defragmentation in networking, and to improve the quality of network services. The proposed combination of proactive/reactive defragmentation approach and JSO (PR-DF-JSO) outperformed state-of-the-art spectrum defragmentation algorithms in terms of spectrum utilization, network efficiency, and quality of service offered based on the results of experiments and standard quality metrics. Specifically, lower spectrum fragmentation complexity, a better bandwidth fragmentation ratio, and less overall connection blocking were achieved.

Durmus et al.81 used swarm-based metaheuristic algorithms JSO, PSO, artificial bee colony (ABC), and the mayfly algorithm (MA), to determine the optimal design of linear antenna arrays. They conducted extensive experiments on the design of 10-, 16-, 24- and 32-element linear arrays and determined the amplitude and the positions of the antennas. They performed each of their experiments 30 times owing to the randomness of swarm-based optimizers, and their statistical results revealed that the novel algorithms JSO and MA outperformed the well-known PSO and ABC methods.

Aravind and Maddikunta82 proposed a novel optimal route selection model for use with the internet of things (IoT) in the field of healthcare that was based on an optimized adaptive neuro-fuzzy inference system (ANFIS). They selected optimal routes for medical data using a new self-adaptive jellyfish search optimizer (SA-JSO) that was an enhanced version of the original JSO algorithm39. Their model outperformed others.

Structural optimization has become one of the most important and challenging branches of structural engineering, and it has consequently received considerable attention in the last few decades83. Chou and Truong39 developed JSO, motivated by the behavior of jellyfish in the ocean for use in civil and construction engineering. They used JSO to solve structural optimization problems, including 25, 52, and 582-bar tower designs. Their results showed that JSO not only performed best but also required the fewest evaluations of objective functions. Therefore, JSO is potentially an excellent metaheuristic algorithm for solving structural optimization problems.

Chou and Truong46 expanded the framework of the single-objective jellyfish search (SOJS) algorithm to a multi-objective jellyfish search optimizer (MOJS) for solving engineering problems with multiple objectives. MOJS integrates Lévy flight, an elite population, a fixed-size archive, a chaotic map, and the opposition-based jumping method to obtain Pareto-optimal solutions. Three constrained structural problems (25, 160, and 942-bar tower designs) of minimizing structural weight and maximum nodal deflection have been solved using the MOJS algorithm. MOJS is an effective and efficient algorithm for solving multi-objective optimization problems in civil and construction engineering.

Kaveh et al.52 proposed a quantum-based JSO, named Quantum JSO (QJSO), for solving structural optimization problems. QJSO is used to solve frequency-constrained large cyclic symmetric dome optimization problems. The results thus obtained reveal that QJSO outperforms the original JSO and has superior or comparable performance to that of other state-of-the-art optimization algorithms.

Rajpurohit and Sharma56 proposed an enhancement of JSO by the implementation of chaotic maps in population initialization. They applied their enhanced JSO to three classical constrained engineering design problems. Analysis of the results suggests that the sinusoidal map outperforms other chaotic maps in JSO and helps to find efficiently the minimum weight design of a transmission tower.

Ezzeldin et al.84 used JSO to develop optimal strategies for the sustainable management of saltwater intrusion into coastal aquifers based on the finite element method (FEM). They tested the effectiveness of JSO by applying it to a real aquifer system in Miami Beach to maximize its total economic benefit and total pumping rate. JSO has also been used in a case study of the El-Arish Rafah aquifer, Egypt, to maximize the total pumping rate. The results in both cases were compared to relevant results in the literature, revealing that the JSO is an effective and efficient management tool.

Chou et al.85 used JSO and convolutional neural networks (CNNs) to predict the compressive strength of ready-mixed concrete. Their analytical results reveal that computer vision-based CNNs outperform numerical data-based deep neural networks (DNNs). Thus, the bio-inspired optimization of computer vision-based convolutional neural networks has promise for predicting the compressive strength of ready-mixed concrete.

Chou et al.86 presented jellyfish search optimizer (JSO)-XGBoost and symbiotic organisms search (SOS)-XGBoost for forecasting the nominal shear capacity of reinforced concrete walls in buildings. Their proposed methods outperform the ACI provision equation and grid search optimization (GSO)-XGBoost in the literature. Thus, they can be used to improve building safety, simplify a cumbersome shear capacity calculation process, and reduce material costs. Their systematic approach also provides a general framework for quantifying the performance of various mechanical models and empirical formulas that are used in design standards.

Truong and Chou47 proposed a novel fuzzy adaptive jellyfish search optimizer (FAJSO) for use in the stacking system (SS) of machine learning. They integrated the JSO, the fuzzy adaptive (FA) logic controller, and stacking ensemble machine learning. Its application to construction productivity, the compressive strength of a masonry structure, the shear capacity of reinforced deep beams, the axial strength of steel tube confined concrete, and the resilient modulus of subgrade soils was investigated. Their results indicate that the FAJSO-SS outperformed other methods. Accordingly, their proposed fuzzy adaptive metaheuristic optimized stacking system is effective for providing engineering informatics in the planning and design phase.

Prediction and classification are required in a variety of areas that involve time series and cross-sectional data87, 88. This section concerns articles in which JSO has been used alone or integrated with machine/deep learning algorithms for prediction and classification.

Almodfer et al.89 employed a random vector functional link (RVFL) network that was optimized by JSO, AEO, MRFO, and SCA to predict the performance of a solar thermo-electric air-conditioning system (STEACS). Their results revealed that the RVFL-JSO outperformed the other algorithms in predicting all responses of the STEACS with a correlation coefficient of 0.948–0.999. They recommended its use for modeling STEACS systems.

Chou et al.90 used JSO to optimize the convolutional neural network (CNN) hyper-parameters to ensure the accuracy and stability of CNN in predicting power consumption. Their analytical results provide insights into the formulation of energy policy for management units and can help power supply agencies to distribute regional power in a way that minimizes unnecessary energy loss.

Barshandeh et al.91 utilized JSO and the marine predator algorithm (MPA) to develop a learning-automata (LA)-based hybrid algorithm for benchmark function optimization and solving data clustering problem. They applied the proposed algorithm to ten datasets and compared it with competing algorithms using various metrics; the hybrid algorithm outperformed. Desuky et al.92 used JSO to classify imbalanced and balanced datasets. They performed experiments on 18 real imbalanced datasets, and the proposed method performed comparably with well-known and recently developed techniques.

Chou and Truong88 tested JSO and other parameter-less algorithms (TLBO, SOS) by using them in the hyperparameters finetuning of least squares support vector regression (LSSVR) to develop a novel forecasting system. The linear time-series has been optimized using nonlinear machine learning models to identify historical patterns of regional energy consumption. Analytical results confirm that the proposed system, JSO-LSSVR, can predict multi-step-ahead energy consumption time series more accurately than can the linear model.

Chou et al.93 developed a weighted-feature least squares support vector regression (WFLSSVR) model that is optimized by JSO to predict the peak friction angle (shear strength) of fiber-reinforced soil (FRS), which is a popular material for use in building geotechnical structures. Their results showed that JSO-WFLSSVR outperformed baseline, ensemble, and hybrid machine learning models, as well as empirical methods in the literature. The JSO-WFLSSVR model is also effective for selecting features and can help geotechnical engineers to estimate the shear strength of FRS.

Hoang et al.94 implemented a support vector machine classifier that was optimized using JSO for the automatic classification of the severity of concrete spalling. It partitions input data into two classes, shallow spalling and deep spalling. Experimental results, supported by the Wilcoxon signed-rank test, reveal that the newly developed method is highly effective for classifying the severity of concrete spalling with an accuracy rate of 93.33%, an F1 score of 0.93, and an area under the receiver operating characteristic curve of 0.97.

Siddiqui et al.95 used JSO to calculate the optimum switching angle in the modulation range to eliminate desired lower-order harmonics in a multilevel inverter (MLI) voltage control application. The total harmonic distortion (THD) values of five-, seven-, and nine-level were computed using JSO and compared with those obtained using the powerful differential evolution (DE) algorithm. The results thus obtained clearly demonstrated that the output of an MLI in JSO exhibits THD that is superior to that in the output of DE for low and medium values of the modulation index.

Çetinkaya and Duran96 used JSO and other recently developed optimization algorithms [marine predators’ algorithm (MPA), tunicate swarm algorithm (TSA), mayfly optimization algorithm (MOA), chimp optimization algorithm (COA), slime mould optimization algorithm (SMOA), archimedes optimization algorithm (AOA), and equilibrium optimizer algorithm (EOA)] to improve the precision of the clustering-based segmentation of vessels. Simulation results of these algorithms exhibited similar convergence rates and error performances. Statistical analyses demonstrated that the stability and robustness of each metaheuristic approach sufficed to separate vessel pixels from the background pixels of a retinal image.

Wang and Gao97 used the multi-objective jellyfish search optimizer (MOJS) to determine the weights of kernel functions. According to their experimental result concerning three American solar sites, the proposed system that integrates with MOJS provided a higher interval coverage rate and a narrower interval width than those of other systems.

Zhao98 used single-objective JSO to classify brain function in human brain function parcellation. Experimental results show that that the new method not only has a greater searching ability than other partitioning methods, but also can obtain better spatial structures and stronger functional consistency.

Lei et al.61 proposed an enhanced algorithm, known as the fractional-order modified strategy and Gaussian mutation mechanism jellyfish search optimizer (FOGJSO), to predict rural resident income. They used FOGJSO to optimize the order of a discrete fractional time-delayed grey model for forecasting rural resident income. The results reveal that FOGJSO performed much better with respect to precision and convergence speed than did other methods.

Shubham et al.99 used JSO for clustering between a dish type stirling solar generator, a micro hydro turbine, a diesel generator, a flywheel energy storage device, a super magnetic energy storage device and an electric vehicle in a renewable energy based microgrid to stabilize the frequency and tie line power in the system. They compared the performance of the JSO based dual stage controller with those of the black widow optimization algorithm, GA and the PSO-based controller, with respect to overshoot, undershoot, settling time and figure of demerit. JSO outperformed other optimization algorithms when used to tune dual stage (1+PI)TID controller involving a microgrid-based electric vehicle.

Hyper-parameter optimization is essential to the development of efficient models in machine learning and deep learning algorithms, as well as for quality control in industrial production100, 101. JSO is an efficient and innovative algorithm that is used in hyper-parameter optimization.

Chou et al.102 used JSO to optimize the hyper-parameters of a deep learning model that is called residual network (ResNet) and is used to classify the deflection of reinforced concrete beams, based on observations made by computer vision. Their work supports an innovative method that engineers can use to measure the deflection of reinforced concrete beams. The results of their analysis revealed that the proposed ResNet model that was optimized by JSO was more accurate than conventional ResNet.

Dhevanandhini and Yamuna103 used JSO to find the optimal coefficients of a discrete wavelet transform (DWT) to improve efficient multiple-video watermarking. They analyzed the performance of the proposed method using various metrics and compared it with the DWT-based watermarking approach, which it outperformed.

Elkabbash et al.104 proposed a novel detection system that was based on optimizing the random vector functional link (RVFL) using JSO, following the dimensional reduction of Android application features. They used JSO to determine the optimal configurations of RVFL to improve classification performance. The optimized RVFL minimized the runtime of the models with the best performance metrics.

Gouda et al.105 employed JSO to solve the problem of evaluating the parameters of the polymer exchange membrane fuel cells (PEMFCs) model. The maximum percentage voltage-biased error was ± 1% in all test cases, indicating that JSO can solve this problem more effectively than other algorithms.

Youssef et al.106 used JSO to estimate the parameters of a single-phase power transformer from the current and voltage under any load. They consider difference between the estimated and actual values as the main objective function that must be minimized. Experimental results revealed that the parameters of the transformer equivalent circuit were accurately obtained, indicating that the algorithm can be used to estimate the parameters of a single-phase transformer.

Kızıloluk and Sert107 adopted JSO to optimize the hyper-parameters of the Alex Net CNN model for feature extraction in the Faster R-CNN-JSO model for the early detection of hurricanes from satellite images. The purpose was to alert people about upcoming disasters and thus minimize casualties and material losses. Their results demonstrated that hyper-parameter optimization increased the detection performance of the proposed approach by 10% over that of Alex Net without optimized hyper-parameters. The average precision of Hurricane-faster R-CNN-JS was 97.39%, which was remarkably higher than those of other approaches.

Bisht and Sikander108 used JSO to optimize the parameters of the solar photovoltaic (PV) model. They used JSO to optimize the parameters of a single-diode PV model using various performance measures, such as PV characteristics, power-voltage, and current-voltage curves, relative error (RE), root mean square error (RMSE), mean absolute error (MAE), and normalized mean absolute error (NMAE). Their proposed technique provided better results than other techniques, with a lower RE, RMSE, MAE, and NMAE; it also converged rapidly.

Azam et al.109 utilized JSO to dampen out low-frequency oscillations (LFOs) by tuning the critical parameters of conventional lead-lag type power system stabilizers. JSO is used to tune time-domain simulations of the angular frequency, rotor angle, and control signal. They tested this method on two separate multimachine networks that were exposed to a three-phase fault, and compared it with two well-known optimization algorithms, called PSO and the backtracking search algorithm (BSA). Their results show that JSO provided better damping power system ratio than did the other algorithms. Moreover, the JSO-based approach converged in fewer iterations.

Raja and Periasamy110 presented the block chain and JSO-based deep generative adversarial neural network (DGANN) method for the distributed routing scheme of a wireless sensor network (WSN). They used the block chain routing protocol to detect and store packets and to transfer them from the source to the destination efficiently to improve the security and efficiency of the DGANN method. They used JSO to optimize the weight parameters of the DGANN method. The simulation results demonstrate that in the routing of a WSN, DGANN with optimized parameters outperforms others methods, such as the multidimensional scaling-map, the trust-aware routing protocol through multiple attributes, and dynamic rate-aware classified key distributional secure routing algorithms.

Usharani et al.111 used JSO to optimize the hyperparameters of long short-term memory (LSTM) networks to enhance the error metrics of the approximate multiplier. They used their proposed pre-trained LSTM model to generate approximate design libraries for the different truncation levels as a function of area, delay, power and error metrics. Their experimental results on an 8-bit multiplier with an image processing application reveals that the proposed approximate computing multiplier achieved a superior area and power reduction with very good error rates.

Nyong-Bassey and Epemu112 used JSO and PSO to identify servomechanism parameters using a two-step approach, involving a first-order transfer function and iterative minimization of a fitness score that is derived from the root mean squared error between the experimental and simulated position responses of the servomechanism of an equivalent state-space model structure. The simulated angular position step responses of the servomechanism that runs the JSO and PSO algorithms showed very closely with each other, in terms of root mean squared error. Table 2 summarizes recent advances in the application of the jellyfish search optimizer.

This section presents the findings of this study in relation to the research goals, including recent trends in the use of JSO, potential enhancements in JSO, and JSO variants, which are comparatively analyzed.

This section compares recent research works on JSO and its variants in a variety of fields. JSO is a newly developed robust algorithm that has a good population utilization rate and maintains a favorable balance between exploration and exploitation. Optimization problems vary among fields and the No Free Lunch theorem specifies that a single algorithm cannot satisfactorily solve all such problems. The literature clearly reveals that JSO is being increasingly used since its source code was recently shared in the academic community. The use of JSO for optimization has attracted substantial interest since its initial development. However, the number of relevant works on MOJS was lower than that of the single objective JSO both with respect to theoretical frameworks and applications. Figure 5 presents the number of studies related to each area in which JSO is applied, where C & N = Communication and Networking; C & CE = Civil and Construction Engineering; PS & EG = Power System and Energy Generation; P & C = Prediction and Classification; and FAI = Finetuning of Artificial Intelligence.

Number of studies related to applications of JSO.

According to Table 3, JSO and its variants are mostly applied to solve problems that are related to (1) engineering optimization (56%), including in power system and energy generation, communication and networking, and civil and construction engineering; (2) prediction and classification (21%); and (3) the finetuning of artificial intelligence (23%). Despite the favorable performance of JSO in solving many standard benchmark functions, CEC functions, and real-world constrained and unconstrained problems, the algorithm has been seldom applied to communication networks, portfolio optimization in finance, civil engineering infrastructure operations, and multiobjective optimization problems. Such applications may provide great opportunities in decision making and engineering management.

JSO has been hybridized with other recently developed algorithms, such as the proactive and reactive defragmentation algorithm (PDRFA), the heap-based optimizer (HBO) and the convolutional neural network (CNN), to improve its performance and to optimize the hyper-parameters in machine and deep learning methods. However, JSO has not yet been hybridized with other optimization algorithms such as particle swarm optimization (PSO) or the artificial bee colony (ABC) algorithm, or with traditional techniques, such as dynamic programming, or other techniques, such as adaptive reinforcement learning.

JSO has been shown to be efficient in solving numerous standard benchmark problems and real-world constrained and unconstrained applications. JSO has a good population utilization rate and maintains a favorable balance between global and local searches. However, the exploration/exploitation ability and convergence speed of the algorithm can be improved. Accordingly, researchers have developed numerous enhanced versions of JSO by upgrading its original mechanisms with artificial intelligent agents. Numerous variants or enhancements have been made by developing theoretical supplements to achieve diverse objectives.

The preceding sections of this study reported on these refinements, which have concerned the updating mechanisms in the diversity of population, the boosting agents of exploration and exploitation, improvements in the distribution coefficient for global search, the time control mechanism, and the handling of boundary conditions. The improvements include the orthogonal learning JSO (OLJSO) with an orthogonal learning strategy, the premature convergence strategy (PCS), archives of good old, solutions (positions), dynamic diversity control, and the quantum-based update rule.

This section compares jellyfish search optimizer (JSO) with the different variants and hybrids of JSO that are applied in global optimization and real-world applications. The key features of each algorithm, the problems that are solved by it and its performance are considered. Table 4 exhibits a comparative analysis of variants of JSO. The JSO variants are comparable to, or better than, the classical JSO algorithm. Notably, the standard JSO shows better performance than some hybrid optimization algorithms, such as the proactive and reactive defragmentation-JSO algorithm (PRDA-JSO) and the spectrum defragmentation algorithm (SDA).

Research on JSO was reviewed. The underlying inspiration for JSO, its population initialization and boundary conditions, mathematical formulations of ocean currents and jellyfish swarms, time control mechanism, advantages and disadvantages, variants, and applications were thoroughly discussed. Analytical findings reveal that JSO is used in various disciplines, including power systems and energy generation, communication and networking, civil and construction engineering, prediction and classification, and fine-tuning of artificial intelligence.

Experimental research has established that JSO outperforms many nature-inspired algorithms, such as PSO, DE, AEO, MRFO, SCA, WOA, TLBO, ABC, and GA, in a variety of ways39. Some variants or enhancements have been made by considering the diversity of population, the updating mechanisms in exploration- or exploitation-oriented boosting, the population distribution, the time control mechanism, and the handling of boundary conditions.

Future work on JSO should consider the following: (1) Self-adaption: adaptive or self-adaptive algorithms are those that can self-tune their algorithm-specific and common control parameters. The algorithm-specific parameters in JSO include the number of iterations, population size, spatial distribution coefficients, and motion coefficients. Most relevant research has used trial-and-error experiments or sensitivity analyses to evaluate these algorithmic parameters, which are time-consuming. Accordingly, an adaptive version of JSO with the capacity to self-tune its algorithm-specific parameters is required. (2) Hybridization: in general, hybrid algorithms outperform stand-alone algorithms. Therefore, the hybridization of JSO with other conventional algorithms such as GA, PSO, ABE, DE, dynamic programming, and adaptive reinforcement learning, is a potential avenue for research. (3) Applications: JSO is currently utilized to solve a subset of complex optimization problems. More attempts to solve complicated optimization problems in the real world using JSO and its variants should be made to demonstrate the generalizability of JSO.

JSO yields competitive solutions to other complicated problems. Numerous ongoing studies have focused on minimizing the overall maintenance cost of buildings and roads, scheduling in civil and industrial engineering, and investment portfolio optimization problems in finance with limited constraints. JSO can be extended by hybridization in ways that depend on the problem to be solved. The findings in this review can therefore be used to promote future advances by considering the applications, advantages, and improvements of similar metaheuristic optimization algorithms thus developed. This work supports the theoretical framework of an enhanced version of JSO or other newly proposed optimizer that improves upon present and the original variants. It will also motivate researchers to develop novel bio-inspired metaheuristic optimization algorithms with tradeoff modifications.

The data that support this study are available from the corresponding author upon reasonable request.

Three-step in jellyfish search optimizer

Artificial bee colony

Adaptive neuro-fuzzy inference system

Artificial ecosystem optimizer

Amalgamated heap-based and jellyfish optimizer

Artificial hummingbird optimization technique

Artificial intelligence

Antlion optimization algorithm

Archimedes optimization algorithm

Adjustment strategy function

African vultures optimization algorithm

Backtracking search algorithm

Chaotic active swarm method-based jellyfish search optimizer

Capacitor bank

Chaos game optimization

Combined heat and power economic dispatch

Comprehensive learning marine predator algorithm

Convolutional neural network

Chimp optimization algorithm

Crisscross optimization and arithmetic optimization algorithm

Dynamic butterfly optimization algorithm

Direct current to direct current

Double diode model

Differential evolution

Distributed generation

Deep generative adversarial neural network

Dynamic group optimization

Dwarf mongoose optimization algorithm

Deep neural network

Distribution system reconfiguration

Discrete wavelet transform

Evolutionary local search

Equilibrium optimizer algorithm

Enhanced sparrow search algorithm

Enhanced shuffled shepherd optimization algorithm

Flexible alternating current transmission system

Fuzzy adaptive jellyfish search optimizer

Forensic-based investigation algorithm

Fuel consumption capacity vehicle routing problem

Finite element method

Fractional-order modified Harris hawk optimizer

Fractional-order and Gaussian mutation mechanism jellyfish search optimizer

Flower pollination algorithm

Flower pollination extreme learning machine

Fiber-reinforced soil

Genetic algorithm

Gradient-based optimizer

Global maximum power point

Giza pyramids construction

Grid search optimization

Gorilla troops optimizer

Group teaching optimization algorithm

Grey wolf optimizer

Heuristic-based approaches fragmentation aware

Heap-based and jellyfish search optimizer

Heap-based optimizer

Hunger games search

Harris hawk extreme learning machine


Harmonics multilevel inverter

Hybrid marine predator algorithm

High-performance cuckoo search algorithm

Hybrid salp swarm algorithm with teaching–learning-based optimization

Improved chimp optimization algorithm

Improved jellyfish search optimizer

Improved jellyfish search optimizer and support vector regression

Internet of things

Improved particle swarm optimization

Jellyfish search optimizer

Jellyfish search optimizer-XGBoost


Low-frequency oscillations

Lightning search algorithm

Least squares support vector regression

Multi-dimensional optimal power flow

Moth flame optimization

Modified jellyfish search optimizer

Modified manta ray foraging optimization algorithm

Mayfly optimization algorithm

Multi-objective ant lion optimizer

Multi-objective grey wolf optimization

Multi-objective jellyfish search

Multi-objective particle swarm optimization

Multi-objective quasi-reflected jellyfish search optimizer

Marine predators algorithm

Maximum power point track

Manta ray foraging optimization

Orthogonal learning design

Orthogonal learning jellyfish search optimizer

Optimal power flow

Premature convergence strategy

Polymer exchange membrane fuel cells

Plant microbial fuel cell

Proactive and reactive defragmentation

Proactive and reactive defragmentation algorithm

Particle swarm optimization

Partitioned step particle swarm optimization


Quantum jellyfish search optimizer

Radial distribution system

Random vector functional link

Self-adaptive jellyfish search optimizer

Smell agent optimization

Shunt capacitor

Sine cosine algorithm

Spectrum defragmentation algorithm

Single diode model

Slime mould algorithm

Starling murmuration optimizer

Seagull optimization algorithm

Single objective jellyfish search

Symbiotic organisms search

Symbiotic organisms search-XGBoost

Solar photovoltaic generator

Stacking system

Sparrow search algorithm

Solar thermoelectric air-conditioning system

Static var compensator

Total harmonic distortion

Teaching-learning-based optimization

Three-learning strategy particle swarm optimization

Tabu search

Tunicate swarm algorithm

West delta region system

Weighted-feature least squares support vector regression

Wild horse optimization algorithm

Whale optimization algorithm

Wind power generator

Wireless sensor network

War strategy optimization algorithm

Ayvaz, A. & Genc, I. A novel optimization method for wind power investment considering economic and security concerns. J. Renew. Sustain. Energy. 14, 016301. (2022).

Article Google Scholar

Chou, J.-S. & Truong, D.-N. Multiobjective forensic-based investigation algorithm for solving structural design problems. Autom. Constr. 134, 104084. (2022).

Article Google Scholar

Deb, S., Gao, X.-Z., Tammi, K., Kalita, K. & Mahanta, P. Recent studies on chicken swarm optimization algorithm: A review (2014–2018). Artif. Intell. Rev. 53, 1737–1765. (2019).

Article Google Scholar

Dsouza, A. K., Thammaiah, A. & Venkatesh, L. K. M. An intelligent management of power flow in the smart grid system using hybrid NPO-ATLA approach. Artif. Intell. Rev. (2022).

Article Google Scholar

Ginidi, A. R., Elsayed, A. M., Shaheen, A. M., Elattar, E. E. & El-Sehiemy, R. A. A novel heap-based optimizer for scheduling of large-scale combined heat and power economic dispatch. IEEE Access. 9, 83695–83708. (2021).

Article Google Scholar

Gharehchopogh, F. S., Shayanfar, H. & Gholizadeh, H. A comprehensive survey on symbiotic organisms search algorithms. Artif. Intell. Rev. 53, 2265-2312(3). (2019).

Article Google Scholar

Shaheen, A. M., Ginidi, A. R., El-Sehiemy, R. A. & Ghoneim, S. S. M. A forensic-based investigation algorithm for parameter extraction of solar cell models. IEEE Access. 9, 1–20. (2021).

Article Google Scholar

Chou, J.-S. & Nguyen, N.-M. FBI inspired meta-optimization. Appl. Soft Comput. 93, 106339. (2020).

Article Google Scholar

Abdel-Basset, M., Mohamed, R., Elkomy, O. M. & Abouhawwash, M. Recent metaheuristic algorithms with genetic operators for high-dimensional knapsack instances: A comparative study. Comput. Ind. Eng. 166, 107974 (2022).

Article Google Scholar

Sayed, G. I. A novel multilevel thresholding algorithm based on quantum computing for abdominal CT liver images. Evolut. Intell. (2021).

Article Google Scholar

Li, S., Chen, H., Wang, M., Heidari, A. A. & Mirjalili, S. Slime mould algorithm: A new method for stochastic optimization. Futur. Gener. Comput. Syst. 111, 300–323. (2020).

Article Google Scholar

Zhang, Y. & Chi, A. Group teaching optimization algorithm with information sharing for numerical optimization and engineering optimization. J. Intell. Manuf. (2021).

Article Google Scholar

Tang, R. et al. Dynamic group optimization algorithm with a mean–variance search framework. Expert Syst. Appl. 183, 115434. (2021).

Article Google Scholar

Abdollahzadeh, B., Gharehchopogh, F. S. & Mirjalili, S. African vultures optimization algorithm: A new nature-inspired metaheuristic algorithm for global optimization problems. Comput. Ind. Eng. 158, 107408. (2021).

Article Google Scholar

Hassan, M. H., Kamel, S., El-Dabah, M. A., Khurshaid, T. & Domínguez-García, J. L. Optimal reactive power dispatch with time-varying demand and renewable energy uncertainty using Rao-3 algorithm. IEEE Access. 9, 23264–23283. (2021).

Article Google Scholar

Ginidi, A. et al. Gorilla troops optimizer for electrically based single and double-diode models of solar photovoltaic systems. Sustainability. 13(16), 2071–1050. (2021).

Article Google Scholar

Salawudeen, A. T., Mu’azu, M. B., Yusuf, A. & Adedokun, A. E. A novel smell agent optimization (SAO): An extensive CEC study and engineering application. Knowl. Based Syst. 232, 107486 (2021).

Article Google Scholar

Sukpancharoen, S. Application of swarm intelligence for the multi-objective optimization of the thermodynamic performance and economic of double reheat steam power plants. TNI J. Eng. Technol. 9, 9–26 (2021).

Google Scholar

Shaheen, A., Elsayed, A., Ginidi, A., El-Sehiemy, R. & Elattar, E. Reconfiguration of electrical distribution network-based DG and capacitors allocations using artificial ecosystem optimizer: Practical case study. Alex. Eng. J. 61, 6105–6118. (2022).

Article Google Scholar

Zamani, H., Nadimi-Shahraki, M. H. & Gandomi, A. H. Starling murmuration optimizer: A novel bio-inspired algorithm for global and engineering optimization. Comput. Methods Appl. Mech. Eng. 392, 114616. (2022).

Article ADS MathSciNet MATH Google Scholar

Agushaka, J. O., Ezugwu, A. E. & Abualigah, L. Dwarf mongoose optimization algorithm. Comput. Methods Appl. Mech. Eng. 391, 114570. (2022).

Article ADS MathSciNet MATH Google Scholar

Ayyarao, T. L. V. et al. War strategy optimization algorithm: A new effective metaheuristic algorithm for global optimization. IEEE Access (2022).

Article Google Scholar

Tiwari, A. & Chaturvedi, A. A hybrid feature selection approach based on information theory and dynamic butterfly optimization algorithm for data classification. Expert Syst. Appl. 196, 116621. (2022).

Article Google Scholar

Hamida, M. A., El-Sehiemy, R. A., Ginidi, A. R., Elattar, E. & Shaheen, A. M. Parameter identification and state of charge estimation of Li-Ion batteries used in electric vehicles using artificial hummingbird optimizer. J. Energy Storage. 51, 104535. (2022).

Article Google Scholar

El Bakrawy, M. L. et al. A modified ant Lion optimization method and its application for instance reduction problem in balanced and imbalanced data. Axioms. 11, 95. (2022).

Article Google Scholar

Yousri, D. et al. Efficient fractional-order modified Harris hawks optimizer for proton exchange membrane fuel cell modeling. Eng. Appl. Artif. Intell. 100, 104193. (2021).

Article Google Scholar

Tang, A., Zhou, H., Han, T. & Xie, L. A modified Manta Ray foraging optimization for global optimization problems. IEEE Access. 9, 128702–128721. (2021).

Article Google Scholar

Liang, X., Wu, D., Liu, Y., He, M. & Sun, L. An enhanced slime mould algorithm and its application for digital IIR filter design. Discrete Dyn. Nat. Soc. (2021).

Article Google Scholar

Yousri, D., Fathy, A., Rezk, H., Babu, T. S. & Berber, M. R. A reliable approach for modeling the photovoltaic system under partial shading conditions using three diode model and hybrid marine predators-slime mould algorithm. Energy Convers. Manag. 243, 114269. (2021).

Article Google Scholar

Ocampo, E., Liu, C.-H. & Kuo, C.-C. Performance analysis of partitioned step particle swarm optimization in function evaluation. Appl. Sci. 11(6), 2670 (2021).

Article CAS Google Scholar

Abdel-Basset, M., Mohamed, R., El-Fergany, A., Chakrabortty, R. K. & Ryan, M. J. Adaptive and efficient optimization model for optimal parameters of proton exchange membrane fuel cells: A comprehensive analysis. Energy 233, 121096 (2021).

Article Google Scholar

Pham, L. H., Dinh, B. H., Nguyen, T. T. & Phan, V.-D. Optimal operation of wind-hydrothermal systems considering certainty and uncertainty of wind. Alexandria Eng. J. 60(6), 5431–5461 (2021).

Article Google Scholar

Yousri, D., Fathy, A. & Rezk, H. A new comprehensive learning marine predator algorithm for extracting the optimal parameters of supercapacitor model. J. Energy Storage. 42, 103035. (2021).

Article Google Scholar

Ma, B. et al. Enhanced sparrow search algorithm with mutation strategy for global optimization. IEEE Access. 9, 159218–159261. (2021).

Article Google Scholar

Zhang, X. & Lin, Q. Three-learning strategy particle swarm algorithm for global optimization problems. Inf. Sci. 593, 289–313. (2022).

Article Google Scholar

Kaveh, A. & Zaerreza, A. A new framework for reliability-based design optimization using metaheuristic algorithms. Structures. 38, 1210–1225. (2022).

Article Google Scholar

Kundu, T., Deepmala, & Jain, P. K. A hybrid salp swarm algorithm based on TLBO for reliability redundancy allocation problems. Appl. Intell. (2022).

Article Google Scholar

Hu, G., Zhong, J., Du, B. & Wei, G. An enhanced hybrid arithmetic optimization algorithm for engineering applications. Comput. Methods Appl. Mech. Eng. 394, 114901. (2022).

Article ADS MathSciNet MATH Google Scholar

Chou, J.-S. & Truong, D.-N. A novel metaheuristic optimizer inspired by behavior of jellyfish in ocean. Appl. Math. Comput. 389, 125535. (2021).

Article MathSciNet MATH Google Scholar

Bastian, T., Lilley, M. K. S., Beggs, S. E., Hays, G. C. & Doyle, T. K. Ecosystem relevance of variable jellyfish biomass in the Irish sea between years, regions and water types. Estuar. Coast. Shelf Sci. 149, 302–312. (2014).

Article ADS Google Scholar

Landow, K. Best treatment of jellyfish stings. Postgrad. Med. 107, 27–28. (2000).

Article CAS PubMed Google Scholar

Mariottini, G. L. & Pane, L. Mediterranean jellyfish venoms: A review on scyphomedusae. Mar. Drugs. 8(4), 1660–3397. (2010).

Article CAS Google Scholar

Fossette, S., Putman, N. F., Lohmann, K. J., Marsh, R. & Hays, G. C. A biologist’s guide to assessing ocean currents: A review. Mar. Ecol. Prog. Ser. 457, 285–301. (2012).

Article ADS Google Scholar

Fossette, S. et al. Current-oriented swimming by jellyfish and its role in bloom maintenance. Curr. Biol. 25, 342–347. (2015).

Article CAS PubMed Google Scholar

Dong, Z., Liu, D. & Keesing, J. K. Jellyfish blooms in China: Dominant species, causes and consequences. Mar. Pollut. Bull. 60(7), 954–963. (2010).

Article CAS PubMed Google Scholar

Chou, J.-S. & Truong, D.-N. Multiobjective optimization inspired by behavior of jellyfish for solving structural design problems. Chaos Solitons Fractals. 135, 109738. (2020).

Article MathSciNet Google Scholar

Truong, D.-N. & Chou, J.-S. Fuzzy adaptive jellyfish search-optimized stacking machine learning for engineering planning and design. Autom. Constr. (2022).

Article Google Scholar

May, R. M. Simple mathematical models with very complicated dynamics. Nature 261(5560), 459 (1976).

Article ADS CAS PubMed MATH Google Scholar

Gandomi, A. H., Yang, X. S., Talatahari, S. & Alavi, A. H. Firefly algorithm with chaos. Commun. Nonlinear Sci. Numer. Simul. 18(1), 89–98. (2013).

Article ADS MathSciNet MATH Google Scholar

Fister, I., Perc, M., Kamal, S. M. & Fister, I. A review of chaos-based firefly algorithms: Perspectives and research challenges. Appl. Math. Comput. 252, 155–165. (2015).

Article MathSciNet MATH Google Scholar

Zavodnik, D. Spatial aggregations of the swarming jellyfish Pelagia noctiluca (Scyphozoa). Mar. Biol. 94(2), 265–269. (1987).

Article Google Scholar

Kaveh, A., Biabani Hamedani, K., Kamalinejad, M. & Joudaki, A. Quantum-based jellyfish search optimizer for structural optimization. Int. J. Optim. Civ. Eng. 11(2), 329–356 (2021).

Google Scholar

Bujok, P. Three steps to improve jellyfish search optimiser. MENDEL 27(1), 29–40 (2021).

Article Google Scholar

Manita, G. & Zermani, A. A modified jellyfish search optimizer with orthogonal learning strategy. Proc. Comput. Sci. 192, 697–708. (2021).

Article Google Scholar

Abdel-Basset, M., Mohamed, R., Chakrabortty, R. K., Ryan, M. J. & El-Fergany, A. An improved artificial jellyfish search optimizer for parameter identification of photovoltaic models. Energies 14(7), 1867. (2021).

Article Google Scholar

Rajpurohit, J. & Sharma, T. K. Chaotic active swarm motion in jellyfish search optimizer. Int. J. Syst. Assur. Eng. Manag. (2022).

Article Google Scholar

Shaheen, A. M., El-Sehiemy, R. A., Elattar, E. & Ginidi, A. R. An amalgamated heap and jellyfish optimizer for economic dispatch in combined heat and power systems including N-1 Unit outages. Energy 246, 123351. (2022).

Article Google Scholar

Ginidi, A., Elsayed, A., Shaheen, A., Elattar, E. & El-Sehiemy, R. An innovative hybrid heap-based and jellyfish search algorithm for combined heat and power economic dispatch in electrical grids. Mathematics. 9(17), 2053. (2021).

Article Google Scholar

Rajpurohit, J., Sharma, T. K. A hybrid metaheuristic for transmission tower design optimization. In Soft Computing: Theories and Applications. (eds. Kumar, R., Ahn, C. W., Sharma, T. K., Verma, O. P., Agarwal, A.) 857–868 (Springer Nature Singapore, 2022).

Utama, D. M., Widjonarko, B. & Widodo, D. S. A novel hybrid jellyfish algorithm for minimizing fuel consumption capacitated vehicle routing problem. Bull. Electr. Eng. Inform. 11(3), 2302–9285. (2022).

Article Google Scholar

Lei, Y., Fan, L., Yang, J. & Si, W. Fractional-order boosted jellyfish search optimizer with Gaussian mutation for income forecast of rural resident. Comput. Intell. Neurosci. 1687–5265, 3343505. (2022).

Article Google Scholar

Shaheen, A. M., El-Sehiemy, R. A., Alharthi, M. M., Ghoneim, S. S. M. & Ginidi, A. R. Multi-objective jellyfish search optimizer for efficient power system operation based on multi-dimensional OPF framework. Energy 237, 121478. (2021).

Article Google Scholar

Rai, H., Verma, H. K. Economic load dispatch using jellyfish search optimizer. In 10th IEEE International Conference on Communication Systems and Network Technologies.

Tiwari, V., Dubey, H. M., Pandit, M. Optimal allocation of DG and capacitor units using jellyfish search algorithm. In 13th IEEE PES Asia Pacific Power & Energy Engineering Conference.

Farhat, M., Kamel, S., Atallah, A. M. & Khan, B. Optimal power flow solution based on jellyfish search optimization considering uncertainty of renewableenergy sources. IEEE Access. 9, 100911–100933. (2021).

Article Google Scholar

Shaheen, A. M., Elsayed, A. M., Ginidi, A. R., Elattar, E. E. & El-Sehiemy, R. A. Effective automation of distribution systems with joint integration of DGs/SVCs considering reconfiguration capability by jellyfish search algorithm. IEEE Access. 9, 92053–92069. (2021).

Article Google Scholar

Alam, A. et al. Jellyfish search optimization algorithm for MPP tracking of PV system. Sustainability. 13(21), 11736. (2021).

Article CAS Google Scholar

Boutasseta, N. et al. Solar energy conversion systems optimization using novel jellyfish based maximum power tracking strategy. Proc. Comput. Sci. 194, 80–88. (2021).

Article Google Scholar

Abdulnasser, G., Ali, A., Mohamed, E. E. M. Optimal planning of distributed generation and capacitor banks in distribution networks. In 22nd International Middle East Power Systems Conference. 619–24 (2021).

Ngo, T.-G. A power system economic load dispatch using jellyfish search algorithm. Soft Comput. Probl. Solving. 1393, 321 (2021).

Article Google Scholar

Nusair, K., Alasali, F., Hayajneh, A. & Holderbaum, W. Optimal placement of FACTS devices and power-flow solutions for a power network system integrated with stochastic renewable energy resources using new metaheuristic optimization techniques. Int. J. Energy Res. 45(13), 18786–18809. (2021).

Article Google Scholar

Eid, A. Cost-based analysis and optimization of distributed generations and shunt capacitors incorporated into distribution systems with nonlinear demand modeling. Expert Syst. Appl. 198, 116844. (2022).

Article Google Scholar

Huang, R. & Lin, Y. A maximum power Point tracking strategy for photovoltaic system based on improved artificial jellyfish search optimizer. In 3rd International Academic Exchange Conference on Science and Technology Innovation. 1918–1922 (2021).

Shaheen, A. M. et al. Multi-dimensional energy management based on an optimal power flow model using an improved quasi-reflection jellyfish optimization algorithm. Eng. Optim. (2022).

Article Google Scholar

Boriratrit, S., Srithapon, C., Fuangfoo, P. & Chatthaworn, R. Metaheuristic extreme learning machine for improving performance of electric energy demand forecasting. Computers. 11(5), 2073–2431. (2022).

Article Google Scholar

Ali, A. F., Gouda, E. A., Elsayes, M. A., Cao, D., Hu, W., Abulanwar, S. Optimal sizing of standalone hybrid microgrid using artificial jellyfish search. In 4th Asia Energy and Electrical Engineering Symposium. 171–176 (2022).

Rai, H. & Verma, H. K. Isolated microgrid combined economic emission dispatch using jellyfish search optimizer. In Modern Approaches in Machine Learning & Cognitive Science: A Walkthrough. (eds. Gunjan, V. K., Zurada, J. M.) 211–219 (Springer International Publishing, 2022). (2022).

Yuan, D.-D., Li, M., Li, H.-Y., Lin, C.-J. & Ji, B.-X. Wind power prediction method: Support vector regression optimized by improved jellyfish search algorithm. Energies (2022).

Article Google Scholar

Chou, J.-S., Cheng, T.-C., Liu, C.-Y., Guan, C.-Y. & Yu, C.-P. Metaheuristics-optimized deep learning to predict generation of sustainable energy from rooftop plant microbial fuel cells. Int. J. Energy Res. (2022).

Article Google Scholar

Selvakumar, S. & Manivannan, S. S. A spectrum defragmentation algorithm using jellyfish optimization technique in elastic optical network (EON). Wirel. Pers. Commun. (2021).

Article Google Scholar

Durmus, A., Kurban, R. & Karakose, E. A comparison of swarm-based optimization algorithms in linear antenna array synthesis. J. Comput. Electron. 20(4), 1520–1531. (2021).

Article Google Scholar

Aravind, K. & Maddikunta, P. K. R. Multiobjectives for optimal geographic routing in IoT health care system. Complexity (2022).

Article Google Scholar

Goodarzimehr, V., Omidinasab, F. & Taghizadieh, N. Optimum design of space structures using hybrid particle swarm optimization and genetic algorithm. World J. Eng. (2022).

Article Google Scholar

Ezzeldin, R., El-Ghandour, H. & El-Aabd, S. Optimal management of coastal aquifers using artificial jellyfish search algorithm. J. Hydrol. Reg. Stud. 41, 101058. (2022).

Article Google Scholar

Chou, J. S., Tjandrakusuma, S. & Liu, C. Y. Jellyfish search-optimized deep learning for compressive strength prediction in images of ready-mixed concrete. Comput. Intell. Neurosci. 2022, 9541115. (2022).

Article PubMed PubMed Central Google Scholar

Chou, J.-S. et al. Predicting nominal shear capacity of reinforced concrete wall in building by metaheuristics-optimized machine learning. J. Build. Eng. (2022).

Article Google Scholar

Kim, T.-Y. & Cho, S.-B. Predicting residential energy consumption using CNN-LSTM neural networks. Energy 182, 72–81. (2019).

Article Google Scholar

Chou, J. S. & Truong, D. N. Multistep energy consumption forecasting by metaheuristic optimization of time-series analysis and machine learning. Int. J. Energy Res. 45(3), 4581–4612. (2020).

Article Google Scholar

Almodfer, R. et al. Modeling of a solar-powered thermoelectric air-conditioning system using a random vector functional link network integrated with jellyfish search algorithm. Case Stud. Therm. Eng. 31, 101797. (2022).

Article Google Scholar

Chou, J.-S., Truong, D.-N. & Kuo, C.-C. Imaging time-series with features to enable visual recognition of regional energy consumption by bio-inspired optimization of deep learning. Energy 224, 120100. (2021).

Article Google Scholar

Barshandeh, S., Dana, R. & Eskandarian, P. A learning automata-based hybrid MPA and JS algorithm for numerical optimization problems and its application on data clustering. Knowl.-Based Syst. 236, 107682. (2022).

Article Google Scholar

Desuky, A. S., Elbarawy, Y. M., Kausar, S., Omar, A. H. & Hussain, S. Single-point crossover and jellyfish optimization for handling imbalanced data classification problem. IEEE Access. 10, 11730–11749. (2022).

Article Google Scholar

Chou, J.-S., Truong, D.-N., Le, T.-L. & Thu Ha Truong, T. Bio-inspired optimization of weighted-feature machine learning for strength property prediction of fiber-reinforced soil. Expert Syst. Appl. 180, 115042. (2021).

Article Google Scholar

Hoang, N.-D., Huynh, T.-C., Tran, V.-D. & Hanak, T. Concrete spalling severity classification using image texture analysis and a novel jellyfish search optimized machine learning approach. Adv. Civ. Eng. (2021).

Article Google Scholar

Siddiqui, N. I. et al. Artificial jellyfish search algorithm-based selective harmonic elimination in a cascaded H-bridge multilevel inverter. Electronics 10(19), 2402. (2021).

Article Google Scholar

Çetinkaya, M. B. & Duran, H. Performance comparison of most recently proposed evolutionary, swarm intelligence, and physics-based metaheuristic algorithms for retinal vessel segmentation. Math. Probl. Eng. (2022).

Article Google Scholar

Wang, J. & Gao, Y. An integrated forecasting system based on knee-based multi-objective optimization for solar radiation interval forecasting. Expert Syst. Appl. 198, 116934. (2022).

Article Google Scholar

Xuewu, Z. H. et al. Artificial jellyfish search optimization algorithm for human brain functional parcellation. J. Front. Comput. Sci. Technol. 1–16 (2022).

Shubham, R. S. P., Mehta, R., Singh, A. & Roy, O. P. A novel application of jellyfish search optimisation tuned dual stage (1+PI)TID controller for microgrid employing electric vehicle. Int. J. Ambient Energy (2022).

Article Google Scholar

Meng, S., Pan, R., Gao, W., Yan, B. & Peng, Y. Automatic recognition of woven fabric structural parameters: A review. Artif. Intell. Rev. (2022).

Article Google Scholar

Ashraf, H., Abdellatif, S. O., Elkholy, M. M. & El-Fergany, A. A. Computational techniques based on artificial intelligence for extracting optimal parameters of PEMFCs: Survey and insights. Arch. Comput. Methods Eng. 29, 1–30 (2022).

Article MathSciNet Google Scholar

Chou, J. S., Karundeng, M. A., Truong, D. N. & Cheng, M. Y. Identifying deflections of reinforced concrete beams under seismic loads by bio-inspired optimization of deep residual learning. Struct. Control. Health Monit. 29, 1545–2263. (2022).

Article Google Scholar

Dhevanandhini, G. & Yamuna, G. An efficient lossless video watermarking extraction process with multiple watermarks using artificial jellyfish algorithm. Turk. J. Comput. Math. Educ. 12(6), 3048–3055 (2021).

Google Scholar

Elkabbash, E. T., Mostafa, R. R. & Barakat, S. I. Android malware classification based on random vector functional link and artificial Jellyfish Search optimizer. PLoS ONE 16(11), e0260232. (2021).

Article CAS PubMed PubMed Central Google Scholar

Gouda, E. A., Kotb, M. F. & El-Fergany, A. A. Jellyfish search algorithm for extracting unknown parameters of PEM fuel cell models: Steady-state performance and analysis. Energy 221, 119836. (2021).

Article Google Scholar

Youssef, H., Hassan, M. H., Kamel, S., Elsayed, S. K. Parameter estimation of single phase transformer using jellyfish search optimizer algorithm. In IEEE International Conference on Automation/XXIV Congress of the Chilean Association of Automatic Control (ICA-ACCA) 1–4 (2021).

Kızıloluk, S. & Sert, E. Hurricane-faster R-CNN-JS: Hurricane detection with faster R-CNN using artificial jellyfish search (JS) optimizer. Multimed. Tools Appl. (2022).

Article Google Scholar

Bisht, R. & Sikander, A. A novel way of parameter estimation of solar photovoltaic system. COMPEL. Int. J. Comput. Math. Electr. Electron. Eng. 41(1), 471–498. (2021).

Article Google Scholar

Azam, M. S., Islam, M. R., Shafiullah, M., Islam, M. S. Robust design of PSS for multimachine networNs using jellyfish search algorithm. In Proceeding of the 31st Conference of Fruct Association 2305–7254 (2022).

Raja, L. & Periasamy, P. S. A trusted distributed routing scheme for wireless sensor networks using block chain and jellyfish search optimizer based deep generative adversarial neural network (DGANN) technique. Wirel. Pers. Commun. (2022).

Article Google Scholar

Usharani, M., Sakthivel, B., Priya, S. G., Nagalakshmi, T. & Shirisha, J. An optimized deep-learning-based low power approximate multiplier design. Comput. Syst. Sci. Eng. 44, 1647–1657. (2022).

Article Google Scholar

Nyong-Bassey, B. & Epemu, A. Systems identification of servomechanism parameters using jellyfish, particle swarm and constraint optimization. Niger. J. Technol. 41(3), 569–577 (2022).

Article Google Scholar

Download references

The authors would like to thank the National Science and Technology Council, Taiwan, for financially supporting this research under the Grant No. 110-2221-E-011-080-MY3.

National Taiwan University of Science and Technology, Taipei, Taiwan

Jui-Sheng Chou & Asmare Molla

You can also search for this author in PubMed Google Scholar

You can also search for this author in PubMed Google Scholar

J.S. Chou and A. Molla wrote the main manuscript text and prepared figures and tables. Both authors reviewed the manuscript.

Correspondence to Jui-Sheng Chou.

The authors declare no competing interests.

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit

Reprints and Permissions

Chou, JS., Molla, A. Recent advances in use of bio-inspired jellyfish search algorithm for solving optimization problems. Sci Rep 12, 19157 (2022).

Download citation

Received: 27 July 2022

Accepted: 25 October 2022

Published: 10 November 2022


Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Scientific Reports (2023)

By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.