Changes between Version 2 and Version 3 of Analyzer
- Timestamp:
- 06/08/10 17:02:06 (14 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
Analyzer
v2 v3 1 [[PageOutline]] 1 2 = Analyzer = 2 Operators implementing the `IAnalyzer` interface 3 Analyzers are HeuristicLab 3.3 operators that implement the `IAnalyzer` interface. There are a couple of general purpose Analyzers, such as the `QualityAnalyzer` or the `MultiAnalyzer` as well as encoding and problem specific Analyzers. 3 4 4 5 ---- 5 == General ==6 == 1. General == 6 7 7 === !BestAverageWorstQualityAnalyzer === 8 === 1.1 !MultiAnalyzer === 9 An analyzer which applies arbitrary many other analyzers. It is used as a parameter in all currently implemented problems ([[Evolution Strategy]], [[Genetic Algorithm]] etc.) to ensure easy extendability. 10 11 For example, if you open the [[UsersTSPSample#GATSP| GA for the ch130 problem]] sample on the Optimizer Start Page, navigate to the Parameters tab and click on the Analyzer property, you will see the following list of sub-Analyzers: 12 13 [[Image(MultiAnalyzer_Example_TSP.png)]] 14 15 The `BestAverageWorstQualityAnalyzer` comes from the genetic algorithm and the `BestTSPSolutionAnalyzer` was provided by the TSP problem. This wiring also works if you configure your own algorithm in the Optimizer. Opening a new Evolution Strategy algorithm and loading a Griewank test function as problem will result in a `BestAverageWorstQualityAnalyzer` and a `BestSingleObjectiveTestFunctionSolutionAnalyzer`. You can of course add additional Analyzers via the GUI. 16 17 18 '''Operator Parameters:''' 19 20 ||= Parameter =||= Description =|| 21 || !UpdateInterval || The interval in which the contained analyzers should be applied (Default: 1) || 22 || !UpdateCounter || The value which counts how many times the !MultiAnalyzer was called since the last update. || 23 24 === 1.2 !MinAverageMaxValueAnalyzer === 25 An operator which analyzes the minimum, average and maximum of a value in the scope tree. 26 27 === 1.3 !BestAverageWorstQualityAnalyzer === 8 28 An operator which analyzes the best, average and worst quality of solutions in the scope tree. 9 29 10 === !MinAverageMaxValueAnalyzer === 11 An operator which analyzes the minimum, average and maximum of a value in the scope tree. 12 13 === !MultiAnalyzer === 14 An analyzer which applies arbitrary many other analyzers. 15 16 === !QualityAnalyzer === 30 === 1.4 !QualityAnalyzer === 17 31 An operator which analyzes the quality of solutions in the scope tree. 18 32 19 === !ValueAnalyzer ===33 === 1.5 !ValueAnalyzer === 20 34 An operator which analyzes a value in the scope tree. 21 35 22 36 ---- 23 == Tabu Search ==24 === !TabuNeighborhoodAnalyzer ===37 == 2. Tabu Search == 38 === 2.1 !TabuNeighborhoodAnalyzer === 25 39 26 40 '''Operator Parameters:''' … … 31 45 32 46 ---- 33 == Artificial Ant Problem ==34 === !BestAntTrailAnalyzer ===47 == 3. Artificial Ant Problem == 48 === 3.1 !BestAntTrailAnalyzer === 35 49 An operator for analyzing the best ant trail of an [[Artificial Ant Problem]]. 36 50 51 52 '''Operator Parameters:''' 37 53 ||= Parameter =||= Description =|| 38 54 || !BestSolution || The visual representation of the best ant trail. || … … 44 60 45 61 ---- 46 == Knapsack Problem ==47 === !BestKnapsackSolutionAnalyzer ===62 == 4. Knapsack Problem == 63 === 4.1 !BestKnapsackSolutionAnalyzer === 48 64 An operator for analyzing the best solution for a [[Knapsack Problem]]. 49 65 66 67 '''Operator Parameters:''' 50 68 ||= Parameter =||= Description =|| 51 69 || !BestKnownQuality || The quality of the best known solution. || … … 61 79 62 80 ---- 63 == !OneMax Problem ==64 === !BestOneMaxSolutionAnalyzer ===81 == 5. !OneMax Problem == 82 === 5.1 !BestOneMaxSolutionAnalyzer === 65 83 An operator for analyzing the best solution for a [[OneMax Problem]]. 66 84 85 86 '''Operator Parameters:''' 67 87 ||= Parameter =||= Description =|| 68 88 || !BestKnownQuality || The quality of the best known solution. || … … 74 94 75 95 ---- 76 == Single Objective Test Function Problem ==77 === !BestSingleObjectiveTestFunctionSolutionAnalyzer ===96 == 6. Single Objective Test Function Problem == 97 === 6.1 !BestSingleObjectiveTestFunctionSolutionAnalyzer === 78 98 An operator for analyzing the best solution for a !SingleObjectiveTestFunction problem. 79 99 80 100 ---- 81 == Travelling Salesman Problem ==82 === BestTSPSolutionAnalyzer ===101 == 7. Travelling Salesman Problem == 102 === 7.1 BestTSPSolutionAnalyzer === 83 103 An operator for analyzing the best solution of a [[Travelling Salesman Problem]] given in path representation using city coordinates.
