= Travelling Salesman Problem =

'''Problem Parameters:'''
||= Parameter         =||= Description =||
|| !BestKnownQuality   || The quality of the best known solution of this TSP instance. ||
|| !BestKnownSolution  || The best known solution of this TSP instance. ||
|| Coordinates         || The x- and y-Coordinates of the cities. || 
|| !DistanceMatrix      || The matrix which contains the distances between the cities. || 
|| Evaluator           || TSPRoundedEuclideanPathEvaluator: The operator which should be used to evaluate TSP solutions. ||
|| Maximization        || Set to false as the Traveling Salesman Problem is a minimization problem. ||
|| !SolutionCreator    || !RandomPermutationCreator: The operator which should be used to create new TSP solutions. ||
|| !UseDistanceMatrix   || True if a distance matrix should be calculated and used for evaluation, otherwise false. ||