hybridization

Question 1

what is a memetic algorithm?

Answer 1

evolutionary algorithm with local search operators that work within the EA loop

Question 2

two components of local search

Answer 2

1. neighbourhood: set of points that can be reached from x with one application of a move operator
2. pivot rule: condition for stopping neighbourhood search e.g. greedy ascent

Question 3

what is the degree of a graph

Answer 3

degree of a graph: the maximum number of in/outgoing connections from a single node (= size of the biggest neighbourhood)