Genetic Algorithms & Evolutionary Computation Flashcards

1
Q

Describe the steps of an evolutionary/genetic algorithm.

A

Initialize population, evaluate, select parents, do crossover and mutation, select survivors, terminate population.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How does the evolutionary computing metaphor map biological concepts to problem-solving concepts?

A

Evolution == Problem Solving,
Environment == Problem,
Individual == Candidate solution,
Fitness == Quality.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is the distinction between genotype and phenotype in biological evolution?

A

Genotype is the encoded information, phenotype is the actual manifestation.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the role of mutation in genetic algorithms?

A

To create random variations to keep genetic diversity.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How does evolutionary computation handle problems where the majority of the search space is infeasible, such as university timetabling?

A

The algorithm discovers and refines feasible solutions by steering the reproduction and mutation toward constraint satisfaction.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is the role of the fitness function in genetic algorithms?

A

It calculates how good an individual/chromosome/solution is, measuring how well it meets the objective/constraints.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

How does swarm intelligence differ from other evolutionary computation approaches?

A

Swarm intelligence relies on teamwork and shared information between agents. Evolutionary computation relies on competition and survival of the fittest.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What advantages do evolutionary algorithms offer over traditional problem-solving methods?

A

Evolutionary algorithms are flexible and can find solutions in rather large infeasible search spaces, and doesn’t require problem-specific knowledge.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What role does population size and diversity play in evolutionary algorithms?

A

Population size affects the efficiency; larger populations allow more searched solutions. Diversity ensures more exploration of the solution space.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Explain how ‘survival of the fittest’ influenced the design of genetic algorithms.

A

Survival of the fittest influenced selection and fitness function. It mimics by selecting only better solutions for reproduction, ensuring advancement toward the solution.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Explain what a chromosome is in a genetic algorithm.

A

A chromosome represents a possible solution within the search space.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is the role of crossover in genetic algorithms?

A

The role of crossover is to take the traits of two better solutions and mix them, creating an offspring that may be better.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is evolution?

A

Evolution is the process of change in organisms over generations, to better adapt to their environment.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

What is the role of selection in genetic algorithms?

A

Selection chooses which individuals to reproduce, favouring the better fitness individuals.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What is the elitism mechanism in genetic algorithms?

A

It prevents the loss of progress by ensuring some of the best individuals get passed on to the next generation.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Design a chromosome representation for the class scheduling problem from assignment
2. Explain each of the components of your representation. How would crossover and mutation work for your representation?

A

A chromosome would contain a list of genes. A gene contains 3 ints representing the indexes which correspond to each list of courses, rooms, and timeslots.
Ex. Gene = (0,26) and a chromosome is many genes creating a timetable that may be the soltution to the problem