You are currently viewing a new version of our website. To view the old version click .
Processes
  • Article
  • Open Access

2 November 2022

An Enhanced Evaporation Rate Water-Cycle Algorithm for Global Optimization

,
,
,
and
1
Department of Computer and Information Science, Linköping University, 581 83 Linköping, Sweden
2
Faculty of Science, Fayoum University, Fayoum 63514, Egypt
3
Faculty of Engineering, Helwan University, Cairo 11795, Egypt
4
School of Computing and Informatics, Al Hussein Technical University, Amman 11831, Jordan
This article belongs to the Section Process Control and Monitoring

Abstract

Water-cycle algorithm based on evaporation rate (ErWCA) is a powerful enhanced version of the water-cycle algorithm (WCA) metaheuristics algorithm. ErWCA, like other algorithms, may still fall in the sub-optimal region and have a slow convergence, especially in high-dimensional tasks problems. This paper suggests an enhanced ErWCA (EErWCA) version, which embeds local escaping operator (LEO) as an internal operator in the updating process. ErWCA also uses a control-randomization operator. To verify this version, a comparison between EErWCA and other algorithms, namely, classical ErWCA, water cycle algorithm (WCA), butterfly optimization algorithm (BOA), bird swarm algorithm (BSA), crow search algorithm (CSA), grasshopper optimization algorithm (GOA), Harris Hawks Optimization (HHO), whale optimization algorithm (WOA), dandelion optimizer (DO) and fire hawks optimization (FHO) using IEEE CEC 2017, was performed. The experimental and analytical results show the adequate performance of the proposed algorithm.

1. Introduction

Optimization is the rule of selecting the best design variables to find maximum/minimum values for a specific problem [1,2,3,4]. Optimization approaches examine the search space to find the best optimal/near-optimal results for the given task [5,6,7,8].
Metaheurstic algorithms have attracted great attention, and significant interest due to their simplicity and powerfulness in solving optimization tasks, especially complex ones. Metaheuristic algorithms can be divided into two big classes: single-based algorithms and population-based algorithms. The former class contains algorithms such as simulated annealing (SA) [9], tabu search (TS) [10], and β -hill climbing [11] whereas the latter class contains algorithms such as grey wolf optimization (GWO) [12], particle swarm optimization (PSO) [13], salp swarm algorithm (SSA) [14,15], gravitational search algorithm [16], moth-flame optimization (MFO) [17], virus colony search (VCS) [18], crow search algorithm (CSA) [19], snake optimizer (SO) [20], lightning search algorithm (LSA) [21], Ant Lion Optimization (ALO) [22], Arithmetic optimization algorithm [23], Remora Optimization Algorithm [24], Wild Horse Optimizer [25], COOT bird [26], Aquila Optimizer (AO) [27], harris hawks optimization (HHO) [28,29], and whale optimizer algorithm (WOA) [30,31].
Metaheuristic algorithms have been successfully applied to many domains (fields) [32,33]. Examples of such fields include feature selection [34,35], cloud computing [36], ransomware detection [37], text mining [38], deep learning [39], signal processing [40], photovoltaic models [41], medical applications [42], and engineering problems [43,44].
Water-cycle algorithm (WCA) is a swarm intelligence algorithm developed by Eskandar et al. [45] which simulates the running of streams and river towards the sea. ErWCA is a variant of WCA which adds the concept of river/stream evaporation rate [46]. The original ErWCA has good exploration abilities. However, it has low capabilities of exploitation. In this study, a modified version of ErWCA is proposed, called enhanced ErWCA (EErWCA), in which the local escape operator (LEO) is added to increase the exploitation of ErWCA in addition to two operators which are borrowed from slime mould optimization [47] to increase its exploration abilities.
The major contributions of this paper are highlighted as the following points:
  • ErWCA is enhanced by embedding local escape operator and two other control-randomization operators in the updating phase and using the control-randomization operator.
  • EErWCA is tested using 29 CEC 2017 and compared with the classical and eight other algorithms.
  • Three different engineering problems are used to prove the effectiveness of the proposed algorithm in solving constrained problems.
This study is organized as follows: Section 2 represents the related works. Section 3 shows the mathematical formulation of evaporation rate water-cycle algorithm, whereas the proposed algorithm is shown in Section 4. Section 5 shows the experimental and analytical results of the proposed algorithm, whereas Section 6 concludes the paper and gives some future work ideas.

3. Evaporation Rate Water-Cycle Algorithm

ErWCA is a metaheuristic population-based algorithm which is inspired by the hydrologic cycle. Evaporated water returns to the earth and is carried into the atmosphere in the form of rain.

Mathematical Formulation

