Free cookie consent management tool by TermsFeed Policy Generator

Changes between Initial Version and Version 1 of Analyzer


Ignore:
Timestamp:
06/08/10 16:06:13 (14 years ago)
Author:
mkofler
Comment:

--

Legend:

Unmodified
Added
Removed
Modified

  • Analyzer

    v1 v1  
     1= Analyzer =
     2Operators implementing the `IAnalyzer` interface
     3
     4----
     5== General ==
     6
     7=== !BestAverageWorstQualityAnalyzer ===
     8An operator which analyzes the best, average and worst quality of solutions in the scope tree.
     9
     10=== !MinAverageMaxValueAnalyzer ===
     11An operator which analyzes the minimum, average and maximum of a value in the scope tree.
     12
     13=== !MultiAnalyzer ===
     14An analyzer which applies arbitrary many other analyzers.
     15
     16=== !QualityAnalyzer ===
     17An operator which analyzes the quality of solutions in the scope tree.
     18
     19=== !ValueAnalyzer ===
     20An operator which analyzes a value in the scope tree.
     21
     22----
     23== Tabu Search ==
     24=== !TabuNeighborhoodAnalyzer ===
     25
     26'''Operator Parameters:'''
     27||= Parameter         =||= Description =||
     28|| !IsTabu || A value that determines if a move is tabu or not. ||
     29|| !PercentTabu || Indicates how much of the neighborhood is tabu. ||
     30|| Results || The result collection where the value should be stored. ||
     31
     32----
     33== Artificial Ant Problem ==
     34=== !BestAntTrailAnalyzer === 
     35An operator for analyzing the best ant trail of an [[Artificial Ant Problem]].
     36
     37||= Parameter         =||= Description =||
     38|| !BestSolution || ||
     39|| !MaxTimeSteps || ||
     40|| Quality || ||
     41|| Results || The result collection where the value should be stored. ||
     42|| !SymbolicExpressionTree || ||
     43|| World || ||
     44
     45----
     46== Knapsack Problem ==
     47=== !BestKnapsackSolutionAnalyzer ===
     48An operator for analyzing the best solution for a [[Knapsack Problem]].
     49
     50||= Parameter         =||= Description =||
     51|| !BestKnownQuality || ||
     52|| !BestKnownSolution || ||
     53|| !BestSolution || ||
     54|| !BinaryVector || ||
     55|| !KnapsackCapacity || ||
     56|| Maximization || ||
     57|| Quality || ||
     58|| Results || The result collection where the value should be stored. ||
     59|| !SymbolicExpressionTree || ||
     60|| Values || ||
     61|| Weights || ||
     62
     63----
     64== !OneMax Problem ==
     65=== !BestOneMaxSolutionAnalyzer ===
     66An operator for analyzing the best solution for a [[OneMax Problem]].
     67
     68||= Parameter         =||= Description =||
     69|| !BestKnownQuality || ||
     70|| !BestKnownSolution || ||
     71|| !BinaryVector || ||
     72|| Maximization || ||
     73|| Quality || ||
     74|| Results || The result collection where the value should be stored. ||
     75
     76----
     77== Single Objective Test Function Problem ==
     78=== !BestSingleObjectiveTestFunctionSolutionAnalyzer ===
     79An operator for analyzing the best solution for a !SingleObjectiveTestFunction problem.
     80
     81----
     82== Travelling Salesman Problem ==
     83=== BestTSPSolutionAnalyzer ===
     84An operator for analyzing the best solution of a [[Travelling Salesman Problem]] given in path representation using city coordinates.