Питання | Сторінка 287

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?

No performance comparison can be done based on the given information.

✅

Iterated Local Search would perform better than Simulated Annealing for MAX-SAT

❌

Both metaheuristics would perform the same for MAX-SAT

❌

Simulated Annealing would perform better than Iterated Local Search for MAX-SAT

❌

Переглянути це питання

Crowdly

Questions Bank (1245525 total)