Now, the nation with the smallest population in the tournament is a win away from the knockout round.
Single point crossover and random mutation are performed on the population obtained by tournament selection, then the child population Q t can be generated.
Four removal methods are considered when N decreases: (1) the worst individuals are removed from the population; (2)–(4) a tournament is made up of (x in ) {2, 5, 10} competitors, and the worst is removed from the population.
In the third and fourth approaches, to give a chance to the low fitness solutions in reforming the population, Roulette Wheel Selection RWSS) and Tournament Selection (TS) are utilized to select the guiding agent from the first half.
We randomly select s individuals from population Ι and implement tournament selection by holding a tournament among s competitors, where s is the tournament size.
Figure 5 Histogram of the number of occurrences regarding the iteration of convergence for three different selection techniques: population decimation, proportionate, and tournament selection with the following parameters: Populate N = 60, Subpopulate (for tournament selection) = 4, Parents size M = 16, crossover probability = 1, and mutation probability = 0.05.
An evolutionary algorithm with 200 individuals in the population, 466 generations, and tournament selection found this assembly protocol in 100 h on a PC with z 3 GHz CPU and a nVidia Geforce GTX 460 GPU.
The implementation of UCS applied in this study is the same as the one used in [ 21] adopting mostly default parameters with the exception of 50,000 learning iterations, a population size of 1000, tournament selection, uniform crossover, subsumption, and a ν of 1.
Selection of two parent chromosomes in one population is based on the tournament selection method.
Table 2 GA parameters used in the study S. no GA parameters Magnitude/method 1 Population size 100 2 Selection method Tournament selection 3 Type of crossover (3 -point 4 Probability of crossover 0.95 5 Probability of mutation 0.05 6 Strategy Elitist 7 Maximum generations 3 -point