The first generation of individuals (raindrops) is produced randomly between upper and lower boundaries. Then, all individuals are evaluated using the objective function. The best one is selected as the sea, and other good individuals are selected as rivers. The following equations are used in initialization.
Raindrop = [ R 1 , R 2 , R 3 , , R m ]
population of raindrop = S e a R i v e r 1 R i v e r 2 . . S t r e a m M s r + 1 S t r e a m M s r + 2 . . S t r e a m M p o p = R 1 1 R 2 1 R M 1 R 1 2 R 2 2 R M 2 R 1 M p o p R 2 M p o p R 1 M p o p
where M refers to the raindrops number and M p o p refers to the size of the population.
The flow intensity for each stream can be obtained based on the objective function value from the following equation
C o s t i = f ( R 1 i , R 2 i , R 3 i , . . . , R m i ) i = 1 , 2 , 3 , , M p o p
The other individuals can be evaluated from the below equation.
M s r = Number of Rivers + 1
M R a i n d r o p s = M p o p M s r
The intensity of flow streams that directly flow to either rivers or sea can be calculated from the following equations
C m = C o s t m C o s t M s r + 1
M S m = r o u n d { | C m m = 1 M s r C m | × M R a i n d r o p s }
where M s r refers to stream numbers.
The location of the new streams and rivers can be given bellow.
R S t r e a m i + 1 = R S t r e a m i + r a n d × K × ( R R i v e r i R S t r e a m i )
R S t r e a m i + 1 = R S t r e a m i + r a n d × K × ( R S e a i R S t r e a m i )
R R i v e r i + 1 = R S t r e a m i + r a n d × K × ( R S e a i R R i v e r i )
where r a n d refers to a number between 0 and 1, K is a value between (1,2), and their sum equals 2.
If the distance between sea and river < d m a x , then the evaporation and raining phases have started. The following equation can give the new stream position.
R S t r e a m n e w = L o B + r a n d × ( U p B L o B )
where U p B and L o B are upper and lower boundaries. The evaporation condition is also applied to the stream that flows to the sea. The following equation can give the new stream position
R S t r e a m n e w = R s e a + q × r a n d n ( 1 , M v a r )
where q refers to a constant that equals 0.1 and the d m a x value decreases according to the following equation
d m a x i + 1 = d m a x i d m a x i M a x _ I t e r
Many rivers are not able to reduce the distance to the sea. Therefore, an evaporation rate concept is added as follows:
E R = S u m ( M S m ) M s r 1 × r a n d , m = 2 , , M s r

4. Proposed Algorithm EErWCA

ErWCA has many drawbacks as it is stuck in local regions or has low convergence in high-dimensional problems. In addition, the no free lunch (NFL) theorm, which states that there is no algorithm that is good in solving all optimization problems, encourages us to develop an enhanced version of ErWCA. In this paper, the exploitation phase is replaced by slime mould algorithm (SMA) exploitation phase.
Here, we used two operators, a and W, as follows
a = a r c t a n h ( ( t M a x _ I t e r ) + 1 )
where t and M a x _ I t e r refer to the current and maximum number of iterations, respectively.
W ( S ) = 1 + r . l o g ( b F S ( i ) b F w f + 1 ) r a n d 0.5 1 r . l o g ( b F S ( i ) b F w f + 1 ) o t h e r w i s e
where b F and w f refer to optimal fitness value and the best fitness value, respectively, and S ( i ) refers to the rank of the first population half.
In order to update the river position, the following equation is used to update the river.
R R i v e r i + 1 = R S t r e a m i + a × ( W × R S e a i R R i v e r i )

Local Escaping Operator (LEO)

LEO is based on two parts: the first on ( X 1 n m   &   X 2 n m ) and the second is based on ( X r 1 m   &   X r 2 m ). The 1st part update position is based on four random solutions, which make ( X L E O m ) based on a random position. In this paper, we try to enhance X 1 n m and X 2 n m .
δ = 2 × r a n d × ( | x b e s t 1 + x b e s t 2 + x b e s t 3 + x b e s t 4 4 x n m | )
The flow chart is given in Figure 1, and the pseudo-code is given in Algorithm 1. The local escaping operator is used at the beginning of each iteration, and the SA solution is generated and compared with each current solution.
Algorithm 1 Enhanced ErWCA
1:
  Determine the initial ErWCA parameters d m a x , N s r , N p o p , and  M a x _ I t e r
2:
  Initialize population randomly.
3:
  Form initial streams, rivers, and sea.
4:
  while ( t M a x _ I t e r ) do do
5:
      Evaluate each stream fitness, Equation (3).
6:
      Apply LEO operator
7:
      Determine intensity of flow for river and sea using Equations (7) and (8).
8:
      Generate a random solution using SA and update the current agent if the generated solution is better.
9:
      Streams flow to the river and sea using Equations (10) and (11).
10:
    Exchange positions of river and sea.
11:
    Rivers flow to the sea Equation (11).
12:
    if ( X r i v e r < X S e a ) then
13:
        Exchange river with the sea.
14:
    end if
15:
    if Check evaporation rate between river and sea then
