# Improving Waste Management System Efficiency and Mobility with Efficient Path MANET
## 3 Intersection GA-Based Routing Algorithm
### Chromosome Intersection Method  
The chromosome intersection method is a recombination process that generates new chromosomes by exchanging and combining the genes amongst the chromosomes. When the standard crossover is used, the index of the randomly selected point is used to exchange the genes on a pair of selected chromosomes. The proposed chromosome intersection method is used based on the information of the selected intersection point to find the exchanging point through the chromosomes and obtain new chromosome generation. The chromosome intersection method is applied to the chromosomes with the highest ranking. The intersection point is calculated according to the length of the chromosome using Equation (3).  
The operation selects the next chromosome as a partner depending on the right components of the calculated intersection point to reach the target node. This action guarantees the connectivity and validity between the selected pair of chromosomes.  
The following are the steps involved in the chromosome intersection method:  
* According to the intersection activation value calculated from the evaluation stage by Equation (2), the available rank of the chromosomes for the current generation is calculated;
* The intersection activation value, which is the most important factor in the combination process of a pair of chromosomes, is used to select the best chromosome from the population. Then, the best chromosome from the population is selected;
* The intersection point in the selected chromosome is identified using Equation (3), and the content value of the intersection point is used to determine where the intersection point is located. A new set of valid chromosomes is created by exchanging the chromosomes for their corresponding genes;
* After the intersection point is selected, a new intersection point is selected from the next highest ranked chromosome if the selected point is not found either in the chromosome currently in use or in the next highest-ranked chromosome;
* The selected chromosomes are recombined by exchanging the gene parts between them in accordance with the content of the intersection point that presents the node ID in the available path, which is determined by the intersection point's content;
* The newly combined chromosomes are replaced with the chromosomes with a low level of activation value;
* Afterwards, the condition is terminated after the intersection activation function evaluation has been completed.  
Chromosome intersection method is used instead of the two GA operations, namely, crossover and mutation, which are applied in the index of the crossover point. These methods do not guarantee the chromosome part connection. However, the content of the intersection point guarantees the connection between the nodes, reducing the number of iterations, and avoiding the loop that performs search space reduction.  
Figure 4 shows the crossover point for standard crossover, and Figure 5 shows the intersection point for chromosome intersection samples. The chromosome intersection method influences the processing time as follows:  
1. Available paths are presented by the newly generated chromosomes that result from the recombination operation;
2. Verifying the generated chromosomes is not needed;
3. This operation is applied instead of two genetic operations.