Evolutionary Algorithm Variants

Which of the following is/are discrete optimization problem(s)?

• Travelling salesman problem

• Robot control

• Chess playing program

• Prediction of stock prices

• Knapsack problem

Which of the following statement(s) about initialization in Evolutionary Algorithms is/are wrong?

• Candidate solutions are normally randomly generated

• Initialization is about generating candidate solutions

• Mutation of candidates is normally applied during the initialization

• Heuristics for generating candidates cannot be applied during the initialization

Exploration and exploitation should not be combined in Evolutionary Algorithms.

• True

• False

Exploitation in search is concerned with improving the current best solution by local search.

• True

• False

If we failed to strike a balance between exploitation and exploration is evolutionary algorithms, very often the search will be getting stuck in local optima.

• True

• False

Exploration in search is concerned with global search. It focuses on exploring the unexplored regions in a search space.

• True

• False

Which of the following statement(s) about variation operators in Evolutionary Algorithms is/are correct?

• Variation operators are selection operators

• Variation operators act on population level

• Variation operators act on individual level

• Examples of variation operators are crossover and mutation

Which of the following statement(s) about tree representation is/are correct?

• Tree representation is often utilized as representation scheme of Genetic Programming

• Tree representation is suitable for representing computer programs

• Tree representation is used as representation scheme of Genetic Algorithms

• The mutation of tree representation results in replacing a randomly selected subtree by a randomly generated tree

The higher the selection pressure, the harder for the fittest candidate solution to survive.

• True

• False

A multimodal problem has only one locally optimal solution.

• True

• False