16:
        Update streams and rivers.
17:
    end if
18:
    if Check evaporation rate between sea and river then
19:
        Update streams and rivers.
20:
    end if
21:
    Reduce d m a x .
22:
end while
23:
Return best solution.
Figure 1. EErWCA flow Chart.

5. Experimental Results and Discussion

In this section, we test our proposed algorithm versus the classical ErWCA, and nine other metaheuristic algorithms, namely: evaporation rate water-cycle algorithm (ErWCA) [46], water-cycle algorithm [45], butterfly optimization algorithm (BOA) [59], bird swarm algorithm (BSA) [60], crow search algorithm (CSA) [61], grasshopper optimization algorithm (GOA) [62], harris hawks optimization (HHO) [63], whale optimization algorithm (WOA) [64], dandelion optimizer (DO) [65] and fire hawks optimization (FHO) [66] using 29 CEC2017 benchmark functions [67]. All experiments were calculated with an average of 30 runs using Matlab version 2021b on a 64bit system with Core i7 and 8 GB RAM. Table 1 shows the parameter settings of the experiment, whereas Table 2 shows the parameter settings of the compared algorithms.
Table 1. Experiment parameter settings.
Table 2. Meta-heuristic algorithms parameter settings.
Table 3 gives the results of the algorithms in terms of average and standard deviation.
Table 3. The comparison results of all algorithms over 29 functions using Dim = 30 CEC 2017.
From the previous table, and it can be seen that EErWCA is ranked first in 16 functions out of 29. This proves the superiority of the LEO operator when it is implemented as a local operator in avoiding sub-optimal regions. In addition, a non-parametric test called the Wilcoxon signed-rank test was used to prove the performance of our algorithm. Table 4 shows the results of the Wilcoxon test. Moreover, Figure 2 and Figure 3 show the convergence of EErWCA with other competitors. It is obvious that EErWCA has a more rapid convergence than the classical algorithm and other algorithms. Furthermore, Figure 4 and Figure 5 show the box plot of the suggested algorithm compared with other algorithms.
Table 4. The Wilcoxon signed-rank test for the comparative algorithms against the proposed EErWCA using CEC2017 benchmark functions, where a = 0.05 and dim = 30.
Figure 2. Convergence curve of some functions from F1–F15 for all algorithms using CEC2017 and dim = 30.
Figure 3. Convergence curve of some functions from F16–F30 for all algorithms using CEC2017 and dim = 30.
Figure 4. Box plots of some functions from F1–F15 for all algorithms using CEC2017 and dim = 30.
Figure 5. Box plots of some functions from F16–F30 for all algorithms using CEC2017 and dim = 30.

5.1. Experimental Series 2: Engineering Problems

This section discusses the results obtained from conducting the experiments for several engineering problems, including the industrial refrigeration system problem, the speed reducer problem, and the multi-product batch plant problem. The statistical results, convergence curves, and box plots are displayed for each problem.

5.1.1. Design of Industrial Refrigeration System Problem

The problem of the industrial refrigeration system aims to find the best refrigerants, the ideal temperature levels, the proper cycle configuration, and the best compression technology to minimize cost and produce the optimal refrigeration system for the clients [54].
The statistical results for the proposed algorithm for the industrial refrigeration system problem are shown in Table 5. The results for the proposed algorithm are compared with other algorithms, including ErWCA, WCA, BOA, BSA, COA, CSA, GOA, HHO, and WOA. The minimum, maximum, average, and standard deviation values are presented in the table. It is observed from the table that the proposed EErWCA is ranked first among the other algorithms for the average results. In addition, Table 6 shows the best algorithm results and the value achieved for each dimension. It is observed from the table that the EErWCA has a low best value, and the ErWCA and WCA algorithms are competitive with the proposed algorithm for the best results. Figure 6 shows the algorithms’ convergence plots and box plots. The convergence curves show the values of the average best for the algorithms for each iteration. It is observed that the proposed EErWCA achieved the best value progressing to the last iteration. ErWCA, on the other hand, had good values in earlier iterations but failed to achieve better values at the last iteration compared to the proposed EErWCA. The box plot shows that the proposed algorithm has a very low standard deviation. It also has low values for the maximum and minimum values, which shows the superiority of the proposed algorithm. Other algorithms such as ErWCA, WCA, CSA, HHO, and WOA have a low standard deviation, and minimum and maximum values. In contrast, BSA has the largest standard deviation, and maximum and minimum values.
Table 5. Statistical results of EErWCA versus other metaheuristics on optimal design of industrial refrigeration system.
Table 6. Results of EErWCA versus other metaheuristics on optimal design of industrial refrigeration system.
Figure 6. Design of Industrial refrigeration System.

5.1.2. Design of Speed Reducer Problem

