# Chaotic Enhanced Genetic Algorithm for Solving the Nonlinear System of Equations

Authors: A. M. Algelany; M. A. El-Shorbagy
Journal: Computational Intelligence and Neuroscience
 (2022)

---

## Abstract

Many engineering and scientific models are based on the nonlinear system of equations (NSEs), and their effective solution is critical for development in these domains. NSEs can be modeled as an optimization problem. So, the goal of this paper is to propose an optimization method, to solve the NSEs, which is called a chaotic enhanced genetic algorithm (CEGA). CEGA is a chaotic noise-based genetic algorithm (GA) that improves performance. CEGA will be configured so that it uses a new definition which is chaotic noise to overcome the drawbacks of optimization methods such as lack of diversity of solutions, the imbalance between exploitation and exploration, and slow convergence of the best solution. The goal of chaotic noise is to reduce the number of repeated solutions and iterations to speed up the convergence rate. In the chaotic noise, the chaotic logistic map is utilized since it has been used by numerous researchers and has proven its efficiency in increasing the quality of solutions and providing the best performance. CEGA is tested using many well-known NSEs. The suggested algorithm's results are compared to the original GA to prove the importance of the modifications introduced in CEGA. Promising results were obtained, where CEGA’s average percentage of improvement was about 75.99, indicating that it is quite effective in solving NSEs. Finally, comparing CEGA’s results with previous studies, statistical analysis by Friedman and Wilcoxon’s tests demonstrated its superiority and ability to solve this kind of problem.


---

## Body

## 1. Introduction

Many models in engineering and science are based on the nonlinear system of equations (NSEs), and their solution is very critical for development in these fields. NSEs can be found directly in some applications, but they can also be found indirectly when practical models are transformed into NSEs [1]. Finding a robust and effective solution for the NSEs might be a difficult task in theory.The bisection technique, Muller’s method, false-position method, Levenberg–Marquardt algorithm, Broyden method, steepest descent methods, branch and prune approach, Halley’s method, Newton/damped Newton methods, and Secant method have traditionally been used to solve NSEs [2]. Secant and Newton are the methods of choice for solving NSEs in general. Some techniques, on the other hand, turn the NSEs into an optimization problem [3], which is subsequently solved using the augmented Lagrangian method [4]. These approaches are time-consuming, may diverge, are inefficient when solving a set of nonlinear equations, require a tedious process to calculate partial derivatives to build the Jacobian matrix, and are sensitive to initial conditions [5].Because of these constraints, the researchers used evolutionary algorithms (EAs) to solve NSEs. EAs are a sort of metaheuristic that is often used to address problems of optimization that are too difficult to solve using traditional methods. EAs such as the genetic algorithm (GA) [6–8], particle swarm algorithm (PSO) [9, 10], artificial bee colony (ABC) [11], cuckoo search algorithm (CSA) [12], and firefly algorithm (FA) [13] have been used to solve NSEs. In [6], Chang proposed a real-coded GA for solving the nonlinear system. In [7], Grosan and Abraham offered a novel approach based on GA for dealing with the problem of complex NSEs by recasting it as a multiobjective optimization problem. In [8], an efficient GA with symmetric and harmonic individuals was used to solve NSEs. Mo et al. in [9] presented a conjugate direction to PSO for addressing NSEs, which merges the conjugate direction method (CDM) into PSO to enhance it and enable for fast optimization of high-dimensional optimization problems. By moving the challenge of high-dimensional function optimization to low-dimensional, CDM aids PSO in avoiding local minima. Jaberipour et al. suggested a new version of PSO for solving NSEs, which is based on a novel way of updating each particle’s location and velocity [10]. To tackle the drawbacks of the classic PSO approach, such as trapping in local minima and delaying convergence, they changed the way each particle was updated. Also, Jia and He presented a hybrid ABC technique for solving NSEs in [11], which combined the ABC and PSO algorithms. The hybrid algorithm corrects the problem of sinking into a premature or local optimum by integrating the benefits of both strategies. Furthermore, in [12], Zhou and Li proposed an upgraded CSA to handle the NSEs. They employed a novel encoding strategy that ensures the provided solution is achievable without requiring the cuckoo’s evolution to be altered. Finally, in [13], enhanced FA to solve NSEs as an optimization problem is introduced by Ariyaratne et al. with several advantages such as eliminating the need for beginning assumptions, differentiation, or even function continuity and allowing it to provide many root estimates at the same time.The genetic algorithm (GA), based on natural selection, genetics, and evolution, was presented in 1975 [14] and described in 1989 [15] as a competent global strategy for tackling optimization problems. GA is well suited to solving optimization issues, and it continues to pique academics’ interest. According to the literature, GA was commonly used to solve NSEs, where Mangla et al., in [16], highlight flaws in existing approaches (Bisection, Regula Falsi, Newton–Raphson, Secant, Muller, and so on) and justify the GA’s application to NSEs while an approach for sorting out NSEs to solve them using the fixed-point method was proposed in [17], with the equations’ arrangement determined by a GA that works with a population of the possible resolution procedures for the system. In addition, in [18], Ji et al. presented an optimization approach based on clustering evolution for obtaining an optimum piecewise linear approximation of a set of nonlinear functions. The technique is built on a balance of approximation precision and simplicity, and it enhances the approximate linear with the fewest possible departments. In [19], a GA technique to solve NSEs for a variety of applications is presented, in which the roots of NSEs were approximated using population size, degree of mutation, crossover rate, and coefficient size. Also, a method for solving nonlinear equations using GA was given in [20]. Furthermore, in [21], evolutionary algorithms to solve NSEs were used, which were turned into an unconstrained optimization problem with some basic mathematical relations. Finally, in [22], a new intelligent computer strategy for solving nonlinear equations based on evolutionary computational approaches was proposed mainly based on variants of GAs. But, when it works with complex and massive systems, however, GA has some downsides, including being extremely slow and making it hard to identify the global optimal solution due to the increased number of iterations required or long search time.From this motivation, this study offers an algorithm that solves one of the most significant drawbacks with GA and all EAs which is the repeating of solutions during the optimization process, which wastes time. The proposed optimization algorithm is called a chaotic enhanced genetic algorithm (CEGA). Chaotic is a mathematical strategy that has been shown to improve the performance of numerous optimization algorithms. It has received a great deal of attention, and it has been applied in a range of domains including optimization [23]. The proposed CEGA is a combination between GA and chaotic noise. The chaotic noise is used when the solutions are repeated, during the optimization process of GA, to change the positions of the solutions chaotically. This combination aims to enhance GA by overcoming its drawbacks such as lack of diversity of solutions, the imbalance between exploitation and exploration, and slow convergence of the best solution.The major contributions of this paper include the following:(1)
Proposing a new methodology called a chaotic enhanced genetic algorithm (CEGA) to solve NSEs by using a combination between GA and chaotic noise(2)
Presenting sufficient diversity of the solutions, and preventing consuming time during the optimization process by overcoming repetition of solutions(3)
Ensuring improvement in every iteration by using chaotic noise and fast convergence to best solutions(4)
Testing CEGA by many well-known NSEs(5)
Using statistical tests to determine the relevance of the CEGA findings(6)
Showing that CEGA is competitive and better than other optimization algorithmsThe following is how the paper is structured. Section2 discusses nonlinear systems of equations. The proposed technique is detailed in Section 3. The numerical findings and discussions are shown in Sections 4 and 5, respectively. Section 6 concludes with observations and conclusions.


