Login or Create an Account to view question mark schemes, comment, and download a PDF of this test
Question 1[2 Marks]
Define the term computational intractability.
Question 2[2 Marks]
Define the term tour.
Question 3[2 Marks]
Define the term heuristics.
Question 4[2 Marks]
With respect to genetic algorithms, define the term mutation.
Question 5[2 Marks]
Define the term population.
Question 6[4 Marks]
Outline one advantage and one disadvantage of Tournament Selection when compared to Truncation Selection.
Question 7[4 Marks]
Outline one advantage and one disadvantage of Stochastic Universal Sampling (SUS) when compared to Roulette Wheel Selection (RWS).
Question 8[6 Marks]
Discuss how mutation and the mutation rate affect the potential for premature convergence in a genetic algorithm (GA) approach to the Travelling Salesman Problem (TSP).

8 Questions24 MarksPremium
34 Uses220 Views4 Likes