The design of the speed reducer problem aims to find the minimum speed reducer weight based on the gear teeth stress, stress of the surface, shafts transverse deflections, and shafts stresses. The problem has seven design variables (z1–z7). The following equations represent the problem:
Min f ( z ) = 0.7854 z 1 z 2 2 ( 3.3333 z 3 2 + 14.9334 z 3 43.0934 ) 1.508 z 1 ( z 6 2 + z 7 2 ) + 7.4777 ( z 6 3 + z 7 3 ) + 0.7854 ( z 4 z 6 2 + z 5 z 7 2 )
Subject to:
g 1 ( z ) = 27 z 1 z 2 2 z 3 1 0 g 2 ( z ) = 397.5 z 1 z 2 2 z 3 1 0 g 3 ( z ) = 1.93 z 4 3 z 2 z 3 z 6 4 1 g 4 ( z ) = 1.93 z 5 3 z 2 z 3 z 7 4 1 0 g 5 ( z ) = 1 110 z 6 3 745 z 4 z 2 z 3 2 + 16.9 × 10 6 1 0 g 6 ( z ) = 1 85 z 7 3 745 z 5 z 2 z 3 2 + 157.5 × 10 6 1 0 g 7 z = z 2 z 3 40 1 0 g 8 ( z ) = 5 z 2 z 1 1 0 g 9 ( z ) = z 1 12 z 2 1 0 g 10 ( z ) = 1.5 z 6 + 1.9 z 4 1 0 g 11 ( z ) = 1.1 z 7 + 1.9 z 5 1 0
with 2.6 z 1 3.6 , 0.7 z 2 0.8 , 17 z 3 28 , 7.3 z 4 8.3 , 7.8 z 5 8.3 , 2.9 z 6 3.9 , and 5 z 7 5.5 .
For this type of problem, Table 7 and Table 8, and Figure 7 show the results of applying the proposed algorithm and comparing the results with other algorithms. Table 7 shows that the proposed EErWCA has the rank of 1 for the average results compared to the other algorithms. CSA, WCA, and ErWCA have similar results to the proposed algorithm. Table 8 shows the best results and the value for each dimension for all the algorithms. The best value is achieved equally for the proposed EErWCA, ErWCA, WCA, and CSA. The convergence plot for the average best, which is presented as the first figure in Figure 7, shows competitive results toward a better solution for all algorithms. On the other hand, the box plot in Figure 7 shows a low standard deviation for most of the algorithms except for BOA, GOA, and WOA.
Table 7. Statistical results of EErWCA versus other metaheuristics on speed reducer design.
Table 8. Results of EErWCA versus other metaheuristics on speed reducer design.
Figure 7. Design of Speed Reducer.

5.1.3. Design of Multi-Product Batch Plant Problem

The multi-product batch plant problem is represented when several products show a high degree of similarity and, thus, need the same process for production, and the same equipment configuration [68,69].
Table 9 shows that the proposed EErWCA achieved the first rank against the other algorithms. CSA and WCA achieve the best results while EErWCA and ErWCA have similar best results to the CSA and WCA (Table 10). The convergence curve in Figure 8 shows that the best value of the average best is achieved in early iterations for many algorithms with the exception of GOA and BOA, where the best value is not achieved compared to the other algorithms. HHO also shows late progress in achieving the best value compared to the other algorithms. On the other hand, the box plot in Figure 8 shows very competitive results for all the algorithms by having a very low standard deviation.
Table 9. Statistical results of EErWCA versus other metaheuristics on multi-product batch plant.
Table 10. Results of EErWCA versus other metaheuristics on multi-product batch plant.
Figure 8. Design of multi-product batch plant.
The results are summarized in Table 11. It shows the Wilcoxon test results for each algorithm against the proposed EErWCA for each engineering problem.
Table 11. Statistical results of EErWCA versus other metaheuristics on engineering problems.

6. Conclusions and Future Work

Evaporation rate water-cycle algorithm (ErWCA) is a new version of the water-cycle algorithm (WCA) inspired by the hydrologic cycle. However, ErWCA has many drawbacks and limitations. In this paper, we try to use the slime mould algorithm (SMA) exploitation phase instead of the original ErWCA exploitation. Moreover, we introduce a new local escape operator to help the hybrid proposed algorithm escape from local optima. The novel algorithm was tested using 29 functions from the CEC 2017 benchmark and compared with the classical algorithm and three other state-of-the-art well-known algorithms. The statistical analysis and experimental results prove the superiority of the developed algorithm. The statistical analysis and experimental results prove the superiority of the developed algorithm. The limitation of this work is that EErWCA, like all other metaheurstics algorithms, cannot guarantee the optimal solution to all problems. In the future, it will be possible to combine this algorithm with many other operators such as chaotic local search, distribution operator, local escaping operator, and more. In future work, we will also try to produce many versions of this algorithm, including multi-objective, discrete, chaotic, etc. We will also investigate the possibility of applying this version to fields such as feature selection, scheduling, power, agriculture, etc. In addition, the currently proposed method can be used to solve similar hard problems such as data mining, advanced industrial engineering, feature selection, prediction, scheduling in IoT cloud environments, and others.