## 2. Nonlinear System of Equations

The mathematical definition of a nonlinear system of equations (NSEs) is(1)SNLE=f1z=0,f2z=0,⋮fQz=0,where z=z1,z2,…,zn is a vector of n components subset of ℝn, and fq∀q=1,2,…,Q are the nonlinear functions that translate the n-dimensional space ℝn’s vector z=z1,z2,…,zn to the real line. Some of the functions may be nonlinear, while others are linear. Finding a solution for NSEs entails finding a solution in which each of the Q functions above equals zero [24].Definition 1.
If∀q=1,...,Q, the functions fqz=0, then the solution z=z1∗,z2∗,…,zn∗ is called the optimal solution of the NSEs.
Many approaches [25–27] transform the NSEs into an unconstrained optimization problem by the inclusion of the left side of all equations and the use of the absolute value function as(2)Fz=absf1z+f2z+⋯+fQz,subject tof1z=0,f2z=0,⋮fQz=0,where Fz denotes the objective function. If all of the nonlinear equations are equal to zero fq=0∀q=1,...,Q, the objective function in (2) has a global minimum.


## 3. The Proposed Methodology

This section provides an overview of GA and chaos theory. The suggested CEGA is next presented in detail.


### 3.1. Genetic Algorithm

In 1975 and 1989, respectively, Holland and Goldberg proposed and defined the genetic algorithm (GA) as an optimization technique [14, 15]. GA begins with a collection of chromosomes (solutions). Then, using GA operators (selection, mutation, and crossover), a new set of chromosomes is generated (solutions). The freshly generated chromosomes will be of greater quality than the preceding generation. These procedures are repeated until the termination conditions are met. As a final solution, the best chromosome (solution) of the previous generation is offered. Figure 1 depicts the generic GA’s pseudocode.Figure 1
The pseudocode of the general GA.


### 3.2. Chaos Theory

Chaos theory is concerned with the behavior of systems that obey deterministic laws yet look random and unpredictable. Many elements of the optimization sciences have benefited from the mathematics of chaos theory. Chaos optimization algorithms have received a lot of attention as a novel method of global optimization because they are based on many chaotic maps, and the inherent characteristics of chaotic maps can improve optimization algorithms by allowing them to escape from local solutions and increase the convergence to reach the global solution. To increase solution quality, many researchers advocated integrating chaos theory and optimization algorithms [28–31]. Chaotic maps are maps (evolution functions) that display chaotic behavior and typically take the form of iterated functions. Many well-known chaotic maps may be found in the literature, including the sinusoidal map, Chebyshev map, singer map, tent map, sine map, circle map, Gauss map, and logistic map.


### 3.3. Chaotic Enhanced Genetic Algorithm

In this subsection, the proposed chaotic enhanced genetic algorithm (CEGA) will be described, which is an integration between GA and chaos theory. CEGA be configured so that it uses chaotic noise to overcome any limitations that can be appearing during optimization by GA such as lack of diversity of solutions, the imbalance between exploitation and exploration, and slow convergence of the best solution. CEGA operates in two phases: in the first one, the genetic algorithm is implemented as a global optimization system to solve the NSEs. If the best solution is repeated during the GA optimization process, the chaotic noise is employed as the second phase. Chaotic noise tries to show a sufficient diversity of solutions while preventing time consumption during the optimization process by overcoming the repetition of the best solution and reducing the number of iterations. The following is a full description of the suggested algorithm:Step 1: initialization(i)
Individuals of the population (inn-dimensions) are created with random placements in the search domain and the number of iterations set to one t=1(ii)
The fitness functionFz is assessed for each individual(iii)
Assign the best individual to the best positionBest^tStep 2: evolution by GA (t=t+1)(i)
Ranking [32]: individuals are ranked based on their fitness value, and a vector containing the corresponding individual fitness value is returned, allowing the selection process to compute survival probabilities.(ii)
Tournament selection (TS) [33]: many solutions (individuals) are chosen at random from the population, and the best of these solutions is chosen to be a parent. This process is performed as many times as necessary to choose parents.(iii)
BLX-α crossover operator [34]: two-parent candidate solutions with n design variables, X=x1,x2,…,xn and Y=y1,y2,…,yn, are chosen with crossover probability Pc. The BLX-α operator creates the k-th component of a new offspring W. The k-th component of W is a uniform random scalar in the range minxk,yk−αI,maxxk,yk+αI, where I defines the distance between parent candidates given by I=maxxk,yk−minxk,yk and a is a user-defined parameter.The BLX-α efficacy comes from its capacity to seek in a space domain that is not always constrained by the parents. Furthermore, because the search space is dependent on the distance between the parents, the GA is self-adaptive. The parameter α must be chosen carefully since it quantitatively specifies the search domain. Based on the findings of Herrera et al. [35], we choose α=0.5 in this investigation.(iv)
Real-valued mutation [36]: randomly generated values are added to the variables for each new offspring with a low probability (Pm) as follows:(3)VariMut=Vari±si⋅ri⋅ai,i∈1,2,…,n,uniform at randomwheresi∈−1,+1 uniform at random, ri=r⋅domaini,r is mutation range (standard: 10%), ai=2−u⋅m,u∈0,1 uniform at random, and m is mutation precision.(v)
Elitist strategy: the best individuals in the generationt−1 are directly added to the new generation t.(vi)
Evaluation: for each individual,Fz is evaluated to find the new best position Best^t.(vii)
Updating: if the new best positionBest^t is worse than or equal to the previous best position Best^t−1, go to Step 3. Otherwise, continue by updating the best position as the best individual position discovered so far as Best^t.(viii)
Termination criteria: the proposed algorithm is terminated when the maximum number of iterations is achieved or when the individual convergences. Convergence happens when the locations of all individuals in the population are identical. Finally, put out the optimal solution as the best individual positionBest^t.Step 3: chaotic noise(i)
Chaotic noise: chaotic noise is applied if the best solution is repeated during the GA optimization process. It tries to show a sufficient diversity of solutions while preventing time consumption during the optimization process by overcoming the repetition of the best solution and reducing the number of iterations. In this step, the population at generationtPOPt is changed by chaotic noise as follows:(4)POPt=ϑ.POPt,whereϑ is a chaotic random number generated by the logistic map by using the following equation:(5)ϑq=4ϑq−11−ϑq−1,ϑ0∈0,1,ϑ0∉0.0,0.25,0.50,0.75,1.0.The logistic map, according to the results in [37], improves the quality of the solutions and provides the best performance.(ii)
Evaluation: for each individual inPOPt, Fz is evaluated to find the new best position Best^t.(iii)
Updating: if the new best positionBest^t is better than the previous best position Best^t−1, update the best position Best^t+1 as the best individual’s position found so far and continue and go to Step 2. Otherwise, repeat Step 3.Figure2 depicts the suggested algorithm’s pseudocode.Figure 2
The pseudocode of the proposed algorithm.


