1. Introduction
A genetic algorithm is a formula for resolving optimization issues that incorporate a constraint and natural selection similar to the biological process that propels evolution. The recent addition of the genetic algorithm (GA) to artificial intelligence was motivated by the biological behavior of chromosomes ^{[1]}. The Darwinian evaluation principle known as “survival of the fittest” is what the evolution algorithms do ^{[1]}. Therefore, the goal of employing GA is to produce the best offspring (solution), which increases the necessity of adopting it. The GA begins with two parents and mates them to generate new offspring; this mating is termed the “crossover.” then the old population is replaced with the new one by using the crossover and mutation operators. This process continues until the convergence condition is met ^{[2]}.
1.1. GA Operands
There are three operands ^{[3]} in a typical GA as follows.

Selection: This operand determines which chromosomes of the population are selected for reproduction. If a chromosome fits better, it is more likely to be selected for reproduction.

Crossover: This operator exchanges the subsequences between two chromosomes before and after a locus that is randomly chosen to create two offspring ^{[3]}.

Mutation: This procedure involves flipping one or more randomly selected bits in the parent’s chromosomes to create an offspring from a single parent ^{[4]}. Any bit has a slight chance of mutating, like 0.001 ^{[3]}. The layout shown in Figure 1 represents the typical GA process.
This approach is based on the observation that specific chromosomally encoded traits are shared by individuals and can be passed to )inherited by( their offspring through crossover ^{[5]}. The genes of either one parent or both parents, with mutations, are shared by two offspring.
1.2. Single–Point Crossover
The bestknown and frequently applied crossover model so far among researchers is that presented by Ref. ^{[6]}. A crossover site is randomly selected along the length of the matched strings, and bits that are immediately near the crosssites are exchanged.
The beneficial traits of the parents may be combined to produce better offspring when the right site is chosen. If the right place is selected when good parents are mated, the offspring will be better; if not, the string quality will be severely hampered. If the head and tail of one chromosome contain acceptable genetic material, then no offspring will acquire the two beneficial traits straight after the singlepoint crossover.
1.3. NPoint Crossover
Ref. ^{[7]} was the first to use the npoint crossover. It was similar to the singlepoint crossover. In a twopoint crossover, there are two relevant crossing sites. The performance of the genetic algorithms can be severely impacted by interruptions of building blocks caused by the continual addition of the crossover sites.
1.4. Uniform Crossover
Ref. ^{[8]} presented a uniform crossover, where the chromosomes are not broken up by uniform crossover for recombination. Each gene in a child’s offspring is made by copying it from a parent who has been selected based on the bit that corresponds to it in a binary crossover mask that has the same length as the parent chromosomes. The two parents are chosen for crossover through the uniform crossover; it produces two children with n genes uniformly chosen from both parents. A random real integer determines whether the first child chooses the i^{th} gene from the first or second parent ^{[9]}.
1.5. Numerical Chromosome Representation
The crossover mostly used binary encoded chromosomes, and for realvalue encoding, the numerical crossover is utilized. Here, two parent chromosomes are combined linearly by the numerical crossover operator. Two chromosomes are randomly chosen for crossover, resulting in two children who are a linear blend of their parents. Npoint is mainly used in the case of binary encoded chromosomes ^{[1]}.
1.6. Operators Definition
Numerous operators represent the main parts of a genetic algorithm form. A gene is a string of bits or a real number within a specific length. A chromosome is a term used to describe a sequence of genes. An allele, which can be represented by a symbol or a bit, is the smallest chromosomal unit. While a phenotype offers an external description of the individual, a genotype is a piece of data contained in a chromosome ^{[4]}^{[10]}. The main operands of GA are depicted in Figure 2.
2. Genetic Algorithms for Computer Networks Optimization
2.1. Original Theories
Ref. ^{[8]} was first to present the uniform crossover for GA, even at one point, the second point was presented, but the uniform crossover showed it outperform in optimization, and till now, this crossover type is applicable in many different science fields.
Ref. ^{[7]} presented an adaptive algorithm to decide when a particular crossover (one point, second point, or uniform) will be optimal for any problem. However, it still works with the standard crossover.
Ref. ^{[9]} presented an excellent review showing more than thirtyfive types of crossovers presented till 2015, and all the suggested research used in different optimization fields.
Ref. ^{[4]} presented a review that shows the importance of GA in the optimization for machine learning and deep learning.
A schema that included a twopoint crossover was published in Ref. ^{[2]}, where the proposed methods offer a contrastive convergence rate.
When the balance between the traits of parents and offspring was a challenge in GA optimization, Ref. ^{[5]} presented balanced crossover operators that guarantee the offspring has the same balanced features as the parents.
Ref. ^{[4]} presented a modified optimization method that depended on AI, and presented guidance for both beginner and experienced researchers designing evolutionary neural networks, assisting them in selecting appropriate genetic algorithm operator values for use in applications in a certain issue domain.
2.2. Implementation of GA
Various research works have been published on GA. The latest works will be discussed in this section.
A genetic algorithm was presented in Ref. ^{[11]} to reduce the power losses caused by turbine wakes in wind farms.
A new flight trajectory computation made with GA was proposed by Ref. ^{[12]}. The approach examined lateral and vertical navigation to determine the most fuelefficient cruise trajectory, with optimization by GA saving up to 5.6% in gasoline.
Ref. ^{[13]} used deep learning with a convolutional neural network to classify four types of leucocytes. A genetic algorithm was used to optimize the CNN’s hyperparameters; this article showed that CNN is not efficient in getting optimal performance.
Ref. ^{[14]} presented a new optimization method called the puzzle optimization algorithm (POA), which can be used in different optimization problems. The advantage of this method is that there are no control parameters, thus not requiring parameter settings.
Ref. ^{[15]} presented a technique based on fuzzy triangular numbers that have been applied to simulate the recruitment process of the individual to the employee. Moreover, a genetic algorithm has been used for optimization, where the author presented a solution for the selection process to the best individual through a GA and fuzzy ranking.
Ref. ^{[16]} used ensemble classifiers to present a student predictive model and prepressing to implement a search before classifying via datamining methodology in a context of educational datamining (EDM). The best solution was then discovered, and GA was utilized to look for issues and raise the likelihood of reaching a solution.
Ref. ^{[17]} offered an innovative way in strongrule generation, one of the key components of datamining, where the author employed it differently from the existing construct rules. However, the best optimization technique for generating rules was the genetic algorithm.
Ref. ^{[18]} tried to determine the optimal choice for scheduling generator maintenance, where various multiobjective optimization methods were examined. One optimization method, nondominated sorting genetic algorithm, exemplifies the importance of utilizing GA and optimization in a variety of scientific fields.
Ref. ^{[19]} presented a new crossover operand for the genetic algorithm called quarterly crossover (QA), by assuming a different structure for genes within the chromosome, which resulted in two crossovers intended to be an optimized solution for realtime scheduling. This reference presented expanded optimization tools and parameters for the network.
Ref. ^{[20]} presented an optimization method for an ad hoc network to be used for roadside units (RSUs) with the expectation that the proposed optimization would reduce accidents and traffic jams, but this method missed some factors related to GA and required more factors for optimization.
Ref. ^{[21]} presented a model for schedule risk management of IT outsourcing by using the distributed decision making (DDM) theory and the principalagent theory as well as designing a hybrid algorithm from the genetic algorithm and simulated annealing algorithm. The designed algorithm focused on the risk management problem. This article is aimed at giving the decisionmaker the scientific quantitative tool they need to manage the schedule risk of an IT outsourcing project.
Ref. ^{[22]} presented the bit masking oriented genetic algorithm (BMOGA) for contextfree grammar induction. It used a Booleanbased approach divided into two stages, utilizing the advantages of crossover and mutation maskfill operators to direct the search process from the i^{th} generation to the (i + 1)^{th} generation. To produce an appropriate amount of population in each generation, crossover and mutation maskfill techniques are used. The article focused on the grammar of the context induction (as opposed to researchers' current work, which will focus on the computer network optimization).
In Ref. ^{[23]}, the principalagent theory was applied to ITO projects to reduce schedule risk. For the purpose of describing the vendor and client decisionmaking process, a twolevel mathematical model was constructed. The size of the problem grows significantly as the number of activities and subprojects rises. The resulting optimization is a continuousdomain, NPhard problem. A genetic algorithm (GA) is presented to solve this problem, where the GA model used strong optimization abilities for convergence, reliability, and efficiency, which is a good tool for this kind of optimization problem (as opposed to researchers' proposed crossover that can be applied for optimization in various fields, especially computer networks).
In the field of metaheuristic optimization, Ref. ^{[24]} presented a hybrid metaheuristic algorithm for a locationrouting problem (LRP), tackles facility location problems and vehicle routing problems simultaneously to obtain the overall optimization. This article did not handle the GA crossover and did not use it (in contrast to researchers' proposed work, which modified the core of the GA crossover to get a novel adaptive crossover).
Ref. ^{[25]} is a recent article, where GA has been used in the smart contract of block chain technique to predict a new offspring of the animals endangered. This article presented a decentralized application (SONR DAPPs) by implementing a genetic algorithm to forecast a brandnew offspring with improved characteristics.
2.3. Optimization in Fields of Science
The field of cloud computing improvement and WSN is getting a lot of attention among other fields, where the energy consumption of nodes in the network should be restricted. Therefore, Ref. ^{[26]} used an optimization technique to reduce the utilization of the energy by the data center in a way to accomplish the best quality of service.
Refs. ^{[27]}^{[28]}^{[29]} presented an energyefficient deployment method for sensor nodes by clustering the nodes and applying an optimization technique for the optimal reduction of the nodes’ battery. The optimization for nodes led to the optimization of the routing protocol. Ref. ^{[30]} used a GA for mechanical engineering in multiscale surface roughness, and presented three genetic algorithms to superimpose and merge the mathematical descriptions of chromosomes to determine the best roughness features.