Given a list of 20 cities and the distances between each pair of cities, solving the Travelling Salesman Problem (TSP) seeks to determine the length of the/a shortest possible route that visits each city exactly once and returns to the origin city.

(a).

State one reason why a Genetic Algorithm (GA) might be chosen to solve this problem.

[1]One stage of a GA approach to the TSP applies a fitness function to each candidate solution such that those with the lowest total distance are attributed the highest fitness value.

(b).

With respect to the fitness function, identify the type of extrema the GA is seeking to discover.

[1](c).

With respect to the fitness function, identify the data input and information output. Also state how the output information is used.

[3]Extended Response5 MarksPremium

23 Uses24 Views3 Likes

Login or Create an Account to view the mark scheme, comment, and add to a test