Local Search Procedures Flashcards by Fernando Espinoza | Brainscape

Q

Describe the Local Search Algorightm

A

Check notes

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Describe the Simulated Annealing Algorithm

A

Check notes

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What does implementing a Tabu List make?

A

Prevents us from applying a swap that was found to be have the minimum cost in the past iterations.

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Whats the general procedure for genetic algorithms

A

Generate an initial population
Evaluate the fitness and select individuals for reproduction
* Randomly, always keep the best few?
Generate new individuals
* Crossover, mutation, immigration
Stop of stopping criteria are satisfied. Otherwise go to 2

How well did you know this?

1

Not at all

2

3

4

5

Perfectly