Analyzer

Operators implementing the IAnalyzer interface

---

General

BestAverageWorstQualityAnalyzer

An operator which analyzes the best, average and worst quality of solutions in the scope tree.

MinAverageMaxValueAnalyzer

An operator which analyzes the minimum, average and maximum of a value in the scope tree.

MultiAnalyzer

An analyzer which applies arbitrary many other analyzers.

QualityAnalyzer

An operator which analyzes the quality of solutions in the scope tree.

ValueAnalyzer

An operator which analyzes a value in the scope tree.

---

Tabu Search

TabuNeighborhoodAnalyzer

Operator Parameters:

Parameter	Description
IsTabu	A value that determines if a move is tabu or not.
PercentTabu	Indicates how much of the neighborhood is tabu.
Results	The result collection where the value should be stored.

---

Artificial Ant Problem

BestAntTrailAnalyzer

An operator for analyzing the best ant trail of an Artificial Ant Problem?.

Parameter	Description
BestSolution	The visual representation of the best ant trail.
MaxTimeSteps	The maximal time steps that the artificial ant has available to collect all food items.
Quality	The qualities of the artificial ant solutions which should be visualized.
Results	The result collection where the best artificial ant solution should be stored.
SymbolicExpressionTree	The artificial ant solutions from which the best solution should be visualized.
World	The world with food items for the artificial ant.

---

Knapsack Problem

BestKnapsackSolutionAnalyzer

An operator for analyzing the best solution for a Knapsack Problem?.

Parameter	Description
BestKnownQuality	The quality of the best known solution.
BestKnownSolution	The best known solution.
BestSolution	The best knapsack solution.
BinaryVector	The knapsack solutions from which the best solution should be visualized.
KnapsackCapacity	Capacity of the Knapsack.
Maximization	True if the problem is a maximization problem.
Quality	The qualities of the knapsack solutions which should be visualized.
Results	The result collection where the knapsack solution should be stored.
Values	The values of the items.
Weights	The weights of the items.

---

OneMax Problem

BestOneMaxSolutionAnalyzer

An operator for analyzing the best solution for a OneMax Problem.

Parameter	Description
BestKnownQuality	The quality of the best known solution.
BestKnownSolution	The best known solution.
BinaryVector	The Onemax solutions from which the best solution should be visualized.
Maximization	True if the problem is a maximization problem.
Quality	The qualities of the Onemax solutions which should be visualized.
Results	The result collection where the Onemax solution should be stored.

---

Single Objective Test Function Problem

BestSingleObjectiveTestFunctionSolutionAnalyzer

An operator for analyzing the best solution for a SingleObjectiveTestFunction problem.

---

Travelling Salesman Problem

BestTSPSolutionAnalyzer

An operator for analyzing the best solution of a Travelling Salesman Problem? given in path representation using city coordinates.