Free cookie consent management tool by TermsFeed Policy Generator

Changes between Version 1 and Version 2 of Documentation/Reference/Traveling Salesman Problem


Ignore:
Timestamp:
06/10/10 12:03:48 (14 years ago)
Author:
mkofler
Comment:

--

Legend:

Unmodified
Added
Removed
Modified

  • Documentation/Reference/Traveling Salesman Problem

    v1 v2  
    11= Travelling Salesman Problem =
     2The traveling salesman problem (TSP) is certainly one of the classical as well as most frequently analyzed representatives of combinatorial optimization problems with a lot of solution methodologies and solution manipulation operators. The problem is that a person has to visit a number of cities starting from and returning to his home city. The goal is to find a tour where every city is visited exactly once and where the travel distances become minimal.
    23
    34'''Problem Parameters:'''
    … …  
    78|| Coordinates         || The x- and y-Coordinates of the cities. ||
    89|| !DistanceMatrix      || The matrix which contains the distances between the cities. ||
    9 || Evaluator           || TSPRoundedEuclideanPathEvaluator: The operator which should be used to evaluate TSP solutions. ||
     10|| Evaluator           || [#Evaluator| TSPRoundedEuclideanPathEvaluator]: The operator which should be used to evaluate TSP solutions. ||
    1011|| Maximization        || Set to false as the Traveling Salesman Problem is a minimization problem. ||
    1112|| !SolutionCreator    || !RandomPermutationCreator: The operator which should be used to create new TSP solutions. ||
    1213|| !UseDistanceMatrix   || True if a distance matrix should be calculated and used for evaluation, otherwise false. ||
     14
     15== TPS Operators ==
     16[=#Evaluator]
     17=== TSPRoundedEuclideanPathEvaluator ===
     18An operator which evaluates TSP solutions given in path representation using the rounded Euclidean distance metric.
     19
     20'''Operator Parameters:'''
     21||= Parameter         =||= Description =||
     22|| Coordinates         || The x- and y-Coordinates of the cities. ||
     23|| !DistanceMatrix      || The matrix which contains the distances between the cities. ||
     24|| TSPTour || The TSP solution given in path representation which should be evaluated.
     25|| TSPTourLength || The evaluated quality of the TSP solution. ||
     26|| !UseDistanceMatrix   || True if a distance matrix should be calculated and used for evaluation, otherwise false. ||