Given a significant number of cities (nodes), which of the following is not a valid reason for using a Genetic Algorithm (GA) to solve the Travelling Salesman Problem (TSP)?
Owing to the extremely large number of permutations of cities, brute force approaches are intractable.
Given the vast fitness landscape, more traditional hill-climbing approaches may get trapped at local extrema.
Calculus is generally a poor fit for fundamentally discrete mathematical problems such as the TSP.
As long as premature convergence is avoided, GAs offer an efficient method / heuristic to guarantee an optimal solution;

Multiple Choice1 MarkPremium
19 Uses16 Views1 Like
Login or Create an Account to view the mark scheme, comment, and add to a test