Description: Paul used the choice of excellent conditions for the termination of genetic algorithm to determine is: a certain algebra. Could be improved as follows: adjacent to the average number of generations of populations to adapt to the changes to determine the value. Adjacent to several generations if the population average fitness for the change or changes in less than a threshold, that the algorithm has been convergence, then from the algorithm. Selection operator: roulette wheel selection crossover: single-point crossover, randomly selected to calculate the fitness value, if greater than the current best fitness value to reduce the probability of crossover, otherwise remain unchanged mutation operator: the template for advantage of the individual, with the exception of the use of low-probability variation, the variation of the location of the greater weight should be taken, the smaller the mutation probability principle, and that the opposite is true for the inferior individual.
File list (Check if you may need any files):
AGA.txt
Download