Given a list of cities and the distances between each pair of cities, a Genetic Algorithm (GA) is designed to determine the length of the/a shortest possible route that visits each city exactly once and returns to the origin city. The GA applies a fitness function to each candidate solution such that those with the lowest total distance are attributed the highest fitness value. In terms of the fitness function which calculates a fitness value for each candidate solution and their associated problem space (search space), select the type of extrema this algorithm seeks.