## 3.1. Genetic Algorithm

In 1975 and 1989, respectively, Holland and Goldberg proposed and defined the genetic algorithm (GA) as an optimization technique [14, 15]. GA begins with a collection of chromosomes (solutions). Then, using GA operators (selection, mutation, and crossover), a new set of chromosomes is generated (solutions). The freshly generated chromosomes will be of greater quality than the preceding generation. These procedures are repeated until the termination conditions are met. As a final solution, the best chromosome (solution) of the previous generation is offered. Figure 1 depicts the generic GA’s pseudocode.Figure 1
The pseudocode of the general GA.


## 3.2. Chaos Theory

Chaos theory is concerned with the behavior of systems that obey deterministic laws yet look random and unpredictable. Many elements of the optimization sciences have benefited from the mathematics of chaos theory. Chaos optimization algorithms have received a lot of attention as a novel method of global optimization because they are based on many chaotic maps, and the inherent characteristics of chaotic maps can improve optimization algorithms by allowing them to escape from local solutions and increase the convergence to reach the global solution. To increase solution quality, many researchers advocated integrating chaos theory and optimization algorithms [28–31]. Chaotic maps are maps (evolution functions) that display chaotic behavior and typically take the form of iterated functions. Many well-known chaotic maps may be found in the literature, including the sinusoidal map, Chebyshev map, singer map, tent map, sine map, circle map, Gauss map, and logistic map.


## 3.3. Chaotic Enhanced Genetic Algorithm

In this subsection, the proposed chaotic enhanced genetic algorithm (CEGA) will be described, which is an integration between GA and chaos theory. CEGA be configured so that it uses chaotic noise to overcome any limitations that can be appearing during optimization by GA such as lack of diversity of solutions, the imbalance between exploitation and exploration, and slow convergence of the best solution. CEGA operates in two phases: in the first one, the genetic algorithm is implemented as a global optimization system to solve the NSEs. If the best solution is repeated during the GA optimization process, the chaotic noise is employed as the second phase. Chaotic noise tries to show a sufficient diversity of solutions while preventing time consumption during the optimization process by overcoming the repetition of the best solution and reducing the number of iterations. The following is a full description of the suggested algorithm:Step 1: initialization(i)
Individuals of the population (inn-dimensions) are created with random placements in the search domain and the number of iterations set to one t=1(ii)
The fitness functionFz is assessed for each individual(iii)
Assign the best individual to the best positionBest^tStep 2: evolution by GA (t=t+1)(i)
Ranking [32]: individuals are ranked based on their fitness value, and a vector containing the corresponding individual fitness value is returned, allowing the selection process to compute survival probabilities.(ii)
Tournament selection (TS) [33]: many solutions (individuals) are chosen at random from the population, and the best of these solutions is chosen to be a parent. This process is performed as many times as necessary to choose parents.(iii)
BLX-α crossover operator [34]: two-parent candidate solutions with n design variables, X=x1,x2,…,xn and Y=y1,y2,…,yn, are chosen with crossover probability Pc. The BLX-α operator creates the k-th component of a new offspring W. The k-th component of W is a uniform random scalar in the range minxk,yk−αI,maxxk,yk+αI, where I defines the distance between parent candidates given by I=maxxk,yk−minxk,yk and a is a user-defined parameter.The BLX-α efficacy comes from its capacity to seek in a space domain that is not always constrained by the parents. Furthermore, because the search space is dependent on the distance between the parents, the GA is self-adaptive. The parameter α must be chosen carefully since it quantitatively specifies the search domain. Based on the findings of Herrera et al. [35], we choose α=0.5 in this investigation.(iv)
Real-valued mutation [36]: randomly generated values are added to the variables for each new offspring with a low probability (Pm) as follows:(3)VariMut=Vari±si⋅ri⋅ai,i∈1,2,…,n,uniform at randomwheresi∈−1,+1 uniform at random, ri=r⋅domaini,r is mutation range (standard: 10%), ai=2−u⋅m,u∈0,1 uniform at random, and m is mutation precision.(v)
Elitist strategy: the best individuals in the generationt−1 are directly added to the new generation t.(vi)
Evaluation: for each individual,Fz is evaluated to find the new best position Best^t.(vii)
Updating: if the new best positionBest^t is worse than or equal to the previous best position Best^t−1, go to Step 3. Otherwise, continue by updating the best position as the best individual position discovered so far as Best^t.(viii)
Termination criteria: the proposed algorithm is terminated when the maximum number of iterations is achieved or when the individual convergences. Convergence happens when the locations of all individuals in the population are identical. Finally, put out the optimal solution as the best individual positionBest^t.Step 3: chaotic noise(i)
Chaotic noise: chaotic noise is applied if the best solution is repeated during the GA optimization process. It tries to show a sufficient diversity of solutions while preventing time consumption during the optimization process by overcoming the repetition of the best solution and reducing the number of iterations. In this step, the population at generationtPOPt is changed by chaotic noise as follows:(4)POPt=ϑ.POPt,whereϑ is a chaotic random number generated by the logistic map by using the following equation:(5)ϑq=4ϑq−11−ϑq−1,ϑ0∈0,1,ϑ0∉0.0,0.25,0.50,0.75,1.0.The logistic map, according to the results in [37], improves the quality of the solutions and provides the best performance.(ii)
Evaluation: for each individual inPOPt, Fz is evaluated to find the new best position Best^t.(iii)
Updating: if the new best positionBest^t is better than the previous best position Best^t−1, update the best position Best^t+1 as the best individual’s position found so far and continue and go to Step 2. Otherwise, repeat Step 3.Figure2 depicts the suggested algorithm’s pseudocode.Figure 2
The pseudocode of the proposed algorithm.