Author Contributions

A.G.H.: Conceptualization, supervision, methodology, formal analysis, resources, data curation, writing—original draft preparation. F.A.H.: Conceptualization, writing—review and editing, supervision. R.Q.: Conceptualization, writing—review and editing, supervision. L.A.: Conceptualization, writing—review and editing, supervision. A.P.: Conceptualization, supervision, writing—review and editing, project administration, funding acquisition. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data is available on reasonable request.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Hashim, F.; Salem, N.; Seddik, A. Optic disc boundary detection from digital fundus images. J. Med. Imaging Health Inform. 2015, 5, 50–56. [Google Scholar] [CrossRef]
  2. Hashim, F.A.; Salem, N.M.; Seddik, A.F. Automatic segmentation of optic disc from color fundus images. Jokull J. 2013, 63, 142–153. [Google Scholar]
  3. Mostafa, R.; Ewees, A.; Ghoniem, R.; Abualigah, L.; Hashim, F. Boosting chameleon swarm algorithm with consumption AEO operator for global optimization and feature selection. Knowl.-Based Syst. 2022, 246, 108743. [Google Scholar]
  4. Mostafa, R.; El-Attar, N.; Sabbeh, S.; Vidyarthi, A.; Hashim, F. ST-AL: A hybridized search based metaheuristic computational algorithm towards optimization of high dimensional industrial datasets. Soft Comput. 2022, 1–29. [Google Scholar] [CrossRef]
  5. Hashim, F.A.; Houssein, E.H.; Mabrouk, M.S.; Al-Atabany, W.; Mirjalili, S. Henry gas solubility optimization: A novel physics-based algorithm. Future Gener. Comput. Syst. 2019, 101, 646–667. [Google Scholar] [CrossRef]
  6. Hashim, F.A.; Hussain, K.; Houssein, E.H.; Mabrouk, M.S.; Al-Atabany, W. Archimedes optimization algorithm: A new metaheuristic algorithm for solving optimization problems. Appl. Intell. 2021, 51, 1531–1551. [Google Scholar] [CrossRef]
  7. Hashim, F.A.; Houssein, E.H.; Hussain, K.; Mabrouk, M.S.; Al-Atabany, W. Honey Badger Algorithm: New metaheuristic algorithm for solving optimization problems. Math. Comput. Simul. 2022, 192, 84–110. [Google Scholar] [CrossRef]
  8. Fathi, H.; AlSalman, H.; Gumaei, A.; Manhrawy, I.I.; Hussien, A.G.; El-Kafrawy, P. An Efficient Cancer Classification Model Using Microarray and High-Dimensional Data. Comput. Intell. Neurosci. 2021, 2021, 7231126. [Google Scholar] [CrossRef]
  9. Kirkpatrick, S.; Gelatt Jr, C.D.; Vecchi, M.P. Optimization by simulated annealing. Science 1983, 220, 671–680. [Google Scholar] [CrossRef]
  10. Glover, F. Heuristics for integer programming using surrogate constraints. Decis. Sci. 1977, 8, 156–166. [Google Scholar] [CrossRef]
  11. Abualigah, L.M.; Sawaie, A.M.; Khader, A.T.; Rashaideh, H.; Al-Betar, M.A.; Shehab, M. β-hill climbing technique for the text document clustering. New Trends Inf. Technol. (NTIT) 2017, 60, 60–66. [Google Scholar]
  12. Mirjalili, S.; Mirjalili, S.M.; Lewis, A. Grey wolf optimizer. Adv. Eng. Softw. 2014, 69, 46–61. [Google Scholar] [CrossRef]
  13. Kennedy, J.; Eberhart, R. Particle swarm optimization. In Proceedings of the ICNN’95-International Conference on Neural Networks, Perth, WA, Australia, 27 November–1 December 1995; Volume 4, pp. 1942–1948. [Google Scholar]
  14. Hussien, A.G. An enhanced opposition-based Salp Swarm Algorithm for global optimization and engineering problems. J. Ambient. Intell. Humaniz. Comput. 2022, 13, 129–150. [Google Scholar] [CrossRef]
  15. Hussien, A.G.; Hassanien, A.E.; Houssein, E.H. Swarming behaviour of salps algorithm for predicting chemical compound activities. In Proceedings of the 2017 Eighth International Conference on Intelligent Computing and Information Systems (ICICIS), Cairo, Egypt, 5–7 December 2017; pp. 315–320. [Google Scholar]
  16. Rashedi, E.; Nezamabadi-Pour, H.; Saryazdi, S. GSA: A gravitational search algorithm. Inf. Sci. 2009, 179, 2232–2248. [Google Scholar] [CrossRef]
  17. Hussien, A.G.; Amin, M.; Abd El Aziz, M. A comprehensive review of moth-flame optimisation: Variants, hybrids, and applications. J. Exp. Theor. Artif. Intell. 2020, 32, 705–725. [Google Scholar] [CrossRef]
  18. Hussien, A.G.; Heidari, A.A.; Ye, X.; Liang, G.; Chen, H.; Pan, Z. Boosting whale optimization with evolution strategy and Gaussian random walks: An image segmentation method. Eng. Comput. 2022, 1–45. [Google Scholar] [CrossRef]
  19. Hussien, A.G.; Amin, M.; Wang, M.; Liang, G.; Alsanad, A.; Gumaei, A.; Chen, H. Crow search algorithm: Theory, recent advances, and applications. IEEE Access 2020, 8, 173548–173565. [Google Scholar] [CrossRef]
  20. Hashim, F.A.; Hussien, A.G. Snake Optimizer: A novel meta-heuristic optimization algorithm. Knowl.-Based Syst. 2022, 242, 108320. [Google Scholar] [CrossRef]
  21. Abualigah, L.; Elaziz, M.A.; Hussien, A.G.; Alsalibi, B.; Jalali, S.M.J.; Gandomi, A.H. Lightning search algorithm: A comprehensive survey. Appl. Intell. 2021, 51, 2353–2376. [Google Scholar] [CrossRef]
  22. Assiri, A.S.; Hussien, A.G.; Amin, M. Ant Lion Optimization: Variants, hybrids, and applications. IEEE Access 2020, 8, 77746–77764. [Google Scholar] [CrossRef]
  23. Singh, S.; Singh, H.; Mittal, N.; Hussien, A.G.; Sroubek, F. A feature level image fusion for Night-Vision context enhancement using Arithmetic optimization algorithm based image segmentation. Expert Syst. Appl. 2022, 209, 118272. [Google Scholar] [CrossRef]
  24. Wang, S.; Hussien, A.; Jia, H.; Abualigah, L.; Zheng, R. Enhanced Remora Optimization Algorithm for Solving Constrained Engineering Optimization Problems. Mathematics 2022, 10, 1696. [Google Scholar] [CrossRef]
  25. Zheng, R.; Hussien, A.; Jia, H.; Abualigah, L.; Wang, S.; Wu, D. An Improved Wild Horse Optimizer for Solving Optimization Problems. Mathematics 2022, 10, 1311. [Google Scholar] [CrossRef]
  26. Mostafa, R.; Hussien, A.; Khan, M.; Kadry, S.; Hashim, F. Enhanced coot optimization algorithm for dimensionality reduction. In Proceedings of the 2022 Fifth International Conference of Women in Data Science at Prince Sultan University (WiDS PSU), Riyadh, Saudi Arabia, 28–29 March 2022; pp. 43–48. [Google Scholar]
  27. Yu, H.; Jia, H.; Zhou, J.; Hussien, A. Enhanced Aquila optimizer algorithm for global optimization and constrained engineering problems. Math. Biosci. Eng. 2022, 19, 14173–14211. [Google Scholar] [CrossRef]
  28. Hussien, A.G.; Amin, M. A self-adaptive Harris Hawks optimization algorithm with opposition-based learning and chaotic local search strategy for global optimization and feature selection. Int. J. Mach. Learn. Cybern. 2022, 13, 309–336. [Google Scholar] [CrossRef]
  29. Hussien, A.G.; Abualigah, L.; Abu Zitar, R.; Hashim, F.; Amin, M.; Saber, A.; Almotairi, K.H.; Gandomi, A.H. Recent advances in harris hawks optimization: A comparative study and applications. Electronics 2022, 11, 1919. [Google Scholar] [CrossRef]
  30. Hussien, A.G.; Oliva, D.; Houssein, E.H.; Juan, A.A.; Yu, X. Binary whale optimization algorithm for dimensionality reduction. Mathematics 2020, 8, 1821. [Google Scholar] [CrossRef]
  31. Hussien, A.G.; Hassanien, A.E.; Houssein, E.H.; Amin, M.; Azar, A.T. New binary whale optimization algorithm for discrete optimization problems. Eng. Optim. 2020, 52, 945–959. [Google Scholar] [CrossRef]
  32. Oyelade, O.N.; Ezugwu, A.E.S.; Mohamed, T.I.; Abualigah, L. Ebola optimization search algorithm: A new nature-inspired metaheuristic optimization algorithm. IEEE Access 2022, 10, 16150–16177. [Google Scholar] [CrossRef]
  33. Agushaka, J.O.; Ezugwu, A.E.; Abualigah, L. Dwarf mongoose optimization algorithm. Comput. Methods Appl. Mech. Eng. 2022, 391, 114570. [Google Scholar] [CrossRef]
  34. Hussien, A.G.; Hassanien, A.E.; Houssein, E.H.; Bhattacharyya, S.; Amin, M. S-shaped binary whale optimization algorithm for feature selection. In Recent Trends in Signal and Image Processing; Springer: Berlin/Heidelberg, Germany, 2019; pp. 79–87. [Google Scholar]
  35. Hussien, A.G.; Houssein, E.H.; Hassanien, A.E. A binary whale optimization algorithm with hyperbolic tangent fitness function for feature selection. In Proceedings of the 2017 Eighth International Conference on Intelligent Computing and Information Systems (ICICIS), Cairo, Egypt, 5–7 December 2017; pp. 166–172. [Google Scholar]
  36. Abualigah, L.; Diabat, A. A novel hybrid antlion optimization algorithm for multi-objective task scheduling problems in cloud computing environments. Clust. Comput. 2021, 24, 205–223. [Google Scholar] [CrossRef]
  37. Qaddoura, R.; Aljarah, I.; Faris, H.; Almomani, I. A classification approach based on evolutionary clustering and its application for ransomware detection. In Evolutionary Data Clustering: Algorithms and Applications; Springer: Berlin/Heidelberg, Germany, 2021; pp. 237–248. [Google Scholar]
  38. Abualigah, L.; Gandomi, A.H.; Elaziz, M.A.; Hussien, A.G.; Khasawneh, A.M.; Alshinwan, M.; Houssein, E.H. Nature-inspired optimization algorithms for text document clustering—A comprehensive analysis. Algorithms 2020, 13, 345. [Google Scholar] [CrossRef]
  39. Barshandeh, S.; Piri, F.; Sangani, S.R. HMPA: An innovative hybrid multi-population algorithm based on artificial ecosystem-based and Harris Hawks optimization algorithms for engineering problems. Eng. Comput. 2022, 38, 1581–1625. [Google Scholar] [CrossRef]
  40. Al-Qaness, M.A.; Ewees, A.A.; Fan, H.; Abd El Aziz, M. Optimization method for forecasting confirmed cases of COVID-19 in China. J. Clin. Med. 2020, 9, 674. [Google Scholar] [CrossRef]
  41. Zhang, Y.; Jin, Z.; Mirjalili, S. Generalized normal distribution optimization and its applications in parameter extraction of photovoltaic models. Energy Convers. Manag. 2020, 224, 113301. [Google Scholar] [CrossRef]
  42. Qaddoura, R.; Manaseer, W.A.; Abushariah, M.A.; Alshraideh, M.A. Dental radiography segmentation using expectation-maximization clustering and grasshopper optimizer. Multimed. Tools Appl. 2020, 79, 22027–22045. [Google Scholar] [CrossRef]
  43. Elsheikh, A.H.; Sharshir, S.W.; Abd Elaziz, M.; Kabeel, A.; Guilan, W.; Haiou, Z. Modeling of solar energy systems using artificial neural network: A comprehensive review. Sol. Energy 2019, 180, 622–639. [Google Scholar] [CrossRef]
  44. Ezugwu, A.E.; Agushaka, J.O.; Abualigah, L.; Mirjalili, S.; Gandomi, A.H. Prairie Dog Optimization Algorithm. Neural Comput. Appl. 2022, 34, 20017–20065. [Google Scholar] [CrossRef]
  45. Eskandar, H.; Sadollah, A.; Bahreininejad, A.; Hamdi, M. Water cycle algorithm—A novel metaheuristic optimization method for solving constrained engineering optimization problems. Comput. Struct. 2012, 110, 151–166. [Google Scholar] [CrossRef]
  46. Sadollah, A.; Eskandar, H.; Bahreininejad, A.; Kim, J.H. Water cycle algorithm with evaporation rate for solving constrained and unconstrained optimization problems. Appl. Soft Comput. 2015, 30, 58–71. [Google Scholar] [CrossRef]
  47. Li, S.; Chen, H.; Wang, M.; Heidari, A.A.; Mirjalili, S. Slime mould algorithm: A new method for stochastic optimization. Future Gener. Comput. Syst. 2020, 111, 300–323. [Google Scholar] [CrossRef]
  48. Stanovov, V.; Akhmedova, S.; Semenkin, E. LSHADE algorithm with rank-based selective pressure strategy for solving CEC 2017 benchmark problems. In Proceedings of the 2018 IEEE Congress on Evolutionary Computation (CEC), Rio de Janeiro, Brazil, 8–13 July 2018; pp. 1–8. [Google Scholar]
  49. Salgotra, R.; Singh, U.; Saha, S.; Gandomi, A.H. Improving cuckoo search: Incorporating changes for CEC 2017 and CEC 2020 benchmark problems. In Proceedings of the 2020 IEEE Congress on Evolutionary Computation (CEC), Glasgow, UK, 19–24 July 2020; pp. 1–7. [Google Scholar]
  50. Anita; Yadav, A.; Kumar, N. Artificial electric field algorithm for engineering optimization problems. Expert Syst. Appl. 2020, 149, 113308. [Google Scholar]
  51. Trivedi, A.; Srinivasan, D. Empirical investigations into the composite differential evolution on cec 2017 constrained optimization problems. In Proceedings of the 2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC), Miyazaki, Japan, 7–10 October 2018; pp. 280–285. [Google Scholar]
  52. Chen, D.; Luo, Y.; Yuan, X. Refrigeration system synthesis based on de-redundant model by particle swarm optimization algorithm. Chin. J. Chem. Eng. 2022. [Google Scholar] [CrossRef]
  53. Ahmed, R.; Mahadzir, S.; Rozali, N.E.M.; Biswas, K.; Matovu, F.; Ahmed, K. Artificial intelligence techniques in refrigeration system modelling and optimization: A multi-disciplinary review. Sustain. Energy Technol. Assess. 2021, 47, 101488. [Google Scholar] [CrossRef]
  54. Marechal, F.; Kalitventzeff, B. A tool for optimal synthesis of industrial refrigeration systems. In Computer Aided Chemical Engineering; Elsevier: Amsterdam, The Netherlands, 2001; Volume 9, pp. 457–462. [Google Scholar]
  55. Zhang, J.; Qin, X.; Xie, C.; Chen, H.; Jin, L. Optimization design on dynamic load sharing performance for an in-wheel motor speed reducer based on genetic algorithm. Mech. Mach. Theory 2018, 122, 132–147. [Google Scholar] [CrossRef]
  56. Zaman, M.A.U. On the Reliability-Based Design Optimization (RBDO) of A Speed Reducer. Int. J. Eng. Innov. Res. 2019, 8, 14–22. [Google Scholar]
  57. Borisenko, A.; Gorlatch, S. Efficient GPU-parallelization of batch plants design using metaheuristics with parameter tuning. J. Parallel Distrib. Comput. 2021, 154, 74–81. [Google Scholar] [CrossRef]
  58. Han, Y.; Gu, X. Cooperative hybrid evolutionary algorithm for large scale multi-stage multi-product batch plants scheduling problem. Neurocomputing 2021, 419, 80–96. [Google Scholar] [CrossRef]
  59. Arora, S.; Singh, S. Butterfly optimization algorithm: A novel approach for global optimization. Soft Comput. 2019, 23, 715–734. [Google Scholar] [CrossRef]
  60. Meng, X.B.; Gao, X.Z.; Lu, L.; Liu, Y.; Zhang, H. A new bio-inspired optimisation algorithm: Bird Swarm Algorithm. J. Exp. Theor. Artif. Intell. 2016, 28, 673–687. [Google Scholar] [CrossRef]
  61. Askarzadeh, A. A novel metaheuristic method for solving constrained engineering optimization problems: Crow search algorithm. Comput. Struct. 2016, 169, 1–12. [Google Scholar] [CrossRef]
  62. Mirjalili, S.Z.; Mirjalili, S.; Saremi, S.; Faris, H.; Aljarah, I. Grasshopper optimization algorithm for multi-objective optimization problems. Appl. Intell. 2018, 48, 805–820. [Google Scholar] [CrossRef]
  63. Heidari, A.A.; Mirjalili, S.; Faris, H.; Aljarah, I.; Mafarja, M.; Chen, H. Harris hawks optimization: Algorithm and applications. Future Gener. Comput. Syst. 2019, 97, 849–872. [Google Scholar] [CrossRef]
  64. Mirjalili, S.; Lewis, A. The whale optimization algorithm. Adv. Eng. Softw. 2016, 95, 51–67. [Google Scholar] [CrossRef]
  65. Zhao, S.; Zhang, T.; Ma, S.; Chen, M. Dandelion Optimizer: A nature-inspired metaheuristic algorithm for engineering applications. Eng. Appl. Artif. Intell. 2022, 114, 105075. [Google Scholar] [CrossRef]
  66. Azizi, M.; Talatahari, S.; Gandomi, A.H. Fire Hawk Optimizer: A novel metaheuristic algorithm. Artif. Intell. Rev. 2022, 1–77. [Google Scholar] [CrossRef]
  67. Wu, G.; Mallipeddi, R.; Suganthan, P.N. Problem Definitions and Evaluation Criteria for the CEC 2017 Competition on Constrained Real-Parameter Optimization; Technical Report; National University of Defense Technology: Changsha, China; Kyungpook National University: Daegu, Korea; Nanyang Technological University: Singapore, 2017. [Google Scholar]
  68. Karimi, I.; Lee, D.Y. Multiproduct batch plant scheduling. In Vol. 6: Chemical Engineering Optimization Models with GAMS; CACHE: Notre Dame, IN, USA, 1991. [Google Scholar]
  69. Wang, Z.; Jia, X.P.; Shi, L. Optimization of multi-product batch plant design under uncertainty with environmental considerations. Clean Technol. Environ. Policy 2010, 12, 273–282. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.