Evolutionary Computation

Question 1

Evolutionary Computation mimetize the principles of ___ to perform ___ tasks

Answer 1

natural evolution

computational

Question 2

___ and ___ represent the essence of evolution

Answer 2

Variation and Selection

Question 3

Living organisms act as a duality of their ___ and their ___

Answer 3

genotype

phenotype

Question 4

Genotype is the underlying ___

Answer 4

genetic coding

Question 5

Phenotype is the manner of ___ contained in the ___, ___ and ___ of the organism

Answer 5

response

behaviour, physiology and morphology

Question 6

Evolution can be viewd as occurring as a succession of four mapping functions:
1 - \_\_\_
2- \_\_\_
3- \_\_\_
4- \_\_\_

Answer 6

1- epigenesis
2- selection
3- genotypic survival
4- mutation

ESGM
ÉS Grand Master

Question 7

Epigenesis function:

___

Answer 7

I X G -> P

Question 8

Selection function:

___

Answer 8

P -> P

Question 9

Genotypic Survival function:

___

Answer 9

P -> G

Question 10

Mutation function:

___

Answer 10

G -> G

Question 11

The simplest evolutionary algorithm can be viewed as a search procedure that:
1- generates ___
2- tests each for ___
3- and then generates ___

Answer 11

1- potencial solutions to a problem
2- suitability
3- new solutions

Question 12

Exhaustive Search is certain to find the ___ as it consists of evaluating ___ but in most cases it will take ___

Answer 12

best solution
all possible solutions
too much time

Question 13

Blind Random Search can be performed in a ___ by selecting n appropriately. However, it usually performs ___ on real-worl problems

Answer 13

reasonable time

poorly

Question 14

Both Exhaustive and Blind Random search choose the next solution without regard to what ___

Answer 14

has been chosen previously

Question 15

Traditional Search Procedures can ___ quickly on a ___ or ___, but run the risk of stalling at a ___

Answer 15

converge
maximum or minimum
saddle point

Question 16

As opposed to Traditional Gradient Methods, Evolutionary Algorithms>
1- Rather than executing a ___ search, they incorporate a ___
2- Instead of utilizing ___ infromation from the response surface being searched, they utilize ___

Answer 16

1- poin-to-point / popularion of solutions, each individual solution competing for survival
2- gradient / random variation to explore new solutions

Question 17

In the Evolutionary Algorithm the relationship between parent and offspring defines ___.
If that does not exist, then the procedure is essentially like a ___ conducted ___ at a time

Answer 17

inheritance
blind random search
multiple samples

Question 18

Suppose the value of an offspring is related to its parent as follows:
x’ = x + N(0, sigma)
1- if sigma -> infinite then the search is like a ___
2- if sigma -> 0 then there is ___ from parent to offspring and there’s no search at all because ___
3- if 0 < sigma < infinite the procedure becomes a ___ search

Answer 18

1- blind random search
2- complete inheritance / each offspring merely replicates its parent
3- stochastic parallel /

Question 19

In the Generate and Test Fase:
1- The population is ___
2- The parents are selected depending on the previous ___
3- Parents generate ___

Answer 19

1- evaluated
2- score
3- offsprings

Question 20

In the Evolutionary algorithms it is key to choose what are the best:
1- ___ to represent solution
2- The ___ that are applied to those ___
3- The ___ that determine which solutions in a population will influence the creation of the next generation
3-

Answer 20

1- data scructures
2- search operators / data scrutcures
3- selection operators

Question 21

Selection can vary im effect from ___ to ___

Answer 21

strong to weak

Question 22

Strong Selections ensures that only the very best solutions in a population will ___

Answer 22

serve as parents

Question 23

Weak Selection offers ___ probability that weaker solutions may also ___

Answer 23

nonzero

serve as parents

Question 24

Some of the more common search operators include ___ that apply to a single parent, and ___ that apply to two or more parents.

Answer 24

mutation functions

recombinations functions

Question 25

Crossover is a special case of recombination wich takes ___ and swaps them between two parents.

Answer 25

contiguous segments

Question 26

A cromossome, also called a ___, is a set of parameters which define a ___ to the problem that the genetic algorithm is trying to solve

Answer 26

. genotype

. proposed solution