Genetic Algorithms (GAs) are optimization techniques inspired by natural selection. A key step in a GA is selecting individuals (parents) from the current population to create the next generation. This selection process aims to favor individuals with better fitness scores, increasing the chances of finding optimal solutions.
Parent selection is crucial because it determines which individuals get to reproduce. The goal is to balance exploration (trying new areas of the search space) and exploitation (focusing on promising solutions found so far).
Several techniques are commonly used to select parents:
The question asks which option is NOT a typical parent selection technique used in genetic algorithm implementations. Based on common GA literature and practices:
Therefore, 'Radial' is the technique that does not belong to the common set of parent selection methods in genetic algorithms.
| List I (GA termination criteria) | List II (description) |
| A. Worst Individual | I. At least half of the individual will be better than or equal to convergence value |
| B. Best Individual | II. Guarantees that virtually all individuals in the population will be within a particular fitness range |
| C. Sum of Fitness | III. Guarantees that the entire population to be of a minimum standard |
| D. Median Fitness | IV. Faster search Convergence, guaranteeing at least one best solution |
Arrange the following steps in proper sequence involved in a Genetic Algorithm :
(A) Selection
(B) Initialization
(C) Crossover
(D) Mutation
(E) Evaluation
Choose the correct answer from the options given below :