## 4. Numerical Results

Four systems of nonlinear equations are solved to assess the suggested method. These four test systems are common challenges that have been explored by other researchers and are known as benchmarks. The proposed algorithm is coded in MATLAB R2012b and implemented on the PC with Intel(R) Core(TM) i7-6600U CPU @ 2.60 GHz, 16 GB RAM, and Windows 10 operating system. The results will be compared to those obtained by the original GA to demonstrate the benefits of the suggested modifications and their impact on achieving an optimal solution.For computational studies, a population size equal to 20, generation gap (GGAP) is 0.9, crossover probabilityPc is 0.8, and mutation probability Pm is 0.02. Also, the termination criterion for CEGA is defined as(6)δ=Foptimum−Ft≤ε=1e−20.Foptimum is the optimum value of the objective function which is 0 in all nonlinear system cases while Ft is the calculated objective function at each iteration t. It should be noted that the maximum number of iterations for both algorithms (original GA and CEGA) is the same, and all results are recorded from the first run. Furthermore, when one of them meets the termination requirement, the computations stop and the number of used iterations is reported. Finally, to statistically evaluate the CEGA compared to other algorithms, the Friedman test and Wilcoxon rank-sum test are executed here.


### 4.1. Benchmark 1: Experiment Test

This benchmark problem can be described as [7](7)f1z1,z2=cos2z1−cos2z2−0.4=0,f2z1,z2=2z2−z1+sin2z2−sin2z1−1.2=0,z1∈−10,10,z2∈−10,10.This benchmark is solved by many algorithms such as Newton’s method, Secant’s method, evolutionary algorithm approach (EAA) [7], genetic algorithms (GAs) [21], and hybridization of grasshopper optimization algorithm with genetic algorithm (hybrid-GOA-GA) [38]. Table 1 shows a comparison between the best function value F obtained by such algorithms, original GA, and the proposed CEGA. The convergence curves of the best Fz achieved so far using original GA and CEGA are shown in Figure 3.Table 1
Results for benchmark 1, Experiment test.
Methodz1,z2f1,f2FzNo. of iterationsNewton’s method(0.15, 0.49)(0.00168, 0.01497)0.0083NASecant’s method(0.15, 0.49)(0.00168, 0.01497)0.0083NAEAA(0.15722, 49458)(0.001264, 0.000969)0.0011150GAs(0.156522, 0.49338)(4.8606E − 06, 3.7164E − 06)4.2885E − 0610Hybrid-GOA-GA(0.680235945188233, 2.25999176017399)(2.2840E − 06, 1.2967E − 06)1.7904E − 06300Original GA(−2.98506954610277, −2.64821484596259)(5.2059E − 07, 7.4084E − 06)3.9645E − 06300CEGA(−9.26825582324219, −8.93140064444864)(2.9827E − 07, 5.1472E − 06)2.7227E − 0611Figure 3
Benchmark 1: the convergence curves of the bestFz achieved so far by original GA and CEGA.


### 4.2. Benchmark 2: Arithmetic Application

This benchmark problem can be described as [7](8)f1z=z1−0.254287220−0.18324757×z4z3z9=0,f2z=z2−0.378421970−0.16275449×z1z10z6=0,f3z=z3−0.271625770−0.16955071×z1z2z10=0,f4z=z4−0.198079140−0.15585316×z7z1z6=0,f5z=z5−0.441667280−0.19950920×x7x6x3=0,f6z=z6−0.146541130−0.18922793×z8z5z10=0,f7z=z7−0.429371610−0.21180486×z2x5x8=0,f8z=z8−0.070564380−0.17081208×z1z7z6=0,f9z=z9−0.345049060−0.19612740×z10z6z8=0,f10z=z10−0.426511020−0.21466544×z4z8z1=0,−10≤z1,…,z10≤10.This benchmark is solved by many algorithms as the EAA [7], GAs [21], and hybrid-GOA-GA [38]. Table 2 shows a comparison between the best function value F obtained by such algorithms, original GA, and the proposed CEGA while the convergence curves of the best Fz achieved so far using original GA and CEGA are shown in Figure 4.Table 2
Results for benchmark 2, Arithmetic application.
Methodz1⟶z10f1⟶f10FzNo. of iterationsEAAz10.2077500302f10.04649430.2344300z20.0299198492f20.3489889z3−0.0339491324f30.3058418z4−0.2027950317f40.4012915z50.2131771707f50.2284027z60.0568458067f60.0886970z70.2267650517f70.2024745z8−0.0977041236f80.1687259z9−0.0339921200f90.3787652z100.2532921324f100.1741025GAsz12.5783339E − 01f1−7.3844E − 101.2674E − 0910z23.8109715E − 01f2−1.1684E − 12z32.7874502E − 01f31.7931E − 09z42.0066896E − 01f4−8.8837E − 10z54.4525142E − 01f5−4.5866E − 10z61.4918391E − 01f6−5.270E − 09z74.3200969E − 01f7−6.3852E − 09z87.3402777E − 02f8−9.7362E − 10z93.4596683E − 01f9−6.0389E − 11z104.2732628E − 01f103.0841E − 10Hybrid-GOA-GAz10.2578333f11.2656E − 121.7220E − 121200z20.3810971f27.9096E − 14z30.2787450f31.7517E − 12z40.2006689f44.5315E − 12z50.4452514f51.1361E − 12z60.1491839f62.2230E − 12z70.4320096f71.4795E − 12z80.0734027f86.5123E − 13z90.3459668f93.5476E − 12z100.4273262f105.5468E − 13Original GAz10.257833393700735f12.6685E − 131.7873E − 121200z20.381097154600942f21.8415E − 12z30.278745017345425f31.0000E − 12z40.200668964224041f41.3058E − 12z50.445251424840196f58.3411E − 13z60.149183919967650f61.8859E − 12z70.432009698988807f74.9226E − 12z80.0734027777813010f85.0493E − 12z90.345966826875570f93.8700E − 14z100.427326275994071f107.2846E − 13CEGAz10.257833393700561f15.7399E − 143.0855E − 14272z20.381097154602820f21.2136E − 14z30.278745017346455f31.3031E − 14z40.200668964225329f41.5905E − 14z50.445251424841115f57.1657E − 14z60.149183919969369f61.4279E − 14z70.432009698983808f78.7737E − 14z80.0734027777762290f82.1295E − 14z90.345966826875559f94.9712E − 15z100.427326275993280f101.0141E − 14Figure 4
Benchmark 2: the convergence curves of the bestFz achieved so far by original GA and CEGA.


