#local-optimum

Question 1: Select all that apply

Which statements about tabu search are true? Select all that apply.

It may move to the best neighbour even when that neighbour is worse than the current state1
Recent moves are made tabu for a few iterations, so it does not drop straight back into the optimum it just left2
With a fixed tie-breaking rule, the sequence of states it visits is deterministic3
It never accepts a neighbour that is worse than the current state4
It accepts a random worse neighbour with a probability that falls over time5