Assume that Davis's Bit Hill Climbing, First Improvement Hill Climbing and Steepest Descent Hill Climbing algorithms are applied to a MAX-SAT problem instance resulting in average objective values of 12.4, 34.3 and 25.7, respectively, over 30 runs.

Which algorithm performs the best based on the average objective value on this problem instance?

After applying the adjacent pairwise interchange operator three times at random to the candidate solution of "1-3-2-5-4-7-6", which of the following new candidate solutions could be produced?

Applying the bit-flip operator randomly for once to the candidate solution of "0101010", which of the following new candidate solutions could be produced?

One of the strengths of hill-climbing methods in search and optimisation is that they are generally easy to implement algorithms. 

The First Improvement Hill Climbing algorithm may get trapped at a local optimum regardless of the problem dealt with.

Is the following statement TRUE or FALSE?

Hill climbing/local search cannot be applied to parents and offpring, before crossover and after mutation, respectively, in a memetic algorithm.

Which one of the following is a reason why benchmark functions are used for performance comparison of search/optimisation algorithms?

Run your implementation of the Memetic Algorithm in “GA mode”

with the default evolutionary operators. You should observe the following

boxplot of the results.