### 4.3. Benchmark 3: Combustion Application

This benchmark problem can be described as [7](9)f1z=z2+2z6+z9+2z10−10−5=0,f2z=z3+z8−3×10−5=0,f3z=z1+z3+2z5+2z8+z9+z10−5×10−5=0,f4z=z4+2z7−10−5=0,f5z=0.5140437×107z5−z12=0,f6z=0.1006932×10−6x6−2z22=0,f7z=0.7816278×10−15z7−z42=0,f8z=0.1496236×10−6z8−z1z3=0,f9z=0.6194411×10−7z9−z1z2=0,f10z=0.2089296×10−14z10−z1z22=0,−10≤z1,z2,…,z10≤10.This benchmark is solved by many algorithms as the EAA [7], GAs [21], and hybrid-GOA-GA [38]. Table 3 shows a comparison between the best function value F obtained by such algorithms, original GA, and the proposed CEGA, while Figure 5 shows the convergence curves of the best F obtained so far by original GA and CEGA.Table 3
Results for benchmark 3, Combustion application.
Methodz1⟶z10f1⟶f10FzNo. of iterationsEAAz12.8724570E − 4f1−9.0156756E − 5−1.8038E − 05300z24.6449359E − 004f2−3.3881318E − 021z3−3.8722475E − 006f3−5.9848143E − 008z45.7046411E − 005f4−9.0000000E − 005z51.2033492e + 000f5−2.0652682E − 008z63.2144041e + 000f6−1.0783996E − 007z7−2.3523205E − 005f7−3.2542930E − 009z83.3872248E − 005f81.1173545E − 009z91.6152635e + 000f9−3.3367727E − 008GAsz17.7944699E − 5f1−9.0000000E − 5−1.8034E − 0570z22.3453123E − 4f2−4.7433845E − 20z35.6870072E − 8f3−5.5091023E − 18z4−5.1124010E − 4f4−9.0000000E − 5z51.1665683E − 1f5−7.8705351E − 11z63.6717284E − 1f6−7.3037986E − 8z72.6062005E − 4f7−2.6136644E − 7z82.9943130E − 5f84.7478263E − 14z92.6776713E − 1f9−1.6938693E − 9z10−5.0116867E − 1f10−4.2883872E − 12z10−4.0222631e + 000f10−6.1982897E − 011Hybrid-GOA-GAz11.5541664E − 9f18.5611E − 121.2499E − 09300z24.6710388E − 6f21.2440E − 08z32.9852019E − 5f31.9449E − 14z41.7239638E − 10f46.6138E − 12z59.8332225E − 6f55.0547E − 13z62.5029647E − 6f64.3385E − 11z74.9999104E − 6f72.5812E − 20z81.3554000E − 7f82.6115E − 14z99.4779067E − 8f91.3886E − 15z101.1412198E − 7f103.3671E − 20Original GAz10.000131595492467185f11.2576E − 047.4518E − 05300z28.25174833157296E − 05f21.0366E − 04z3−2.16100194956660f31.5119E − 04z4−0.00728929937743800f42.6026E − 05z5−2.84721332483602f51.6368E − 07z6−4.25864110800585f64.4243E − 07z70.00363663681060500f75.3134E − 05z82.16113561379106f82.8470E − 04z9−1.45063000953809f91.0072E − 07z104.98385697563882f108.8564E − 13CEGAz11.15278259019717E − 06f15.7802E − 114.5300E − 09183z29.06471796614326E − 06f24.4498E − 08z31.56300393104332E − 05f34.5304E − 10z47.01041293845308E − 06f44.9701E − 11z52.11248562801178E − 06f51.2203E − 12z61.28545186382671E − 07f61.6433E − 10z71.49481838115443E − 06f74.9146E − 11z81.43254622355700E − 05f81.5875E − 11z95.33696042558367E − 09f91.0449E − 11z103.36398449219863E − 07f109.4722E − 17Figure 5
Benchmark 3: the convergence curves of the bestFz achieved so far by original GA and CEGA.


### 4.4. Benchmark 4: Neurophysiology Application

This benchmark problem can be described as [7](10)f1=z12+z32−1=0,f2=z22+z42−1=0,f3=z5z33+z6z43=0,f4=z5z13+z6z23=0,f5=z5z1z32+z6z42z2=0,f6=z5z12z3+z6z22z4=0,−10≤z1,z2,...,z6≤10.This benchmark is solved by many algorithms as the EAA [7], GAs [21], and hybrid-GOA-GA [38]. Table 4 shows a comparison between the best function value F obtained by such algorithms, original GA, and the proposed CEGA while Figure 6 shows the convergence curves of the best F obtained so far by original GA and CEGA.Table 4
Results for benchmark 4, Neurophysiology application.
Methodz1⟶z6f1⟶f6FzNo. of iterationsEAAz17.0148122E − 001f11.1532022E − 0093.7764E − 10200z27.5925767E − 001f22.6058267E − 011z3−7.1268794E − 001f3−6.5553074E − 010z46.5079013E − 001f41.1783451E − 009z52.4122542E − 009f51.1134504E − 009z67.8977724E − 010f6−5.4967453E − 010GAsz13.2484137E − 001f11.5105117E − 0105.2127E − 1120z23.2484137E − 001f21.5114510E − 010z39.4576852E − 001f3−1.2749912E − 011z49.4576852E − 001f44.6365863E − 012z5−5.6887875E − 001f51.0181522E − 011z65.6887875E − 001f68.4981744E − 012Hybrid-GOA-GAz10.0820223613267075f16.9593E − 117.0908E − 111000z2−0.138287000903135f23.1647E − 11z3−0.996630489354999f33.3110E − 12z40.990392197774631f49.6123E − 12z54.48130330622387E − 09f52.5478E − 10z64.56992671931472E − 09f65.6505E − 11Original GAz10.00459210535797400f13.8965E − 118.3319E − 061000z2−0.0140392033441710f28.6758E − 11z30.999989456248088f33.3069E − 11z4−0.999901445571622f41.3870E − 08z5−0.00519291646053100f54.9063E − 05z6−0.00519428784572100f69.1419E − 07CEGAz10.132104801350580f11.9783E − 111.0693E − 1187z20.225320570231597f21.2026E − 11z3−0.991235754742487f31.6804E − 11z4−0.974284681506633f41.2213E − 12z5−1.46708097455544E − 10f51.0116E − 11z61.36330007947428E − 10f64.2055E − 12Figure 6
Benchmark 4: the convergence curves of the bestFz achieved so far by original GA and CEGA.


