Question: Question 4 3 pts Which local search algorithm can escape local optima by allowing some moves that degrade the objective function value? q , Genetic
Step by Step Solution
There are 3 Steps involved in it
The correct answer to this question is Simulated Annealing Explanation Simulated Annealing is a loca... View full answer
Get step-by-step solutions from verified subject matter experts
