Q18.Marks: +2.0UGC NET Paper 2: Computer Science 18th June 2024 Shift 1 (Cancelled)
Which of the following genetic algorithm operation is computationally most expensive ?
1.Convergence testing
2.Initial population creation
3.Selection of sub-population for mating
4.Reproduction to produce next generation✓ Correct
Solution
The correct answer is Reproduction to produce next generation.
Key Points
Reproduction to produce next generation is the process in genetic algorithms where new offspring are generated through crossover and mutation operations.
This step is computationally intensive because it involves multiple operations, such as selecting pairs of parent individuals, performing crossover to generate new offspring, and applying mutation operations to introduce variability.
The computational cost of reproduction increases with the size of the population and the complexity of the genetic representation.
Additional Information
Convergence testing involves checking if the algorithm has reached a solution or if the population has become homogeneous. This is relatively less computationally expensive.
Initial population creation is the process of generating the initial set of individuals randomly. This step is usually straightforward and not very computationally demanding.
Selection of sub-population for mating involves choosing individuals from the current population based on their fitness scores. This operation is typically less computationally intensive compared to reproduction.