## 4.1. Benchmark 1: Experiment Test

This benchmark problem can be described as [7](7)f1z1,z2=cos2z1−cos2z2−0.4=0,f2z1,z2=2z2−z1+sin2z2−sin2z1−1.2=0,z1∈−10,10,z2∈−10,10.This benchmark is solved by many algorithms such as Newton’s method, Secant’s method, evolutionary algorithm approach (EAA) [7], genetic algorithms (GAs) [21], and hybridization of grasshopper optimization algorithm with genetic algorithm (hybrid-GOA-GA) [38]. Table 1 shows a comparison between the best function value F obtained by such algorithms, original GA, and the proposed CEGA. The convergence curves of the best Fz achieved so far using original GA and CEGA are shown in Figure 3.Table 1
Results for benchmark 1, Experiment test.
Methodz1,z2f1,f2FzNo. of iterationsNewton’s method(0.15, 0.49)(0.00168, 0.01497)0.0083NASecant’s method(0.15, 0.49)(0.00168, 0.01497)0.0083NAEAA(0.15722, 49458)(0.001264, 0.000969)0.0011150GAs(0.156522, 0.49338)(4.8606E − 06, 3.7164E − 06)4.2885E − 0610Hybrid-GOA-GA(0.680235945188233, 2.25999176017399)(2.2840E − 06, 1.2967E − 06)1.7904E − 06300Original GA(−2.98506954610277, −2.64821484596259)(5.2059E − 07, 7.4084E − 06)3.9645E − 06300CEGA(−9.26825582324219, −8.93140064444864)(2.9827E − 07, 5.1472E − 06)2.7227E − 0611Figure 3
Benchmark 1: the convergence curves of the bestFz achieved so far by original GA and CEGA.


## 4.2. Benchmark 2: Arithmetic Application

This benchmark problem can be described as [7](8)f1z=z1−0.254287220−0.18324757×z4z3z9=0,f2z=z2−0.378421970−0.16275449×z1z10z6=0,f3z=z3−0.271625770−0.16955071×z1z2z10=0,f4z=z4−0.198079140−0.15585316×z7z1z6=0,f5z=z5−0.441667280−0.19950920×x7x6x3=0,f6z=z6−0.146541130−0.18922793×z8z5z10=0,f7z=z7−0.429371610−0.21180486×z2x5x8=0,f8z=z8−0.070564380−0.17081208×z1z7z6=0,f9z=z9−0.345049060−0.19612740×z10z6z8=0,f10z=z10−0.426511020−0.21466544×z4z8z1=0,−10≤z1,…,z10≤10.This benchmark is solved by many algorithms as the EAA [7], GAs [21], and hybrid-GOA-GA [38]. Table 2 shows a comparison between the best function value F obtained by such algorithms, original GA, and the proposed CEGA while the convergence curves of the best Fz achieved so far using original GA and CEGA are shown in Figure 4.Table 2
Results for benchmark 2, Arithmetic application.
Methodz1⟶z10f1⟶f10FzNo. of iterationsEAAz10.2077500302f10.04649430.2344300z20.0299198492f20.3489889z3−0.0339491324f30.3058418z4−0.2027950317f40.4012915z50.2131771707f50.2284027z60.0568458067f60.0886970z70.2267650517f70.2024745z8−0.0977041236f80.1687259z9−0.0339921200f90.3787652z100.2532921324f100.1741025GAsz12.5783339E − 01f1−7.3844E − 101.2674E − 0910z23.8109715E − 01f2−1.1684E − 12z32.7874502E − 01f31.7931E − 09z42.0066896E − 01f4−8.8837E − 10z54.4525142E − 01f5−4.5866E − 10z61.4918391E − 01f6−5.270E − 09z74.3200969E − 01f7−6.3852E − 09z87.3402777E − 02f8−9.7362E − 10z93.4596683E − 01f9−6.0389E − 11z104.2732628E − 01f103.0841E − 10Hybrid-GOA-GAz10.2578333f11.2656E − 121.7220E − 121200z20.3810971f27.9096E − 14z30.2787450f31.7517E − 12z40.2006689f44.5315E − 12z50.4452514f51.1361E − 12z60.1491839f62.2230E − 12z70.4320096f71.4795E − 12z80.0734027f86.5123E − 13z90.3459668f93.5476E − 12z100.4273262f105.5468E − 13Original GAz10.257833393700735f12.6685E − 131.7873E − 121200z20.381097154600942f21.8415E − 12z30.278745017345425f31.0000E − 12z40.200668964224041f41.3058E − 12z50.445251424840196f58.3411E − 13z60.149183919967650f61.8859E − 12z70.432009698988807f74.9226E − 12z80.0734027777813010f85.0493E − 12z90.345966826875570f93.8700E − 14z100.427326275994071f107.2846E − 13CEGAz10.257833393700561f15.7399E − 143.0855E − 14272z20.381097154602820f21.2136E − 14z30.278745017346455f31.3031E − 14z40.200668964225329f41.5905E − 14z50.445251424841115f57.1657E − 14z60.149183919969369f61.4279E − 14z70.432009698983808f78.7737E − 14z80.0734027777762290f82.1295E − 14z90.345966826875559f94.9712E − 15z100.427326275993280f101.0141E − 14Figure 4
Benchmark 2: the convergence curves of the bestFz achieved so far by original GA and CEGA.


## 4.3. Benchmark 3: Combustion Application

