Is the following statement TRUE or FALSE?

The parameters of the Simulated Annealing metaheuristic using the Lundy and Mees cooling schedule include only β and initial temperature (T₀).

Is the following statement TRUE or FALSE?

The geometric cooling schedule in Simulated Annealing is used to cool the temperature parameter T used within the Boltzmann probability equation using the formula T =  α T. 

Is the following statement TRUE or FALSE?

Simulated Annealing is a non-stochastic threshold move acceptance method.

All parameters of the local search metaheuristics,  Simulated Annealing with Lundy Mees cooling schedule and  Iterated Local Search using Steepest Descent for hill climbing and random bit flip for perturbation are both tuned using the Taguchi method for solving the MAX-SAT problem. 

Which one of the following statements on the performance comparison of Simulated Annealing and Iterated Local Search is more likely to be correct? 

For each of the following required low-level heuristics, select all that you were able to implement delta evaluation for. If you did not implement delta evaluation, then you should select "None."

Below is a free text area to describe any other optimisations that you made to your code that you believe make a meaningful improvement to its runtime.

Within the project description, there was a minimum set of low-level heuristics to be implemented, and optionally at least three other heuristics. In the text box below, list each additional low-level heuristic that you implemented on a new line and state the corresponding class name and heuristic type. If you reimplemented a required heuristic but used a different neighbourhood, for example reinsertion instead of swap, then you should state this. If you did not implement additional heuristics, then you should leave this field blank.

For example: 

Adjacent Swap (Mutation)

Given the following permutation representation of a solution to some instance of the Open-top Bus Routing problem using an integer array <0,1,2,3,4,5,6,7,8,9> determine for each of the low-level heuristics that were required to be implemented and listed below whether the candidate solution <0,1,4,3,2,5,6,7,8,9> is:

• Definitely reachable (Yes),
• Definitely not reachable (No), or
• May or may not be reachable as this would depend on unspecified details (Maybe), 

...after calling the HyFlex API method applyHeuristic(int iHeuristicIndex, int iCurrentSolutionIndex, int iCandidateSolutionIndex) with an intensity of mutation of 0.3 and a depth of search of 0.3.

Please indicate what type of device you used to run your hyper-heuristic for solving the unseen instance. (We will use this to ensure there are no inconsistencies between devices).