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 :
(B), (E), (A), (C), (D)
A genetic algorithm (Goldberg) searches by evolving a population of candidate solutions, using operators modelled on natural selection and genetics.
Step 1 — Initialization (B): a random population of chromosomes is generated.
Step 2 — Evaluation (E): each chromosome's fitness is computed with the fitness function.
Step 3 — Selection (A): fitter individuals are chosen as parents, e.g. by roulette wheel or tournament.
Step 4 — Crossover (C): pairs of parents exchange segments to produce offspring.
Step 5 — Mutation (D): random bits or genes of offspring are altered to keep diversity; the new population then loops back to evaluation.
Selection cannot happen before a population exists and has been evaluated, so sequences starting with selection or evaluation are wrong, and mutation is applied to offspring produced by crossover, not before it.
(B), (E), (A), (C), (D) option is correct.
| 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 |