This benchmark problem can be described as [7](9)f1z=z2+2z6+z9+2z10−10−5=0,f2z=z3+z8−3×10−5=0,f3z=z1+z3+2z5+2z8+z9+z10−5×10−5=0,f4z=z4+2z7−10−5=0,f5z=0.5140437×107z5−z12=0,f6z=0.1006932×10−6x6−2z22=0,f7z=0.7816278×10−15z7−z42=0,f8z=0.1496236×10−6z8−z1z3=0,f9z=0.6194411×10−7z9−z1z2=0,f10z=0.2089296×10−14z10−z1z22=0,−10≤z1,z2,…,z10≤10.This benchmark is solved by many algorithms as the EAA [7], GAs [21], and hybrid-GOA-GA [38]. Table 3 shows a comparison between the best function value F obtained by such algorithms, original GA, and the proposed CEGA, while Figure 5 shows the convergence curves of the best F obtained so far by original GA and CEGA.Table 3
Results for benchmark 3, Combustion application.
Methodz1⟶z10f1⟶f10FzNo. of iterationsEAAz12.8724570E − 4f1−9.0156756E − 5−1.8038E − 05300z24.6449359E − 004f2−3.3881318E − 021z3−3.8722475E − 006f3−5.9848143E − 008z45.7046411E − 005f4−9.0000000E − 005z51.2033492e + 000f5−2.0652682E − 008z63.2144041e + 000f6−1.0783996E − 007z7−2.3523205E − 005f7−3.2542930E − 009z83.3872248E − 005f81.1173545E − 009z91.6152635e + 000f9−3.3367727E − 008GAsz17.7944699E − 5f1−9.0000000E − 5−1.8034E − 0570z22.3453123E − 4f2−4.7433845E − 20z35.6870072E − 8f3−5.5091023E − 18z4−5.1124010E − 4f4−9.0000000E − 5z51.1665683E − 1f5−7.8705351E − 11z63.6717284E − 1f6−7.3037986E − 8z72.6062005E − 4f7−2.6136644E − 7z82.9943130E − 5f84.7478263E − 14z92.6776713E − 1f9−1.6938693E − 9z10−5.0116867E − 1f10−4.2883872E − 12z10−4.0222631e + 000f10−6.1982897E − 011Hybrid-GOA-GAz11.5541664E − 9f18.5611E − 121.2499E − 09300z24.6710388E − 6f21.2440E − 08z32.9852019E − 5f31.9449E − 14z41.7239638E − 10f46.6138E − 12z59.8332225E − 6f55.0547E − 13z62.5029647E − 6f64.3385E − 11z74.9999104E − 6f72.5812E − 20z81.3554000E − 7f82.6115E − 14z99.4779067E − 8f91.3886E − 15z101.1412198E − 7f103.3671E − 20Original GAz10.000131595492467185f11.2576E − 047.4518E − 05300z28.25174833157296E − 05f21.0366E − 04z3−2.16100194956660f31.5119E − 04z4−0.00728929937743800f42.6026E − 05z5−2.84721332483602f51.6368E − 07z6−4.25864110800585f64.4243E − 07z70.00363663681060500f75.3134E − 05z82.16113561379106f82.8470E − 04z9−1.45063000953809f91.0072E − 07z104.98385697563882f108.8564E − 13CEGAz11.15278259019717E − 06f15.7802E − 114.5300E − 09183z29.06471796614326E − 06f24.4498E − 08z31.56300393104332E − 05f34.5304E − 10z47.01041293845308E − 06f44.9701E − 11z52.11248562801178E − 06f51.2203E − 12z61.28545186382671E − 07f61.6433E − 10z71.49481838115443E − 06f74.9146E − 11z81.43254622355700E − 05f81.5875E − 11z95.33696042558367E − 09f91.0449E − 11z103.36398449219863E − 07f109.4722E − 17Figure 5
Benchmark 3: the convergence curves of the bestFz achieved so far by original GA and CEGA.


## 4.4. Benchmark 4: Neurophysiology Application

This benchmark problem can be described as [7](10)f1=z12+z32−1=0,f2=z22+z42−1=0,f3=z5z33+z6z43=0,f4=z5z13+z6z23=0,f5=z5z1z32+z6z42z2=0,f6=z5z12z3+z6z22z4=0,−10≤z1,z2,...,z6≤10.This benchmark is solved by many algorithms as the EAA [7], GAs [21], and hybrid-GOA-GA [38]. Table 4 shows a comparison between the best function value F obtained by such algorithms, original GA, and the proposed CEGA while Figure 6 shows the convergence curves of the best F obtained so far by original GA and CEGA.Table 4
Results for benchmark 4, Neurophysiology application.
Methodz1⟶z6f1⟶f6FzNo. of iterationsEAAz17.0148122E − 001f11.1532022E − 0093.7764E − 10200z27.5925767E − 001f22.6058267E − 011z3−7.1268794E − 001f3−6.5553074E − 010z46.5079013E − 001f41.1783451E − 009z52.4122542E − 009f51.1134504E − 009z67.8977724E − 010f6−5.4967453E − 010GAsz13.2484137E − 001f11.5105117E − 0105.2127E − 1120z23.2484137E − 001f21.5114510E − 010z39.4576852E − 001f3−1.2749912E − 011z49.4576852E − 001f44.6365863E − 012z5−5.6887875E − 001f51.0181522E − 011z65.6887875E − 001f68.4981744E − 012Hybrid-GOA-GAz10.0820223613267075f16.9593E − 117.0908E − 111000z2−0.138287000903135f23.1647E − 11z3−0.996630489354999f33.3110E − 12z40.990392197774631f49.6123E − 12z54.48130330622387E − 09f52.5478E − 10z64.56992671931472E − 09f65.6505E − 11Original GAz10.00459210535797400f13.8965E − 118.3319E − 061000z2−0.0140392033441710f28.6758E − 11z30.999989456248088f33.3069E − 11z4−0.999901445571622f41.3870E − 08z5−0.00519291646053100f54.9063E − 05z6−0.00519428784572100f69.1419E − 07CEGAz10.132104801350580f11.9783E − 111.0693E − 1187z20.225320570231597f21.2026E − 11z3−0.991235754742487f31.6804E − 11z4−0.974284681506633f41.2213E − 12z5−1.46708097455544E − 10f51.0116E − 11z61.36330007947428E − 10f64.2055E − 12Figure 6
Benchmark 4: the convergence curves of the bestFz achieved so far by original GA and CEGA.


## 5. Discussions

