Given a list of cities and the distances between each pair of cities, a genetic algorithm 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 genetic algorithm 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 and problem space (search space), the algorithm seeks to find which of the following?