Tables1–4 show the results of all algorithms for the four benchmark problems in terms of the best-obtained solution and the number of iterations. We can observe, for the 1st benchmark problem (experiment test), that hybrid-GOA-GA [38] surpassed the other algorithms in reaching the lowest value of Fz, which is 1.7904E − 06, but in the number of iterations of 300 while the proposed CEGA obtained a solution very close to the solution obtained by hybrid-GOA-GA, which is 2.7227E − 06, but in only 11 iterations. For the 2nd benchmark problem (arithmetic application), we find that the proposed CEGA outperformed the rest of the algorithms in obtaining the lowest value of Fz, which is 3.0855E − 14, in 272 iterations, while GAs [21] got an acceptable solution, which is 1.2674E − 09, in the least number of iterations, which is 10. For the 3rd benchmark problem (combustion application), we find that hybrid-GOA-GA [38] outperformed the rest of the algorithms in obtaining the lowest value of Fz, which is 1.2499E − 09, in 300 iterations. CEGA got an acceptable solution, which is 4.5300E − 09, in an acceptable number of iterations, which is 183, while GAs [21] obtained a reasonable solution, which is 1.8034E − 05, in the fewest number of iterations, which is 70. Finally, for the 4th benchmark problem (Neurophysiology application), we find that the proposed CEGA outperformed the rest of the algorithms in obtaining the lowest value of Fz, which is 1.0693E − 11, in 87 iterations, while GAs [21] got an acceptable solution, which is 5.2127E − 11, in the least number of iterations, which is 20.On the other hand, we can see that the original GA’ convergence curves had several straight portions, which reflect periods of nonimproving in the objective function owing to entrapment in a local minimum as seen in Figures3–6, while for CEGA, it is clear that the chaotic noise was successful in permanently improving the objective function and not repeating solutions or spending time on iterations that did not enhance the objective function. The following percentage relationship (IMP%) is used to indicate the improvement between the original GA and the proposed CEGA algorithm:(11)IMP%=original GA iterations−CEGA iterationsoriginal GA iterations×100.As indicated in Table5, CEGA improved all results significantly by 75.99% on average. So, we can say that chaotic noise guides GA to eliminate the local minimum and enhance the search results, reducing the number of iterations and, as a result, time, by preventing iterations from being used without improvement or convergence to the best solution.Table 5
Percentage improvement between the original GA and the proposed CEGA.
Benchmark problemOriginal GACEGAIMP% (%)Average IMP% (%)Benchmark 1, experiment test3001196.3375.99Benchmark 2, arithmetic application120027277.33Benchmark 3, combustion application30018339Benchmark 4, neurophysiology application10008791.3The EAA [7], GAs [21], hybrid-GOA-GA [38], original GA, and the proposed CEGA solved the 4 benchmark problems. Therefore, a statistical evaluation of CEGA compared to these algorithms will be done, according to the best function value F(z) by implementing the Friedman test [39] and the Wilcoxon signed-rank test [40] here. The Friedman test compares the algorithms’ average ranks and produces Friedman statistics, where the smaller the ranking, the better the performance of the algorithm while the Wilcoxon signed-rank test is used to show the significant differences between the CEGA and the other algorithms.The Friedman test results are shown in Table6. Table 6 shows that the Asymp. Sig. (P value) is smaller than 0.05, indicating that there are variations in the outcomes obtained by all algorithms. Furthermore, with a lower mean rank, the suggested CEGA algorithm outperforms the other algorithms.Table 6
Friedman test.
RanksTest statisticsMethodMean rankEAA [7]4.50GAs [21]3.25N4Hybrid-GOA-GA [38]1.75Chi-square11.400Original GA4.00df4CEGA1.50Asymp. Sig. (Pvalue)0.022Table7, on the other hand, displays the results of the Wilcoxon signed-rank test. The sum of positive ranks is R+, whereas the sum of negative ranks equals R−. Table 7 demonstrates that CEGA achieves better R+ values than R− values in 3 cases and is equal in 1 case, indicating that it outperforms other algorithms. As a result of Table 7, we can infer that the proposed CEGA is a significant algorithm and better than the other algorithms.Table 7
Wilcoxon signed ranks test.
Test statisticsRanksNMean rankSum of ranksEAA-CEGAR−0a0.000.00(a) EAA < CEGAZ−1.826mR+4b2.5010.00(b) EAA > CEGAAsymp. Sig. (2-tailed)0.068Ties0c(c) EAA = CEGAm. based on negative ranksTotal4GAs-CEGAR−0d0.000.00(d) GAs < CEGAZ−1.826mR+4e2.5010.00(e) GAs > CEGAAsymp. Sig. (2-tailed)0.068Ties0f(f) GAs = CEGAm. based on negative ranksTotal4Hybrid-GOA-GA-CEGAR−2g3.507.00(g) Hybrid-GOA-GA < CEGAZ−0.730nR+2h1.503.00(h) Hybrid-GOA-GA > CEGAAsymp. Sig. (2-tailed)0.465Ties0i(i) Hybrid-GOA-GA = CEGAn. based on positive ranksTotal4Original GA-CEGAR−0j0.000.00(j) Original GA < CEGAZ−1.826mR+4k2.5010.00(k) Original GA > CEGAAsymp. Sig. (2-tailed)0.068Ties0l(l) Original GA = CEGAm. based on negative ranksTotal4


## 6. Conclusions

In this paper, a chaotic enhanced genetic algorithm (CEGA) to solve the nonlinear system of equations (NSEs) is proposed, which is a combination of genetic algorithm (GA) and chaos theory. CEGA was designed by using a new definition which is chaotic noise to solve the shortcomings of original GA such as a lack of solution variety, an imbalance between exploitation and exploration, repeating best solution throughout the optimization process, and sluggish convergence of the optimal solution. NSEs are first transformed into an unconstrained optimization problem, which is then solved using CEGA.Four benchmarks problems were considered, which are experiment test, arithmetic application, combustion application, and neurophysiology application. The results obtained by CEGA and the original GA showed that CEGA leads to faster convergence and is successful in finding the optimal solution in fewer iterations than the original GA with an average improvement percentage of about 75.99. On the other hand, the convergence curves showed how the original GA consumes time in trapping into the local minima while the CEGA, by using the chaotic noise, terminated this sticking in the local minimum and moved the optimization process to new better search space. In addition, by comparing CEGA results with other studies, we find that CEGA is competitive and the best. Furthermore, statistical analysis by Friedman and Wilcoxon’s tests showed the significance of the CEGA findings, where it got the lowest mean rank and achieved better R+ values than R− values.In our future works, three directions will be concentrated: (i) implementing more modifications for CEGA and assessing their impact on optimization results, (ii) applying CEGA to solve optimization problems in different fields, and (iii) using other metaheuristic algorithms to solve this kind of problems, such as particle swarm optimization [41], ant colony optimization [42], artificial bee colony (ABC) Algorithm [43], krill herd [44], monarch butterfly optimization (MBO) [45], earthworm optimization algorithm (EWA) [46], elephant herding optimization (EHO) [47], moth search (MS) algorithm [48], slime mould algorithm (SMA) [49], hunger games search (HGS) [50], Runge Kutta optimizer (RUN) [51], colony predation algorithm (CPA) [52], and harris hawks optimization (HHO) [53].



---

*Source: 1376479-2022-04-12.xml*