public void VisitBranch(ConditionalBranch branch)
{
if (m_needsCheck && !m_foundSingle && branch.Index >= 2 && m_numLocks == 1)
{
// Look for the if within the lock:
// call System.Void System.Threading.Monitor::Enter(System.Object)
// ldsfld field
// brtrue 2A
if (branch.Untyped.OpCode.Code == Code.Brtrue || branch.Untyped.OpCode.Code == Code.Brtrue_S)
{
LoadStaticField load = m_info.Instructions[branch.Index - 1] as LoadStaticField;
Call call = m_info.Instructions[branch.Index - 2] as Call;
if (load != null && call != null && call.Target.ToString() == "System.Void System.Threading.Monitor::Enter(System.Object)")
{
m_field = load.Field;
Log.DebugLine(this, "found candidate lock at {0:X2}", branch.Untyped.Offset);
// If we found the inner if then we need to look for a new
// and a store within the if,
if (DoFindNew(branch.Index + 1, branch.Target.Index - branch.Index - 1))
{
m_foundSingle = true;
// and a second guard before the lock.
if (DoFindGuard(call.Index - 1))
{
m_foundGuard = true;
}
}
}
}
}
}
// 10: brfalse 14
// 11: ldstr "pos"
// 12: call System.Void System.Console::WriteLine(System.String)
// 13: br 16
//
// 14: ldstr "pos"
// 15: call System.Void System.Console::WriteLine(System.String)
// 16: ret
public void VisitBranch(ConditionalBranch conditional)
{
if (m_offset < 0)
{
// If it's a forward conditional branch,
if (conditional.Target.Index > conditional.Index)
{
// and the not-taken case ends with a forward unconditional branch,
UnconditionalBranch unconditional = m_info.Instructions[conditional.Target.Index - 1] as UnconditionalBranch;
if (unconditional != null && unconditional.Target.Index > unconditional.Index)
{
// then we have a contruct that resembles an if statement so we'll
// compare the code in the two branches.
int num1 = unconditional.Index - conditional.Index - 1;
int num2 = unconditional.Target.Index - conditional.Target.Index;
Log.DebugLine(this, "not taken at {0:X2} has {1} instructions, taken has {2} instructions", conditional.Untyped.Offset, num1, num2);
if (num1 == num2 && conditional.Target.Index + num2 <= m_info.Instructions.Length)
{
if (DoMatches(conditional.Index + 1, conditional.Target.Index, num1))
{
Log.DebugLine(this, "matches");
m_offset = conditional.Untyped.Offset;
}
}
}
}
}
}
// 18: ldarg.0 this
// 19: ldfld System.EventHandler Good1::Event1 3) Guard using same load instruction
// 1E: brfalse 34
//
// 23: ldarg.0 this
// 24: ldfld System.EventHandler Good1::Event1 2) Load of this argument
// 29: ldarg.0 this
// 2A: ldsfld System.EventArgs System.EventArgs::Empty
//
// 2F: callvirt System.Void System.EventHandler::Invoke(System.Object,System.EventArgs) 1) Call to invoke
public void VisitCall(Call call)
{
if (m_offset < 0)
{
// 1) See if invoke was called.
string name = call.Target.ToString();
if (name.StartsWith("System.Void System.EventHandler") && name.Contains("::Invoke(") && call.Target.Parameters.Count == 2)
{
Log.DebugLine(this, "found event invoke at {0:X2}", call.Untyped.Offset);
// 2) Get the instruction used to load the this argument for invoke.
int i = m_info.Tracker.GetStackIndex(call.Index, 2);
if (i >= 0)
{
Load load1 = m_info.Instructions[i] as Load;
if (load1 != null)
{
Log.DebugLine(this, "event target is loaded at {0:X2}", load1.Untyped.Offset);
// 3) Backup until we find a conditional branch. If it's not brfalse or
// not using the same instruction as in step 2 then we have a problem.
bool foundGuard = false;
int j = load1.Index - 1;
while (j > 0 && !foundGuard)
{
ConditionalBranch branch = m_info.Instructions[j] as ConditionalBranch;
if (branch != null)
{
if (branch.Untyped.OpCode.Code == Code.Brfalse || branch.Untyped.OpCode.Code == Code.Brfalse_S)
{
Load load2 = m_info.Instructions[j - 1] as Load;
if (load2 != null)
{
if (load2.Untyped.OpCode.Code == load1.Untyped.OpCode.Code && load2.Untyped.Operand == load1.Untyped.Operand)
{
Log.DebugLine(this, "found guard at {0:X2}", branch.Untyped.Offset);
foundGuard = true;
}
}
}
}
--j;
}
if (!foundGuard)
{
m_offset = call.Untyped.Offset;
Log.DebugLine(this, "no guard for event at {0:X2}", m_offset);
}
}
}
}
}
}
////////////////////////////////////////////////////////////////////////////
public override Statement visit(ConditionalBranch s)
{
ControlStatement result = s;
// var ne = si.fae.visit(this);
ProgramVariable oc = s.condition;
ProgramVariable nc = s.condition;
EqualityDatabase.Representative rep = database.tryGetRepresentative(s.condition);
if (rep != null)
{
Expression ne = rep.expression;
if (ne is LiteralExpression)
{
if (((ne as LiteralExpression).value as BooleanValue).value)
{
result = new UnconditionalBranch(s.trueBranch.source, s.trueBranch.target);
}
else
{
result = new UnconditionalBranch(s.falseBranch.source, s.falseBranch.target);
}
nc = null;
}
else
{
if (ne is ProgramVariableExpression)
{
s.condition = (ne as ProgramVariableExpression).programVariable;
nc = s.condition;
}
else
{
nc =
(EqualityDatabase.getCompactNegationIfBoolean(ne) as ProgramVariableExpression).
programVariable;
result = new ConditionalBranch(
database.statementId.basicBlock,
nc,
s.falseBranch.target,
s.trueBranch.target
);
}
}
}
if (nc != null && !database.conditionVariableIndices.ContainsKey(nc.name))
{
database.addConditionVariable(nc);
}
return(result);
}
// ldarg.1 list
// brtrue 11
public void VisitBranch(ConditionalBranch branch)
{
if (m_needsCheck && m_offset < 0)
{
if (branch.Untyped.OpCode.Code == Code.Brtrue || branch.Untyped.OpCode.Code == Code.Brtrue_S || branch.Untyped.OpCode.Code == Code.Brfalse || branch.Untyped.OpCode.Code == Code.Brfalse_S)
{
LoadArg load = m_info.Instructions[branch.Index - 1] as LoadArg;
if (load != null)
{
m_table[load.Name] = true;
Log.DebugLine(this, "found a compare at {0:X2}", branch.Untyped.Offset);
}
}
}
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////////////////////////////////////
private static void getTargetAssumes(BasicBlock bb, ConditionalBranch cb, out Expression targetE)
{
targetE = null;
if (targetE == null)
{
var ta = cb.trueBranch.target.statements[0].statement as Assume;
var fa = cb.falseBranch.target.statements[0].statement as Assume;
if (ta != null && fa != null && isNegation(ta.expression, fa.expression))
{
targetE = ta.expression;
}
}
}
/// <summary cref="IValueVisitor.Visit(ConditionalBranch)"/>
public void Visit(ConditionalBranch branch)
{
// TODO: refactor if-block generation into a separate emitter
// See also EmitImplicitKernelIndex
var condition = Load(branch.Condition);
AppendIndent();
Builder.Append("if (");
Builder.Append(condition.ToString());
Builder.AppendLine(")");
PushIndent();
GotoStatement(branch.TrueTarget);
PopIndent();
GotoStatement(branch.FalseTarget);
}
// ldfld bool Smokey.Tests.DisposeableTest/NoNullCheck2::m_disposed
// brtrue IL_001d
public void VisitConditional(ConditionalBranch branch)
{
if (m_disposable)
{
if (m_isNullaryDispose || m_isUnaryDispose)
{
if (branch.Index > 0)
{
LoadField load = m_minfo.Instructions[branch.Index - 1] as LoadField;
if (load == null || load.Field.Name.IndexOf("m_disposed") < 0) // testing m_disposed does not count as a branch for null checking
{
m_hasNoBranches = false;
}
}
}
}
}
// Find the following working backwards from index:
// ldsfld field
// brtrue 36
private bool DoFindGuard(int index)
{
while (index > 0)
{
ConditionalBranch branch = m_info.Instructions[index] as ConditionalBranch;
if (branch != null && (branch.Untyped.OpCode.Code == Code.Brtrue || branch.Untyped.OpCode.Code == Code.Brtrue_S))
{
LoadStaticField load = m_info.Instructions[index - 1] as LoadStaticField;
if (load != null && load.Field == m_field)
{
Log.DebugLine(this, "found the guard at {0:X2}", branch.Untyped.Offset);
return(true);
}
}
--index;
}
return(false);
}
/// <summary cref="IValueVisitor.Visit(ConditionalBranch)"/>
public void Visit(ConditionalBranch branch)
{
var condition = LoadPrimitive(branch.Condition);
using (var command = BeginCommand(
PTXInstructions.BranchOperation,
new PredicateConfiguration(condition, true)))
{
var trueLabel = blockLookup[branch.TrueTarget];
command.AppendLabel(trueLabel);
}
// Jump to false target in the else case
using (var command = BeginCommand(PTXInstructions.BranchOperation))
{
var targetLabel = blockLookup[branch.FalseTarget];
command.AppendLabel(targetLabel);
}
}
public void VisitBranch(ConditionalBranch branch)
{
if (m_offset < 0)
{
if (DoMatch1(branch.Index))
{
m_offset = branch.Untyped.Offset;
Log.DebugLine(this, "DoMatch1 matched at {0:X2}", m_offset);
}
else if (DoMatch2(branch.Index))
{
m_offset = branch.Untyped.Offset;
Log.DebugLine(this, "DoMatch2 matched at {0:X2}", m_offset);
}
else if (DoMatch3(branch.Index))
{
m_offset = branch.Untyped.Offset;
Log.DebugLine(this, "DoMatch3 matched at {0:X2}", m_offset);
}
else if (DoMatch5(branch.Index))
{
m_offset = branch.Untyped.Offset;
Log.DebugLine(this, "DoMatch5 matched at {0:X2}", m_offset);
}
else if (DoMatch1b(branch.Index))
{
m_offset = branch.Untyped.Offset;
Log.DebugLine(this, "DoMatch1b matched at {0:X2}", m_offset);
}
else if (DoMatch2b(branch.Index))
{
m_offset = branch.Untyped.Offset;
Log.DebugLine(this, "DoMatch2b matched at {0:X2}", m_offset);
}
else if (DoMatch3b(branch.Index))
{
m_offset = branch.Untyped.Offset;
Log.DebugLine(this, "DoMatch3b matched at {0:X2}", m_offset);
}
}
}
public override void Visit(ConditionalBranch visitable)
{
WriteIndentantion(true).AppendLine("If statement");
WriteIndentantion(true).AppendLine("Predicate:");
Start(visitable.Predicate);
_indentLevel--;
WriteIndentantion(true).AppendLine("Body:");
Start(visitable.Body);
_indentLevel--;
if (visitable.Else != null)
{
WriteIndentantion(true).AppendLine("Else:");
Start(visitable.Else);
_indentLevel--;
}
_indentLevel -= 2;
}
public RobustTabooSearch()
{
Parameters.Add(new ValueParameter <MultiAnalyzer>("Analyzer", "The analyzers that are applied after each iteration.", new MultiAnalyzer()));
Parameters.Add(new FixedValueParameter <IntValue>("Seed", "The seed value of the random number generator.", new IntValue(0)));
Parameters.Add(new FixedValueParameter <BoolValue>("SetSeedRandomly", "True whether the seed should be set randomly for each run, false if it should be fixed.", new BoolValue(true)));
Parameters.Add(new FixedValueParameter <IntValue>("MaximumIterations", "The number of iterations that the algorithm should run.", new IntValue(10000)));
Parameters.Add(new FixedValueParameter <IntValue>("MinimumTabuTenure", "The minimum tabu tenure.", new IntValue(10)));
Parameters.Add(new FixedValueParameter <IntValue>("MaximumTabuTenure", "The maximum tabu tenure.", new IntValue(20)));
Parameters.Add(new FixedValueParameter <BoolValue>("UseAlternativeAspiration", "True if the alternative aspiration condition should be used that takes moves that have not been made for some time above others.", new BoolValue(false)));
Parameters.Add(new FixedValueParameter <IntValue>("AlternativeAspirationTenure", "The time t that a move will be remembered for the alternative aspiration condition.", new IntValue(int.MaxValue)));
Parameters.Add(new FixedValueParameter <BoolValue>("TerminateOnOptimalSolution", "True when the algorithm should stop if it reached a quality equal or smaller to the BestKnownQuality.", new BoolValue(false)));
Parameters.Add(new FixedValueParameter <BoolValue>("UseNewTabuTenureAdaptionScheme", @"In an updated version of his implementation, Eric Taillard introduced a different way to change the tabu tenure.
Instead of setting it uniformly between min and max, it will be set between 0 and max according to a right-skewed distribution.
Set this option to false if you want to optimize using the earlier 1991 version, and set to true if you want to optimize using the newer version.
Please note that the MinimumTabuTenure parameter has no effect in the new version.", new BoolValue(true)));
TerminateOnOptimalSolutionParameter.Hidden = true;
qualityAnalyzer = new BestAverageWorstQualityAnalyzer();
qualityAnalyzer.ResultsParameter.ActualName = "Results";
AnalyzerParameter.Value.Operators.Add(qualityAnalyzer);
RandomCreator randomCreator = new RandomCreator();
randomCreator.RandomParameter.ActualName = "Random";
randomCreator.SeedParameter.Value = null;
randomCreator.SeedParameter.ActualName = SeedParameter.Name;
randomCreator.SetSeedRandomlyParameter.Value = null;
randomCreator.SetSeedRandomlyParameter.ActualName = SetSeedRandomlyParameter.Name;
VariableCreator variableCreator = new VariableCreator();
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>("Iterations", new IntValue(0)));
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>("EvaluatedSolutions", new IntValue(1)));
variableCreator.CollectedValues.Add(new ValueParameter <DoubleValue>("EvaluatedSolutionEquivalents", new DoubleValue(1)));
ResultsCollector resultsCollector = new ResultsCollector();
resultsCollector.CollectedValues.Add(new LookupParameter <IntValue>("Iterations", "The actual iteration."));
resultsCollector.CollectedValues.Add(new LookupParameter <IntValue>("EvaluatedSolutions", "Number of evaluated solutions."));
solutionsCreator = new SolutionsCreator();
solutionsCreator.NumberOfSolutions = new IntValue(1);
Placeholder analyzer = new Placeholder();
analyzer.Name = "(Analyzer)";
analyzer.OperatorParameter.ActualName = AnalyzerParameter.Name;
UniformSubScopesProcessor ussp = new UniformSubScopesProcessor();
mainOperator = new RobustTabooSeachOperator();
mainOperator.AlternativeAspirationTenureParameter.ActualName = AlternativeAspirationTenureParameter.Name;
mainOperator.BestQualityParameter.ActualName = "BestSoFarQuality";
mainOperator.IterationsParameter.ActualName = "Iterations";
mainOperator.LastMoveParameter.ActualName = "LastMove";
mainOperator.MaximumIterationsParameter.ActualName = MaximumIterationsParameter.Name;
mainOperator.MaximumTabuTenureParameter.ActualName = MaximumTabuTenureParameter.Name;
mainOperator.MinimumTabuTenureParameter.ActualName = MinimumTabuTenureParameter.Name;
mainOperator.MoveQualityMatrixParameter.ActualName = "MoveQualityMatrix";
mainOperator.RandomParameter.ActualName = "Random";
mainOperator.ResultsParameter.ActualName = "Results";
mainOperator.ShortTermMemoryParameter.ActualName = "ShortTermMemory";
mainOperator.UseAlternativeAspirationParameter.ActualName = UseAlternativeAspirationParameter.Name;
mainOperator.EvaluatedSolutionsParameter.ActualName = "EvaluatedSolutions";
mainOperator.EvaluatedSolutionEquivalentsParameter.ActualName = "EvaluatedSolutionEquivalents";
ConditionalBranch qualityStopBranch = new ConditionalBranch();
qualityStopBranch.Name = "Terminate on optimal quality?";
qualityStopBranch.ConditionParameter.ActualName = "TerminateOnOptimalSolution";
Comparator qualityComparator = new Comparator();
qualityComparator.Comparison = new Comparison(ComparisonType.Greater);
qualityComparator.LeftSideParameter.ActualName = "BestQuality";
qualityComparator.RightSideParameter.ActualName = "BestKnownQuality";
qualityComparator.ResultParameter.ActualName = "ContinueByQuality";
ConditionalBranch continueByQualityBranch = new ConditionalBranch();
continueByQualityBranch.ConditionParameter.ActualName = "ContinueByQuality";
IntCounter iterationsCounter = new IntCounter();
iterationsCounter.ValueParameter.ActualName = "Iterations";
iterationsCounter.Increment = new IntValue(1);
Comparator comparator = new Comparator();
comparator.Name = "Iterations < MaximumIterations ?";
comparator.LeftSideParameter.ActualName = "Iterations";
comparator.RightSideParameter.ActualName = MaximumIterationsParameter.Name;
comparator.Comparison = new Comparison(ComparisonType.Less);
comparator.ResultParameter.ActualName = "ContinueByIteration";
ConditionalBranch continueByIterationBranch = new ConditionalBranch();
continueByIterationBranch.ConditionParameter.ActualName = "ContinueByIteration";
OperatorGraph.InitialOperator = randomCreator;
randomCreator.Successor = variableCreator;
variableCreator.Successor = resultsCollector;
resultsCollector.Successor = solutionsCreator;
solutionsCreator.Successor = analyzer;
analyzer.Successor = ussp;
ussp.Operator = mainOperator;
ussp.Successor = qualityStopBranch;
qualityStopBranch.FalseBranch = iterationsCounter;
qualityStopBranch.TrueBranch = qualityComparator;
qualityStopBranch.Successor = null;
qualityComparator.Successor = continueByQualityBranch;
continueByQualityBranch.TrueBranch = iterationsCounter;
continueByQualityBranch.FalseBranch = null;
continueByQualityBranch.Successor = null;
iterationsCounter.Successor = comparator;
comparator.Successor = continueByIterationBranch;
continueByIterationBranch.TrueBranch = analyzer;
continueByIterationBranch.FalseBranch = null;
continueByIterationBranch.Successor = null;
RegisterEventHandlers();
Problem = new QuadraticAssignmentProblem();
}
private void Initialize()
{
#region Create parameters
Parameters.Add(new ValueLookupParameter <IRandom>("Random", "A pseudo random number generator."));
Parameters.Add(new ValueLookupParameter <BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
Parameters.Add(new ScopeTreeLookupParameter <DoubleValue>("Quality", "The value which represents the quality of a solution."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("BestKnownQuality", "The best known quality value found so far."));
Parameters.Add(new ValueLookupParameter <IntValue>("PopulationSize", "µ (mu) - the size of the population."));
Parameters.Add(new ValueLookupParameter <IntValue>("ParentsPerChild", "ρ (rho) - how many parents should be recombined."));
Parameters.Add(new ValueLookupParameter <IntValue>("Children", "λ (lambda) - the size of the offspring population."));
Parameters.Add(new ValueLookupParameter <IntValue>("MaximumGenerations", "The maximum number of generations which should be processed."));
Parameters.Add(new ValueLookupParameter <BoolValue>("PlusSelection", "True for plus selection (elitist population), false for comma selection (non-elitist population)."));
Parameters.Add(new ValueLookupParameter <BoolValue>("ReevaluateElites", "Flag to determine if elite individuals should be reevaluated (i.e., if stochastic fitness functions are used.)"));
Parameters.Add(new ValueLookupParameter <IOperator>("Mutator", "The operator used to mutate solutions."));
Parameters.Add(new ValueLookupParameter <IOperator>("Recombinator", "The operator used to cross solutions."));
Parameters.Add(new ValueLookupParameter <IOperator>("Evaluator", "The operator used to evaluate solutions. This operator is executed in parallel, if an engine is used which supports parallelization."));
Parameters.Add(new ValueLookupParameter <VariableCollection>("Results", "The variable collection where results should be stored."));
Parameters.Add(new ValueLookupParameter <IOperator>("Analyzer", "The operator used to analyze each generation."));
Parameters.Add(new LookupParameter <IntValue>("EvaluatedSolutions", "The number of times solutions have been evaluated."));
Parameters.Add(new ScopeParameter("CurrentScope", "The current scope which represents a population of solutions on which the EvolutionStrategy should be applied."));
Parameters.Add(new ValueLookupParameter <IOperator>("StrategyParameterManipulator", "The operator to mutate the endogeneous strategy parameters."));
Parameters.Add(new ValueLookupParameter <IOperator>("StrategyParameterCrossover", "The operator to cross the endogeneous strategy parameters."));
#endregion
#region Create operators
VariableCreator variableCreator = new VariableCreator();
ResultsCollector resultsCollector1 = new ResultsCollector();
Placeholder analyzer1 = new Placeholder();
WithoutRepeatingBatchedRandomSelector selector = new WithoutRepeatingBatchedRandomSelector();
SubScopesProcessor subScopesProcessor1 = new SubScopesProcessor();
Comparator useRecombinationComparator = new Comparator();
ConditionalBranch useRecombinationBranch = new ConditionalBranch();
ChildrenCreator childrenCreator = new ChildrenCreator();
UniformSubScopesProcessor uniformSubScopesProcessor1 = new UniformSubScopesProcessor();
Placeholder recombinator = new Placeholder();
Placeholder strategyRecombinator = new Placeholder();
Placeholder strategyMutator1 = new Placeholder();
Placeholder mutator1 = new Placeholder();
SubScopesRemover subScopesRemover = new SubScopesRemover();
UniformSubScopesProcessor uniformSubScopesProcessor2 = new UniformSubScopesProcessor();
Placeholder strategyMutator2 = new Placeholder();
Placeholder mutator2 = new Placeholder();
UniformSubScopesProcessor uniformSubScopesProcessor3 = new UniformSubScopesProcessor();
Placeholder evaluator = new Placeholder();
SubScopesCounter subScopesCounter = new SubScopesCounter();
ConditionalBranch plusOrCommaReplacementBranch = new ConditionalBranch();
MergingReducer plusReplacement = new MergingReducer();
RightReducer commaReplacement = new RightReducer();
BestSelector bestSelector = new BestSelector();
RightReducer rightReducer = new RightReducer();
IntCounter intCounter = new IntCounter();
Comparator comparator = new Comparator();
Placeholder analyzer2 = new Placeholder();
ConditionalBranch conditionalBranch = new ConditionalBranch();
ConditionalBranch reevaluateElitesBranch = new ConditionalBranch();
SubScopesProcessor subScopesProcessor2 = new SubScopesProcessor();
UniformSubScopesProcessor uniformSubScopesProcessor4 = new UniformSubScopesProcessor();
Placeholder evaluator2 = new Placeholder();
SubScopesCounter subScopesCounter2 = new SubScopesCounter();
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>("Generations", new IntValue(0))); // Class EvolutionStrategy expects this to be called Generations
resultsCollector1.CollectedValues.Add(new LookupParameter <IntValue>("Generations"));
resultsCollector1.ResultsParameter.ActualName = "Results";
analyzer1.Name = "Analyzer (placeholder)";
analyzer1.OperatorParameter.ActualName = AnalyzerParameter.Name;
selector.Name = "ES Random Selector";
selector.RandomParameter.ActualName = RandomParameter.Name;
selector.ParentsPerChildParameter.ActualName = ParentsPerChildParameter.Name;
selector.ChildrenParameter.ActualName = ChildrenParameter.Name;
useRecombinationComparator.Name = "ParentsPerChild > 1";
useRecombinationComparator.LeftSideParameter.ActualName = ParentsPerChildParameter.Name;
useRecombinationComparator.RightSideParameter.Value = new IntValue(1);
useRecombinationComparator.Comparison = new Comparison(ComparisonType.Greater);
useRecombinationComparator.ResultParameter.ActualName = "UseRecombination";
useRecombinationBranch.Name = "Use Recombination?";
useRecombinationBranch.ConditionParameter.ActualName = "UseRecombination";
childrenCreator.ParentsPerChild = null;
childrenCreator.ParentsPerChildParameter.ActualName = ParentsPerChildParameter.Name;
recombinator.Name = "Recombinator (placeholder)";
recombinator.OperatorParameter.ActualName = RecombinatorParameter.Name;
strategyRecombinator.Name = "Strategy Parameter Recombinator (placeholder)";
strategyRecombinator.OperatorParameter.ActualName = StrategyParameterCrossoverParameter.Name;
strategyMutator1.Name = "Strategy Parameter Manipulator (placeholder)";
strategyMutator1.OperatorParameter.ActualName = StrategyParameterManipulatorParameter.Name;
mutator1.Name = "Mutator (placeholder)";
mutator1.OperatorParameter.ActualName = MutatorParameter.Name;
subScopesRemover.RemoveAllSubScopes = true;
strategyMutator2.Name = "Strategy Parameter Manipulator (placeholder)";
strategyMutator2.OperatorParameter.ActualName = StrategyParameterManipulatorParameter.Name;
mutator2.Name = "Mutator (placeholder)";
mutator2.OperatorParameter.ActualName = MutatorParameter.Name;
uniformSubScopesProcessor3.Parallel.Value = true;
evaluator.Name = "Evaluator (placeholder)";
evaluator.OperatorParameter.ActualName = EvaluatorParameter.Name;
subScopesCounter.Name = "Increment EvaluatedSolutions";
subScopesCounter.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
plusOrCommaReplacementBranch.ConditionParameter.ActualName = PlusSelectionParameter.Name;
bestSelector.CopySelected = new BoolValue(false);
bestSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
bestSelector.NumberOfSelectedSubScopesParameter.ActualName = PopulationSizeParameter.Name;
bestSelector.QualityParameter.ActualName = QualityParameter.Name;
intCounter.Increment = new IntValue(1);
intCounter.ValueParameter.ActualName = "Generations";
comparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
comparator.LeftSideParameter.ActualName = "Generations";
comparator.ResultParameter.ActualName = "Terminate";
comparator.RightSideParameter.ActualName = MaximumGenerationsParameter.Name;
analyzer2.Name = "Analyzer (placeholder)";
analyzer2.OperatorParameter.ActualName = AnalyzerParameter.Name;
conditionalBranch.ConditionParameter.ActualName = "Terminate";
reevaluateElitesBranch.ConditionParameter.ActualName = "ReevaluateElites";
reevaluateElitesBranch.Name = "Reevaluate elites ?";
uniformSubScopesProcessor4.Parallel.Value = true;
evaluator2.Name = "Evaluator (placeholder)";
evaluator2.OperatorParameter.ActualName = EvaluatorParameter.Name;
subScopesCounter2.Name = "Increment EvaluatedSolutions";
subScopesCounter2.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
#endregion
#region Create operator graph
OperatorGraph.InitialOperator = variableCreator;
variableCreator.Successor = resultsCollector1;
resultsCollector1.Successor = analyzer1;
analyzer1.Successor = selector;
selector.Successor = subScopesProcessor1;
subScopesProcessor1.Operators.Add(new EmptyOperator());
subScopesProcessor1.Operators.Add(useRecombinationComparator);
subScopesProcessor1.Successor = plusOrCommaReplacementBranch;
useRecombinationComparator.Successor = useRecombinationBranch;
useRecombinationBranch.TrueBranch = childrenCreator;
useRecombinationBranch.FalseBranch = uniformSubScopesProcessor2;
useRecombinationBranch.Successor = uniformSubScopesProcessor3;
childrenCreator.Successor = uniformSubScopesProcessor1;
uniformSubScopesProcessor1.Operator = recombinator;
uniformSubScopesProcessor1.Successor = null;
recombinator.Successor = strategyRecombinator;
strategyRecombinator.Successor = strategyMutator1;
strategyMutator1.Successor = mutator1;
mutator1.Successor = subScopesRemover;
subScopesRemover.Successor = null;
uniformSubScopesProcessor2.Operator = strategyMutator2;
uniformSubScopesProcessor2.Successor = null;
strategyMutator2.Successor = mutator2;
mutator2.Successor = null;
uniformSubScopesProcessor3.Operator = evaluator;
uniformSubScopesProcessor3.Successor = subScopesCounter;
evaluator.Successor = null;
subScopesCounter.Successor = null;
plusOrCommaReplacementBranch.TrueBranch = reevaluateElitesBranch;
reevaluateElitesBranch.TrueBranch = subScopesProcessor2;
reevaluateElitesBranch.FalseBranch = null;
subScopesProcessor2.Operators.Add(uniformSubScopesProcessor4);
subScopesProcessor2.Operators.Add(new EmptyOperator());
uniformSubScopesProcessor4.Operator = evaluator2;
uniformSubScopesProcessor4.Successor = subScopesCounter2;
subScopesCounter2.Successor = null;
reevaluateElitesBranch.Successor = plusReplacement;
plusOrCommaReplacementBranch.FalseBranch = commaReplacement;
plusOrCommaReplacementBranch.Successor = bestSelector;
bestSelector.Successor = rightReducer;
rightReducer.Successor = intCounter;
intCounter.Successor = comparator;
comparator.Successor = analyzer2;
analyzer2.Successor = conditionalBranch;
conditionalBranch.FalseBranch = selector;
conditionalBranch.TrueBranch = null;
conditionalBranch.Successor = null;
#endregion
}
private void Initialize()
{
#region Create parameters
Parameters.Add(new ValueLookupParameter <IRandom>("Random", "A pseudo random number generator."));
Parameters.Add(new ValueLookupParameter <BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
Parameters.Add(new ScopeTreeLookupParameter <DoubleValue>("Quality", "The value which represents the quality of a solution."));
Parameters.Add(new ValueLookupParameter <IOperator>("Selector", "The operator used to select solutions for reproduction."));
Parameters.Add(new ValueLookupParameter <IOperator>("Crossover", "The operator used to cross solutions."));
Parameters.Add(new ValueLookupParameter <PercentValue>("MutationProbability", "The probability that the mutation operator is applied on a solution."));
Parameters.Add(new ValueLookupParameter <IOperator>("Mutator", "The operator used to mutate solutions."));
Parameters.Add(new ValueLookupParameter <IOperator>("Evaluator", "The operator used to evaluate solutions. This operator is executed in parallel, if an engine is used which supports parallelization."));
Parameters.Add(new LookupParameter <IntValue>("EvaluatedSolutions", "The number of evaluated solutions."));
Parameters.Add(new ValueLookupParameter <IntValue>("Elites", "The numer of elite solutions which are kept in each generation."));
Parameters.Add(new ValueLookupParameter <BoolValue>("ReevaluateElites", "Flag to determine if elite individuals should be reevaluated (i.e., if stochastic fitness functions are used.)"));
Parameters.Add(new LookupParameter <DoubleValue>("ComparisonFactor", "The comparison factor is used to determine whether the offspring should be compared to the better parent, the worse parent or a quality value linearly interpolated between them. It is in the range [0;1]."));
Parameters.Add(new LookupParameter <DoubleValue>("CurrentSuccessRatio", "The current success ratio."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("SuccessRatio", "The ratio of successful to total children that should be achieved."));
Parameters.Add(new LookupParameter <DoubleValue>("SelectionPressure", "The actual selection pressure."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("MaximumSelectionPressure", "The maximum selection pressure that terminates the algorithm."));
Parameters.Add(new ValueLookupParameter <BoolValue>("OffspringSelectionBeforeMutation", "True if the offspring selection step should be applied before mutation, false if it should be applied after mutation."));
Parameters.Add(new ValueLookupParameter <BoolValue>("FillPopulationWithParents", "True if the population should be filled with parent individual or false if worse children should be used when the maximum selection pressure is exceeded."));
#endregion
#region Create operators
Placeholder selector = new Placeholder();
SubScopesProcessor subScopesProcessor1 = new SubScopesProcessor();
ChildrenCreator childrenCreator = new ChildrenCreator();
ConditionalBranch osBeforeMutationBranch = new ConditionalBranch();
UniformSubScopesProcessor uniformSubScopesProcessor1 = new UniformSubScopesProcessor();
Placeholder crossover1 = new Placeholder();
UniformSubScopesProcessor uniformSubScopesProcessor2 = new UniformSubScopesProcessor();
Placeholder evaluator1 = new Placeholder();
SubScopesCounter subScopesCounter1 = new SubScopesCounter();
WeightedParentsQualityComparator qualityComparer1 = new WeightedParentsQualityComparator();
SubScopesRemover subScopesRemover1 = new SubScopesRemover();
UniformSubScopesProcessor uniformSubScopesProcessor3 = new UniformSubScopesProcessor();
StochasticBranch mutationBranch1 = new StochasticBranch();
Placeholder mutator1 = new Placeholder();
VariableCreator variableCreator1 = new VariableCreator();
VariableCreator variableCreator2 = new VariableCreator();
ConditionalSelector conditionalSelector = new ConditionalSelector();
SubScopesProcessor subScopesProcessor2 = new SubScopesProcessor();
UniformSubScopesProcessor uniformSubScopesProcessor4 = new UniformSubScopesProcessor();
Placeholder evaluator2 = new Placeholder();
SubScopesCounter subScopesCounter2 = new SubScopesCounter();
MergingReducer mergingReducer1 = new MergingReducer();
UniformSubScopesProcessor uniformSubScopesProcessor5 = new UniformSubScopesProcessor();
Placeholder crossover2 = new Placeholder();
StochasticBranch mutationBranch2 = new StochasticBranch();
Placeholder mutator2 = new Placeholder();
UniformSubScopesProcessor uniformSubScopesProcessor6 = new UniformSubScopesProcessor();
Placeholder evaluator3 = new Placeholder();
SubScopesCounter subScopesCounter3 = new SubScopesCounter();
WeightedParentsQualityComparator qualityComparer2 = new WeightedParentsQualityComparator();
SubScopesRemover subScopesRemover2 = new SubScopesRemover();
OffspringSelector offspringSelector = new OffspringSelector();
SubScopesProcessor subScopesProcessor3 = new SubScopesProcessor();
BestSelector bestSelector = new BestSelector();
WorstSelector worstSelector = new WorstSelector();
RightReducer rightReducer = new RightReducer();
LeftReducer leftReducer = new LeftReducer();
MergingReducer mergingReducer2 = new MergingReducer();
ConditionalBranch reevaluateElitesBranch = new ConditionalBranch();
UniformSubScopesProcessor uniformSubScopesProcessor7 = new UniformSubScopesProcessor();
Placeholder evaluator4 = new Placeholder();
SubScopesCounter subScopesCounter4 = new SubScopesCounter();
selector.Name = "Selector (placeholder)";
selector.OperatorParameter.ActualName = SelectorParameter.Name;
childrenCreator.ParentsPerChild = new IntValue(2);
osBeforeMutationBranch.Name = "Apply OS before mutation?";
osBeforeMutationBranch.ConditionParameter.ActualName = OffspringSelectionBeforeMutationParameter.Name;
crossover1.Name = "Crossover (placeholder)";
crossover1.OperatorParameter.ActualName = CrossoverParameter.Name;
uniformSubScopesProcessor2.Parallel.Value = true;
evaluator1.Name = "Evaluator (placeholder)";
evaluator1.OperatorParameter.ActualName = EvaluatorParameter.Name;
subScopesCounter1.Name = "Increment EvaluatedSolutions";
subScopesCounter1.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
qualityComparer1.ComparisonFactorParameter.ActualName = ComparisonFactorParameter.Name;
qualityComparer1.LeftSideParameter.ActualName = QualityParameter.Name;
qualityComparer1.MaximizationParameter.ActualName = MaximizationParameter.Name;
qualityComparer1.RightSideParameter.ActualName = QualityParameter.Name;
qualityComparer1.ResultParameter.ActualName = "SuccessfulOffspring";
subScopesRemover1.RemoveAllSubScopes = true;
mutationBranch1.ProbabilityParameter.ActualName = MutationProbabilityParameter.Name;
mutationBranch1.RandomParameter.ActualName = RandomParameter.Name;
mutator1.Name = "Mutator (placeholder)";
mutator1.OperatorParameter.ActualName = MutatorParameter.Name;
variableCreator1.Name = "MutatedOffspring = true";
variableCreator1.CollectedValues.Add(new ValueParameter <BoolValue>("MutatedOffspring", null, new BoolValue(true), false));
variableCreator2.Name = "MutatedOffspring = false";
variableCreator2.CollectedValues.Add(new ValueParameter <BoolValue>("MutatedOffspring", null, new BoolValue(false), false));
conditionalSelector.ConditionParameter.ActualName = "MutatedOffspring";
conditionalSelector.ConditionParameter.Depth = 1;
conditionalSelector.CopySelected.Value = false;
uniformSubScopesProcessor4.Parallel.Value = true;
evaluator2.Name = "Evaluator (placeholder)";
evaluator2.OperatorParameter.ActualName = EvaluatorParameter.Name;
subScopesCounter2.Name = "Increment EvaluatedSolutions";
subScopesCounter2.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
crossover2.Name = "Crossover (placeholder)";
crossover2.OperatorParameter.ActualName = CrossoverParameter.Name;
mutationBranch2.ProbabilityParameter.ActualName = MutationProbabilityParameter.Name;
mutationBranch2.RandomParameter.ActualName = RandomParameter.Name;
mutator2.Name = "Mutator (placeholder)";
mutator2.OperatorParameter.ActualName = MutatorParameter.Name;
uniformSubScopesProcessor6.Parallel.Value = true;
evaluator3.Name = "Evaluator (placeholder)";
evaluator3.OperatorParameter.ActualName = EvaluatorParameter.Name;
subScopesCounter3.Name = "Increment EvaluatedSolutions";
subScopesCounter3.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
qualityComparer2.ComparisonFactorParameter.ActualName = ComparisonFactorParameter.Name;
qualityComparer2.LeftSideParameter.ActualName = QualityParameter.Name;
qualityComparer2.MaximizationParameter.ActualName = MaximizationParameter.Name;
qualityComparer2.RightSideParameter.ActualName = QualityParameter.Name;
qualityComparer2.ResultParameter.ActualName = "SuccessfulOffspring";
subScopesRemover2.RemoveAllSubScopes = true;
offspringSelector.CurrentSuccessRatioParameter.ActualName = CurrentSuccessRatioParameter.Name;
offspringSelector.MaximumSelectionPressureParameter.ActualName = MaximumSelectionPressureParameter.Name;
offspringSelector.SelectionPressureParameter.ActualName = SelectionPressureParameter.Name;
offspringSelector.SuccessRatioParameter.ActualName = SuccessRatioParameter.Name;
offspringSelector.OffspringPopulationParameter.ActualName = "OffspringPopulation";
offspringSelector.OffspringPopulationWinnersParameter.ActualName = "OffspringPopulationWinners";
offspringSelector.SuccessfulOffspringParameter.ActualName = "SuccessfulOffspring";
offspringSelector.FillPopulationWithParentsParameter.ActualName = FillPopulationWithParentsParameter.Name;
bestSelector.CopySelected = new BoolValue(false);
bestSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
bestSelector.NumberOfSelectedSubScopesParameter.ActualName = ElitesParameter.Name;
bestSelector.QualityParameter.ActualName = QualityParameter.Name;
worstSelector.CopySelected = new BoolValue(false);
worstSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
worstSelector.NumberOfSelectedSubScopesParameter.ActualName = ElitesParameter.Name;
worstSelector.QualityParameter.ActualName = QualityParameter.Name;
reevaluateElitesBranch.ConditionParameter.ActualName = "ReevaluateElites";
reevaluateElitesBranch.Name = "Reevaluate elites ?";
uniformSubScopesProcessor7.Parallel.Value = true;
evaluator4.Name = "Evaluator (placeholder)";
evaluator4.OperatorParameter.ActualName = EvaluatorParameter.Name;
subScopesCounter4.Name = "Increment EvaluatedSolutions";
subScopesCounter4.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
#endregion
#region Create operator graph
OperatorGraph.InitialOperator = selector;
selector.Successor = subScopesProcessor1;
subScopesProcessor1.Operators.Add(new EmptyOperator());
subScopesProcessor1.Operators.Add(childrenCreator);
subScopesProcessor1.Successor = offspringSelector;
childrenCreator.Successor = osBeforeMutationBranch;
osBeforeMutationBranch.TrueBranch = uniformSubScopesProcessor1;
osBeforeMutationBranch.FalseBranch = uniformSubScopesProcessor5;
osBeforeMutationBranch.Successor = null;
uniformSubScopesProcessor1.Operator = crossover1;
uniformSubScopesProcessor1.Successor = uniformSubScopesProcessor2;
crossover1.Successor = null;
uniformSubScopesProcessor2.Operator = evaluator1;
uniformSubScopesProcessor2.Successor = subScopesCounter1;
evaluator1.Successor = qualityComparer1;
qualityComparer1.Successor = subScopesRemover1;
subScopesRemover1.Successor = null;
subScopesCounter1.Successor = uniformSubScopesProcessor3;
uniformSubScopesProcessor3.Operator = mutationBranch1;
uniformSubScopesProcessor3.Successor = conditionalSelector;
mutationBranch1.FirstBranch = mutator1;
mutationBranch1.SecondBranch = variableCreator2;
mutationBranch1.Successor = null;
mutator1.Successor = variableCreator1;
variableCreator1.Successor = null;
variableCreator2.Successor = null;
conditionalSelector.Successor = subScopesProcessor2;
subScopesProcessor2.Operators.Add(new EmptyOperator());
subScopesProcessor2.Operators.Add(uniformSubScopesProcessor4);
subScopesProcessor2.Successor = mergingReducer1;
uniformSubScopesProcessor4.Operator = evaluator2;
uniformSubScopesProcessor4.Successor = subScopesCounter2;
evaluator2.Successor = null;
subScopesCounter2.Successor = null;
mergingReducer1.Successor = null;
uniformSubScopesProcessor5.Operator = crossover2;
uniformSubScopesProcessor5.Successor = uniformSubScopesProcessor6;
crossover2.Successor = mutationBranch2;
mutationBranch2.FirstBranch = mutator2;
mutationBranch2.SecondBranch = null;
mutationBranch2.Successor = null;
mutator2.Successor = null;
uniformSubScopesProcessor6.Operator = evaluator3;
uniformSubScopesProcessor6.Successor = subScopesCounter3;
evaluator3.Successor = qualityComparer2;
qualityComparer2.Successor = subScopesRemover2;
subScopesRemover2.Successor = null;
subScopesCounter3.Successor = null;
offspringSelector.OffspringCreator = selector;
offspringSelector.Successor = subScopesProcessor3;
subScopesProcessor3.Operators.Add(bestSelector);
subScopesProcessor3.Operators.Add(worstSelector);
subScopesProcessor3.Successor = mergingReducer2;
bestSelector.Successor = rightReducer;
rightReducer.Successor = reevaluateElitesBranch;
reevaluateElitesBranch.TrueBranch = uniformSubScopesProcessor7;
uniformSubScopesProcessor7.Operator = evaluator4;
uniformSubScopesProcessor7.Successor = subScopesCounter4;
subScopesCounter4.Successor = null;
reevaluateElitesBranch.FalseBranch = null;
reevaluateElitesBranch.Successor = null;
worstSelector.Successor = leftReducer;
leftReducer.Successor = null;
mergingReducer2.Successor = null;
#endregion
}
private void Initialize()
{
#region Create parameters
Parameters.Add(new ValueLookupParameter <IRandom>("Random", "A pseudo random number generator."));
Parameters.Add(new ValueLookupParameter <BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
Parameters.Add(new LookupParameter <DoubleValue>("Quality", "The value which represents the quality of a solution."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("BestKnownQuality", "The best known quality value found so far."));
Parameters.Add(new LookupParameter <DoubleValue>("MoveQuality", "The value which represents the quality of a move."));
Parameters.Add(new LookupParameter <DoubleValue>("Temperature", "The current temperature."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("StartTemperature", "The initial temperature."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("EndTemperature", "The end temperature."));
Parameters.Add(new ValueLookupParameter <IntValue>("InnerIterations", "The amount of inner iterations (number of moves before temperature is adjusted again)."));
Parameters.Add(new LookupParameter <IntValue>("Iterations", "The number of iterations."));
Parameters.Add(new ValueLookupParameter <IntValue>("MaximumIterations", "The maximum number of iterations which should be processed."));
Parameters.Add(new ValueLookupParameter <IOperator>("MoveGenerator", "The operator that generates the moves."));
Parameters.Add(new ValueLookupParameter <IOperator>("MoveEvaluator", "The operator that evaluates a move."));
Parameters.Add(new ValueLookupParameter <IOperator>("MoveMaker", "The operator that performs a move and updates the quality."));
Parameters.Add(new ValueLookupParameter <IOperator>("AnnealingOperator", "The operator that modifies the temperature."));
Parameters.Add(new ValueLookupParameter <IOperator>("Analyzer", "The operator used to analyze each generation."));
Parameters.Add(new ValueLookupParameter <VariableCollection>("Results", "The variable collection where results should be stored."));
Parameters.Add(new LookupParameter <IntValue>("EvaluatedMoves", "The number of evaluated moves."));
#endregion
#region Create operators
Assigner temperatureInitializer = new Assigner();
ResultsCollector resultsCollector1 = new ResultsCollector();
SubScopesProcessor subScopesProcessor0 = new SubScopesProcessor();
Placeholder analyzer1 = new Placeholder();
SubScopesProcessor sssp = new SubScopesProcessor();
ResultsCollector resultsCollector = new ResultsCollector();
Placeholder annealingOperator = new Placeholder();
UniformSubScopesProcessor mainProcessor = new UniformSubScopesProcessor();
Placeholder moveGenerator = new Placeholder();
UniformSubScopesProcessor moveEvaluationProcessor = new UniformSubScopesProcessor();
Placeholder moveEvaluator = new Placeholder();
SubScopesCounter subScopesCounter = new SubScopesCounter();
ProbabilisticQualityComparator qualityComparator = new ProbabilisticQualityComparator();
ConditionalBranch improvesQualityBranch = new ConditionalBranch();
Placeholder moveMaker = new Placeholder();
SubScopesRemover subScopesRemover = new SubScopesRemover();
IntCounter iterationsCounter = new IntCounter();
Comparator iterationsComparator = new Comparator();
SubScopesProcessor subScopesProcessor1 = new SubScopesProcessor();
Placeholder analyzer2 = new Placeholder();
ConditionalBranch iterationsTermination = new ConditionalBranch();
temperatureInitializer.LeftSideParameter.ActualName = TemperatureParameter.ActualName;
temperatureInitializer.RightSideParameter.ActualName = StartTemperatureParameter.Name;
resultsCollector1.CollectedValues.Add(new LookupParameter <IntValue>(IterationsParameter.Name));
resultsCollector1.ResultsParameter.ActualName = ResultsParameter.Name;
analyzer1.Name = "Analyzer (placeholder)";
analyzer1.OperatorParameter.ActualName = AnalyzerParameter.Name;
annealingOperator.Name = "Annealing operator (placeholder)";
annealingOperator.OperatorParameter.ActualName = AnnealingOperatorParameter.Name;
moveGenerator.Name = "Move generator (placeholder)";
moveGenerator.OperatorParameter.ActualName = MoveGeneratorParameter.Name;
moveEvaluator.Name = "Move evaluator (placeholder)";
moveEvaluator.OperatorParameter.ActualName = MoveEvaluatorParameter.Name;
subScopesCounter.Name = "Increment EvaluatedMoves";
subScopesCounter.ValueParameter.ActualName = EvaluatedMovesParameter.Name;
qualityComparator.LeftSideParameter.ActualName = MoveQualityParameter.Name;
qualityComparator.RightSideParameter.ActualName = QualityParameter.Name;
qualityComparator.ResultParameter.ActualName = "IsBetter";
qualityComparator.DampeningParameter.ActualName = "Temperature";
improvesQualityBranch.ConditionParameter.ActualName = "IsBetter";
moveMaker.Name = "Move maker (placeholder)";
moveMaker.OperatorParameter.ActualName = MoveMakerParameter.Name;
subScopesRemover.RemoveAllSubScopes = true;
iterationsCounter.Name = "Increment Iterations";
iterationsCounter.Increment = new IntValue(1);
iterationsCounter.ValueParameter.ActualName = IterationsParameter.Name;
iterationsComparator.Name = "Iterations >= MaximumIterations";
iterationsComparator.LeftSideParameter.ActualName = IterationsParameter.Name;
iterationsComparator.RightSideParameter.ActualName = MaximumIterationsParameter.Name;
iterationsComparator.ResultParameter.ActualName = "Terminate";
iterationsComparator.Comparison.Value = ComparisonType.GreaterOrEqual;
analyzer2.Name = "Analyzer (placeholder)";
analyzer2.OperatorParameter.ActualName = AnalyzerParameter.Name;
iterationsTermination.Name = "Iterations termination condition";
iterationsTermination.ConditionParameter.ActualName = "Terminate";
#endregion
#region Create operator graph
OperatorGraph.InitialOperator = temperatureInitializer;
temperatureInitializer.Successor = resultsCollector1;
resultsCollector1.Successor = subScopesProcessor0;
subScopesProcessor0.Operators.Add(analyzer1);
subScopesProcessor0.Successor = sssp;
analyzer1.Successor = null;
sssp.Operators.Add(resultsCollector);
sssp.Successor = annealingOperator;
resultsCollector.Successor = null;
annealingOperator.Successor = mainProcessor;
mainProcessor.Operator = moveGenerator;
mainProcessor.Successor = iterationsCounter;
moveGenerator.Successor = moveEvaluationProcessor;
moveEvaluationProcessor.Operator = moveEvaluator;
moveEvaluationProcessor.Successor = subScopesCounter;
moveEvaluator.Successor = qualityComparator;
qualityComparator.Successor = improvesQualityBranch;
improvesQualityBranch.TrueBranch = moveMaker;
improvesQualityBranch.FalseBranch = null;
improvesQualityBranch.Successor = null;
moveMaker.Successor = null;
subScopesCounter.Successor = subScopesRemover;
subScopesRemover.Successor = null;
iterationsCounter.Successor = iterationsComparator;
iterationsComparator.Successor = subScopesProcessor1;
subScopesProcessor1.Operators.Add(analyzer2);
subScopesProcessor1.Successor = iterationsTermination;
iterationsTermination.TrueBranch = null;
iterationsTermination.FalseBranch = annealingOperator;
#endregion
}
public LbfgsAlgorithm()
: base()
{
Parameters.Add(new ValueParameter <IMultiAnalyzer>(AnalyzerParameterName, "The analyzers that will be executed on the solution.", new MultiAnalyzer()));
Parameters.Add(new ValueParameter <IntValue>(MaxIterationsParameterName, "The maximal number of iterations for.", new IntValue(20)));
Parameters.Add(new ValueParameter <IntValue>(SeedParameterName, "The random seed used to initialize the new pseudo random number generator.", new IntValue(0)));
Parameters.Add(new ValueParameter <BoolValue>(SetSeedRandomlyParameterName, "True if the random seed should be set to a random value, otherwise false.", new BoolValue(true)));
Parameters.Add(new ValueParameter <BoolValue>(ApproximateGradientsParameterName, "Indicates that gradients should be approximated.", new BoolValue(true)));
Parameters.Add(new OptionalValueParameter <DoubleValue>(GradientCheckStepSizeParameterName, "Step size for the gradient check (should be used for debugging the gradient calculation only)."));
// these parameter should not be changed usually
Parameters[ApproximateGradientsParameterName].Hidden = true;
Parameters[GradientCheckStepSizeParameterName].Hidden = true;
var randomCreator = new RandomCreator();
solutionCreator = new Placeholder();
initializer = new LbfgsInitializer();
makeStep = new LbfgsMakeStep();
var branch = new ConditionalBranch();
evaluator = new Placeholder();
updateResults = new LbfgsUpdateResults();
var analyzerPlaceholder = new Placeholder();
var finalAnalyzerPlaceholder = new Placeholder();
OperatorGraph.InitialOperator = randomCreator;
randomCreator.SeedParameter.ActualName = SeedParameterName;
randomCreator.SeedParameter.Value = null;
randomCreator.SetSeedRandomlyParameter.ActualName = SetSeedRandomlyParameterName;
randomCreator.SetSeedRandomlyParameter.Value = null;
randomCreator.Successor = solutionCreator;
solutionCreator.Name = "(Solution Creator)";
solutionCreator.Successor = initializer;
initializer.IterationsParameter.ActualName = MaxIterationsParameterName;
initializer.ApproximateGradientsParameter.ActualName = ApproximateGradientsParameterName;
initializer.Successor = makeStep;
makeStep.StateParameter.ActualName = initializer.StateParameter.Name;
makeStep.Successor = branch;
branch.ConditionParameter.ActualName = makeStep.TerminationCriterionParameter.Name;
branch.FalseBranch = evaluator;
branch.TrueBranch = finalAnalyzerPlaceholder;
evaluator.Name = "(Evaluator)";
evaluator.Successor = updateResults;
updateResults.StateParameter.ActualName = initializer.StateParameter.Name;
updateResults.ApproximateGradientsParameter.ActualName = ApproximateGradientsParameterName;
updateResults.Successor = analyzerPlaceholder;
analyzerPlaceholder.Name = "(Analyzer)";
analyzerPlaceholder.OperatorParameter.ActualName = AnalyzerParameterName;
analyzerPlaceholder.Successor = makeStep;
finalAnalyzerPlaceholder.Name = "(Analyzer)";
finalAnalyzerPlaceholder.OperatorParameter.ActualName = AnalyzerParameterName;
finalAnalyzerPlaceholder.Successor = null;
analyzer = new LbfgsAnalyzer();
analyzer.StateParameter.ActualName = initializer.StateParameter.Name;
}
private void Initialize()
{
#region Create parameters
Parameters.Add(new ValueLookupParameter <IMultiAnalyzer>("Analyzer", "The analyzer used to analyze each iteration."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("BestKnownQuality", "The best known quality value found so far."));
Parameters.Add(new ValueLookupParameter <ICrossover>("Crossover", "The operator used to cross solutions."));
Parameters.Add(new ValueLookupParameter <IntValue>("EvaluatedSolutions", "The number of times solutions have been evaluated."));
Parameters.Add(new ValueLookupParameter <IEvaluator>("Evaluator", "The operator used to evaluate solutions. This operator is executed in parallel, if an engine is used which supports parallelization."));
Parameters.Add(new ValueLookupParameter <BoolValue>("ExecutePathRelinking", "True if path relinking should be executed instead of crossover, otherwise false."));
Parameters.Add(new ValueLookupParameter <IImprovementOperator>("Improver", "The operator used to improve solutions."));
Parameters.Add(new ValueLookupParameter <IntValue>("Iterations", "The number of iterations performed."));
Parameters.Add(new ValueLookupParameter <BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
Parameters.Add(new ValueLookupParameter <IntValue>("MaximumIterations", "The maximum number of iterations which should be processed."));
Parameters.Add(new ValueLookupParameter <IntValue>("NumberOfHighQualitySolutions", "The number of high quality solutions in the reference set."));
Parameters.Add(new ValueLookupParameter <IPathRelinker>("PathRelinker", "The operator used to execute path relinking."));
Parameters.Add(new ValueLookupParameter <IntValue>("PopulationSize", "The size of the population of solutions."));
Parameters.Add(new ValueLookupParameter <IntValue>("ReferenceSetSize", "The size of the reference set."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("Quality", "This parameter is used for name translation only."));
Parameters.Add(new ValueLookupParameter <IRandom>("Random", "A pseudo random number generator."));
Parameters.Add(new ValueLookupParameter <VariableCollection>("Results", "The variable collection where results should be stored."));
Parameters.Add(new ValueLookupParameter <ISolutionSimilarityCalculator>("SimilarityCalculator", "The operator used to calculate the similarity between two solutions."));
#endregion
#region Create operators
Placeholder analyzer = new Placeholder();
Assigner assigner1 = new Assigner();
Assigner assigner2 = new Assigner();
ChildrenCreator childrenCreator = new ChildrenCreator();
Placeholder crossover = new Placeholder();
Comparator iterationsChecker = new Comparator();
IntCounter iterationsCounter = new IntCounter();
MergingReducer mergingReducer = new MergingReducer();
ConditionalBranch executePathRelinkingBranch = new ConditionalBranch();
ConditionalBranch newSolutionsBranch = new ConditionalBranch();
OffspringProcessor offspringProcessor = new OffspringProcessor();
Placeholder pathRelinker = new Placeholder();
PopulationRebuildMethod populationRebuildMethod = new PopulationRebuildMethod();
ReferenceSetUpdateMethod referenceSetUpdateMethod = new ReferenceSetUpdateMethod();
ResultsCollector resultsCollector = new ResultsCollector();
RightSelector rightSelector = new RightSelector();
Placeholder solutionEvaluator1 = new Placeholder();
Placeholder solutionEvaluator2 = new Placeholder();
Placeholder solutionImprover1 = new Placeholder();
Placeholder solutionImprover2 = new Placeholder();
SolutionPoolUpdateMethod solutionPoolUpdateMethod = new SolutionPoolUpdateMethod();
SolutionsCreator solutionsCreator = new SolutionsCreator();
DataReducer dataReducer1 = new DataReducer();
DataReducer dataReducer2 = new DataReducer();
SubScopesProcessor subScopesProcessor1 = new SubScopesProcessor();
SubScopesProcessor subScopesProcessor2 = new SubScopesProcessor();
SubScopesProcessor subScopesProcessor3 = new SubScopesProcessor();
SubScopesProcessor subScopesProcessor4 = new SubScopesProcessor();
ConditionalBranch terminateBranch = new ConditionalBranch();
UniformSubScopesProcessor uniformSubScopesProcessor1 = new UniformSubScopesProcessor();
UniformSubScopesProcessor uniformSubScopesProcessor2 = new UniformSubScopesProcessor();
UniformSubScopesProcessor uniformSubScopesProcessor3 = new UniformSubScopesProcessor();
VariableCreator variableCreator = new VariableCreator();
#endregion
#region Create operator graph
OperatorGraph.InitialOperator = variableCreator;
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>(IterationsParameter.Name, new IntValue(0)));
variableCreator.CollectedValues.Add(new ValueParameter <BoolValue>("NewSolutions", new BoolValue(false)));
variableCreator.Successor = resultsCollector;
resultsCollector.CopyValue = new BoolValue(false);
resultsCollector.CollectedValues.Add(new LookupParameter <IntValue>(IterationsParameter.Name));
resultsCollector.ResultsParameter.ActualName = ResultsParameter.Name;
resultsCollector.Successor = iterationsChecker;
iterationsChecker.Name = "IterationsChecker";
iterationsChecker.Comparison.Value = ComparisonType.GreaterOrEqual;
iterationsChecker.LeftSideParameter.ActualName = IterationsParameter.Name;
iterationsChecker.RightSideParameter.ActualName = MaximumIterationsParameter.Name;
iterationsChecker.ResultParameter.ActualName = "Terminate";
iterationsChecker.Successor = terminateBranch;
terminateBranch.Name = "TerminateChecker";
terminateBranch.ConditionParameter.ActualName = "Terminate";
terminateBranch.FalseBranch = referenceSetUpdateMethod;
referenceSetUpdateMethod.Successor = assigner1;
assigner1.Name = "NewSolutions = true";
assigner1.LeftSideParameter.ActualName = "NewSolutions";
assigner1.RightSideParameter.Value = new BoolValue(true);
assigner1.Successor = subScopesProcessor1;
subScopesProcessor1.DepthParameter.Value = new IntValue(1);
subScopesProcessor1.Operators.Add(new EmptyOperator());
subScopesProcessor1.Operators.Add(childrenCreator);
subScopesProcessor1.Successor = newSolutionsBranch;
childrenCreator.Name = "SubsetGenerator";
childrenCreator.ParentsPerChildParameter.Value = new IntValue(2);
childrenCreator.Successor = assigner2;
assigner2.Name = "NewSolutions = false";
assigner2.LeftSideParameter.ActualName = "NewSolutions";
assigner2.RightSideParameter.Value = new BoolValue(false);
assigner2.Successor = uniformSubScopesProcessor1;
uniformSubScopesProcessor1.DepthParameter.Value = new IntValue(1);
uniformSubScopesProcessor1.Operator = executePathRelinkingBranch;
uniformSubScopesProcessor1.Successor = solutionPoolUpdateMethod;
executePathRelinkingBranch.Name = "ExecutePathRelinkingChecker";
executePathRelinkingBranch.ConditionParameter.ActualName = ExecutePathRelinkingParameter.ActualName;
executePathRelinkingBranch.TrueBranch = pathRelinker;
executePathRelinkingBranch.FalseBranch = crossover;
pathRelinker.Name = "PathRelinker";
pathRelinker.OperatorParameter.ActualName = PathRelinkerParameter.Name;
pathRelinker.Successor = rightSelector;
crossover.Name = "Crossover";
crossover.OperatorParameter.ActualName = CrossoverParameter.Name;
crossover.Successor = offspringProcessor;
offspringProcessor.Successor = rightSelector;
rightSelector.NumberOfSelectedSubScopesParameter.Value = new IntValue(1);
rightSelector.CopySelected = new BoolValue(false);
rightSelector.Successor = subScopesProcessor2;
subScopesProcessor2.DepthParameter.Value = new IntValue(1);
subScopesProcessor2.Operators.Add(new EmptyOperator());
subScopesProcessor2.Operators.Add(uniformSubScopesProcessor2);
subScopesProcessor2.Successor = mergingReducer;
uniformSubScopesProcessor2.DepthParameter.Value = new IntValue(2);
uniformSubScopesProcessor2.Operator = solutionImprover1;
uniformSubScopesProcessor2.ParallelParameter.Value = new BoolValue(true);
uniformSubScopesProcessor2.Successor = subScopesProcessor4;
solutionImprover1.Name = "SolutionImprover";
solutionImprover1.OperatorParameter.ActualName = ImproverParameter.Name;
solutionImprover1.Successor = solutionEvaluator1;
solutionEvaluator1.Name = "SolutionEvaluator";
solutionEvaluator1.OperatorParameter.ActualName = EvaluatorParameter.Name;
subScopesProcessor4.Operators.Add(dataReducer1);
dataReducer1.Name = "Increment EvaluatedSolutions";
dataReducer1.ParameterToReduce.ActualName = "LocalEvaluatedSolutions";
dataReducer1.TargetParameter.ActualName = EvaluatedSolutionsParameter.Name;
dataReducer1.ReductionOperation.Value = new ReductionOperation(ReductionOperations.Sum);
dataReducer1.TargetOperation.Value = new ReductionOperation(ReductionOperations.Sum);
solutionPoolUpdateMethod.QualityParameter.ActualName = QualityParameter.ActualName;
solutionPoolUpdateMethod.Successor = analyzer;
analyzer.Name = "Analyzer";
analyzer.OperatorParameter.ActualName = AnalyzerParameter.Name;
newSolutionsBranch.Name = "NewSolutionsChecker";
newSolutionsBranch.ConditionParameter.ActualName = "NewSolutions";
newSolutionsBranch.TrueBranch = subScopesProcessor1;
newSolutionsBranch.FalseBranch = populationRebuildMethod;
populationRebuildMethod.QualityParameter.ActualName = QualityParameter.ActualName;
populationRebuildMethod.Successor = subScopesProcessor3;
subScopesProcessor3.DepthParameter.Value = new IntValue(1);
subScopesProcessor3.Operators.Add(solutionsCreator);
subScopesProcessor3.Operators.Add(new EmptyOperator());
subScopesProcessor3.Successor = iterationsCounter;
solutionsCreator.Name = "DiversificationGenerationMethod";
solutionsCreator.NumberOfSolutionsParameter.ActualName = PopulationSizeParameter.Name;
solutionsCreator.Successor = uniformSubScopesProcessor3;
uniformSubScopesProcessor3.DepthParameter.Value = new IntValue(1);
uniformSubScopesProcessor3.Operator = solutionImprover2;
uniformSubScopesProcessor3.ParallelParameter.Value = new BoolValue(true);
uniformSubScopesProcessor3.Successor = dataReducer2;
solutionImprover2.Name = "SolutionImprover";
solutionImprover2.OperatorParameter.ActualName = ImproverParameter.Name;
solutionImprover2.Successor = solutionEvaluator2;
solutionEvaluator2.Name = "SolutionEvaluator";
solutionEvaluator2.OperatorParameter.ActualName = EvaluatorParameter.Name;
dataReducer2.Name = "Increment EvaluatedSolutions";
dataReducer2.ParameterToReduce.ActualName = "LocalEvaluatedSolutions";
dataReducer2.TargetParameter.ActualName = EvaluatedSolutionsParameter.Name;
dataReducer2.ReductionOperation.Value = new ReductionOperation(ReductionOperations.Sum);
dataReducer2.TargetOperation.Value = new ReductionOperation(ReductionOperations.Sum);
iterationsCounter.Name = "IterationCounter";
iterationsCounter.IncrementParameter.Value = new IntValue(1);
iterationsCounter.ValueParameter.ActualName = IterationsParameter.Name;
iterationsCounter.Successor = resultsCollector;
#endregion
}
public NcaAlgorithm()
: base()
{
Parameters.Add(new ValueParameter <IntValue>(SeedParameterName, "The seed of the random number generator.", new IntValue(0)));
Parameters.Add(new ValueParameter <BoolValue>(SetSeedRandomlyParameterName, "A boolean flag that indicates whether the seed should be randomly reset each time the algorithm is run.", new BoolValue(true)));
Parameters.Add(new FixedValueParameter <IntValue>(KParameterName, "The K for the nearest neighbor.", new IntValue(3)));
Parameters.Add(new FixedValueParameter <IntValue>(DimensionsParameterName, "The number of dimensions that NCA should reduce the data to.", new IntValue(2)));
Parameters.Add(new ConstrainedValueParameter <INcaInitializer>(InitializationParameterName, "Which method should be used to initialize the matrix. Typically LDA (linear discriminant analysis) should provide a good estimate."));
Parameters.Add(new FixedValueParameter <IntValue>(NeighborSamplesParameterName, "How many of the neighbors should be sampled in order to speed up the calculation. This should be at least the value of k and at most the number of training instances minus one will be used.", new IntValue(60)));
Parameters.Add(new FixedValueParameter <IntValue>(IterationsParameterName, "How many iterations the conjugate gradient (CG) method should be allowed to perform. The method might still terminate earlier if a local optima has already been reached.", new IntValue(50)));
Parameters.Add(new FixedValueParameter <DoubleValue>(RegularizationParameterName, "A non-negative paramter which can be set to increase generalization and avoid overfitting. If set to 0 the algorithm is similar to NCA as proposed by Goldberger et al.", new DoubleValue(0)));
Parameters.Add(new ValueParameter <INcaModelCreator>(NcaModelCreatorParameterName, "Creates an NCA model out of the matrix.", new NcaModelCreator()));
Parameters.Add(new ValueParameter <INcaSolutionCreator>(NcaSolutionCreatorParameterName, "Creates an NCA solution given a model and some data.", new NcaSolutionCreator()));
Parameters.Add(new ValueParameter <BoolValue>(ApproximateGradientsParameterName, "True if the gradient should be approximated otherwise they are computed exactly.", new BoolValue()));
NcaSolutionCreatorParameter.Hidden = true;
ApproximateGradientsParameter.Hidden = true;
INcaInitializer defaultInitializer = null;
foreach (var initializer in ApplicationManager.Manager.GetInstances <INcaInitializer>().OrderBy(x => x.ItemName))
{
if (initializer is LdaInitializer)
{
defaultInitializer = initializer;
}
InitializationParameter.ValidValues.Add(initializer);
}
if (defaultInitializer != null)
{
InitializationParameter.Value = defaultInitializer;
}
var randomCreator = new RandomCreator();
var ncaInitializer = new Placeholder();
var bfgsInitializer = new LbfgsInitializer();
var makeStep = new LbfgsMakeStep();
var branch = new ConditionalBranch();
var gradientCalculator = new NcaGradientCalculator();
var modelCreator = new Placeholder();
var updateResults = new LbfgsUpdateResults();
var analyzer = new LbfgsAnalyzer();
var finalModelCreator = new Placeholder();
var finalAnalyzer = new LbfgsAnalyzer();
var solutionCreator = new Placeholder();
OperatorGraph.InitialOperator = randomCreator;
randomCreator.SeedParameter.ActualName = SeedParameterName;
randomCreator.SeedParameter.Value = null;
randomCreator.SetSeedRandomlyParameter.ActualName = SetSeedRandomlyParameterName;
randomCreator.SetSeedRandomlyParameter.Value = null;
randomCreator.Successor = ncaInitializer;
ncaInitializer.Name = "(NcaInitializer)";
ncaInitializer.OperatorParameter.ActualName = InitializationParameterName;
ncaInitializer.Successor = bfgsInitializer;
bfgsInitializer.IterationsParameter.ActualName = IterationsParameterName;
bfgsInitializer.PointParameter.ActualName = NcaMatrixParameterName;
bfgsInitializer.ApproximateGradientsParameter.ActualName = ApproximateGradientsParameterName;
bfgsInitializer.Successor = makeStep;
makeStep.StateParameter.ActualName = bfgsInitializer.StateParameter.Name;
makeStep.PointParameter.ActualName = NcaMatrixParameterName;
makeStep.Successor = branch;
branch.ConditionParameter.ActualName = makeStep.TerminationCriterionParameter.Name;
branch.FalseBranch = gradientCalculator;
branch.TrueBranch = finalModelCreator;
gradientCalculator.Successor = modelCreator;
modelCreator.OperatorParameter.ActualName = NcaModelCreatorParameterName;
modelCreator.Successor = updateResults;
updateResults.StateParameter.ActualName = bfgsInitializer.StateParameter.Name;
updateResults.QualityParameter.ActualName = QualityParameterName;
updateResults.QualityGradientsParameter.ActualName = NcaMatrixGradientsParameterName;
updateResults.ApproximateGradientsParameter.ActualName = ApproximateGradientsParameterName;
updateResults.Successor = analyzer;
analyzer.QualityParameter.ActualName = QualityParameterName;
analyzer.PointParameter.ActualName = NcaMatrixParameterName;
analyzer.QualityGradientsParameter.ActualName = NcaMatrixGradientsParameterName;
analyzer.StateParameter.ActualName = bfgsInitializer.StateParameter.Name;
analyzer.PointsTableParameter.ActualName = "Matrix table";
analyzer.QualityGradientsTableParameter.ActualName = "Gradients table";
analyzer.QualitiesTableParameter.ActualName = "Qualities";
analyzer.Successor = makeStep;
finalModelCreator.OperatorParameter.ActualName = NcaModelCreatorParameterName;
finalModelCreator.Successor = finalAnalyzer;
finalAnalyzer.QualityParameter.ActualName = QualityParameterName;
finalAnalyzer.PointParameter.ActualName = NcaMatrixParameterName;
finalAnalyzer.QualityGradientsParameter.ActualName = NcaMatrixGradientsParameterName;
finalAnalyzer.PointsTableParameter.ActualName = analyzer.PointsTableParameter.ActualName;
finalAnalyzer.QualityGradientsTableParameter.ActualName = analyzer.QualityGradientsTableParameter.ActualName;
finalAnalyzer.QualitiesTableParameter.ActualName = analyzer.QualitiesTableParameter.ActualName;
finalAnalyzer.Successor = solutionCreator;
solutionCreator.OperatorParameter.ActualName = NcaSolutionCreatorParameterName;
Problem = new ClassificationProblem();
}
public IslandOffspringSelectionGeneticAlgorithmMainLoop()
: base()
{
#region Create parameters
Parameters.Add(new ValueLookupParameter <IRandom>("Random", "A pseudo random number generator."));
Parameters.Add(new ValueLookupParameter <BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
Parameters.Add(new ScopeTreeLookupParameter <DoubleValue>("Quality", "The value which represents the quality of a solution."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("BestKnownQuality", "The best known quality value found so far."));
Parameters.Add(new ValueLookupParameter <IntValue>("NumberOfIslands", "The number of islands."));
Parameters.Add(new ValueLookupParameter <IntValue>("MigrationInterval", "The number of generations that should pass between migration phases."));
Parameters.Add(new ValueLookupParameter <PercentValue>("MigrationRate", "The proportion of individuals that should migrate between the islands."));
Parameters.Add(new ValueLookupParameter <IOperator>("Migrator", "The migration strategy."));
Parameters.Add(new ValueLookupParameter <IOperator>("EmigrantsSelector", "Selects the individuals that will be migrated."));
Parameters.Add(new ValueLookupParameter <IOperator>("ImmigrationReplacer", "Replaces part of the original population with the immigrants."));
Parameters.Add(new ValueLookupParameter <IntValue>("PopulationSize", "The size of the population of solutions."));
Parameters.Add(new ValueLookupParameter <IntValue>("MaximumGenerations", "The maximum number of generations that should be processed."));
Parameters.Add(new ValueLookupParameter <IOperator>("Selector", "The operator used to select solutions for reproduction."));
Parameters.Add(new ValueLookupParameter <IOperator>("Crossover", "The operator used to cross solutions."));
Parameters.Add(new ValueLookupParameter <PercentValue>("MutationProbability", "The probability that the mutation operator is applied on a solution."));
Parameters.Add(new ValueLookupParameter <IOperator>("Mutator", "The operator used to mutate solutions."));
Parameters.Add(new ValueLookupParameter <IOperator>("Evaluator", "The operator used to evaluate solutions. This operator is executed in parallel, if an engine is used which supports parallelization."));
Parameters.Add(new ValueLookupParameter <IntValue>("Elites", "The numer of elite solutions which are kept in each generation."));
Parameters.Add(new ValueLookupParameter <BoolValue>("ReevaluateElites", "Flag to determine if elite individuals should be reevaluated (i.e., if stochastic fitness functions are used.)"));
Parameters.Add(new ValueLookupParameter <ResultCollection>("Results", "The results collection to store the results."));
Parameters.Add(new ValueLookupParameter <IOperator>("Visualizer", "The operator used to visualize solutions."));
Parameters.Add(new LookupParameter <IItem>("Visualization", "The item which represents the visualization of solutions."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("SuccessRatio", "The ratio of successful to total children that should be achieved."));
Parameters.Add(new LookupParameter <DoubleValue>("ComparisonFactor", "The comparison factor is used to determine whether the offspring should be compared to the better parent, the worse parent or a quality value linearly interpolated between them. It is in the range [0;1]."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("ComparisonFactorStart", "The initial value for the comparison factor."));
Parameters.Add(new ValueLookupParameter <IOperator>("ComparisonFactorModifier", "The operator used to modify the comparison factor."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("MaximumSelectionPressure", "The maximum selection pressure that terminates the algorithm."));
Parameters.Add(new ValueLookupParameter <BoolValue>("OffspringSelectionBeforeMutation", "True if the offspring selection step should be applied before mutation, false if it should be applied after mutation."));
Parameters.Add(new ValueLookupParameter <IOperator>("Analyzer", "The operator used to the analyze the islands."));
Parameters.Add(new ValueLookupParameter <IOperator>("IslandAnalyzer", "The operator used to analyze each island."));
Parameters.Add(new LookupParameter <IntValue>("EvaluatedSolutions", "The number of times solutions have been evaluated."));
Parameters.Add(new ValueLookupParameter <BoolValue>("FillPopulationWithParents", "True if the population should be filled with parent individual or false if worse children should be used when the maximum selection pressure is exceeded."));
#endregion
#region Create operators
VariableCreator variableCreator = new VariableCreator();
UniformSubScopesProcessor uniformSubScopesProcessor0 = new UniformSubScopesProcessor();
VariableCreator islandVariableCreator = new VariableCreator();
Placeholder islandAnalyzer1 = new Placeholder();
ResultsCollector islandResultsCollector1 = new ResultsCollector();
Assigner comparisonFactorInitializer = new Assigner();
Placeholder analyzer1 = new Placeholder();
ResultsCollector resultsCollector1 = new ResultsCollector();
UniformSubScopesProcessor uniformSubScopesProcessor1 = new UniformSubScopesProcessor();
ConditionalBranch islandTerminatedBySelectionPressure1 = new ConditionalBranch();
OffspringSelectionGeneticAlgorithmMainOperator mainOperator = new OffspringSelectionGeneticAlgorithmMainOperator();
Placeholder islandAnalyzer2 = new Placeholder();
ResultsCollector islandResultsCollector2 = new ResultsCollector();
Comparator islandSelectionPressureComparator = new Comparator();
ConditionalBranch islandTerminatedBySelectionPressure2 = new ConditionalBranch();
IntCounter terminatedIslandsCounter = new IntCounter();
IntCounter generationsCounter = new IntCounter();
IntCounter generationsSinceLastMigrationCounter = new IntCounter();
Comparator migrationComparator = new Comparator();
ConditionalBranch migrationBranch = new ConditionalBranch();
Assigner resetTerminatedIslandsAssigner = new Assigner();
Assigner resetGenerationsSinceLastMigrationAssigner = new Assigner();
IntCounter migrationsCounter = new IntCounter();
UniformSubScopesProcessor uniformSubScopesProcessor2 = new UniformSubScopesProcessor();
Assigner reviveIslandAssigner = new Assigner();
Placeholder emigrantsSelector = new Placeholder();
Placeholder migrator = new Placeholder();
UniformSubScopesProcessor uniformSubScopesProcessor3 = new UniformSubScopesProcessor();
Placeholder immigrationReplacer = new Placeholder();
Comparator generationsComparator = new Comparator();
Comparator terminatedIslandsComparator = new Comparator();
Comparator maxEvaluatedSolutionsComparator = new Comparator();
Placeholder comparisonFactorModifier = new Placeholder();
Placeholder analyzer2 = new Placeholder();
ConditionalBranch generationsTerminationCondition = new ConditionalBranch();
ConditionalBranch terminatedIslandsCondition = new ConditionalBranch();
ConditionalBranch evaluatedSolutionsTerminationCondition = new ConditionalBranch();
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>("Migrations", new IntValue(0)));
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>("Generations", new IntValue(0))); // Class IslandOffspringSelectionGeneticAlgorithm expects this to be called Generations
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>("GenerationsSinceLastMigration", new IntValue(0)));
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>("TerminatedIslands", new IntValue(0)));
islandVariableCreator.CollectedValues.Add(new ValueParameter <ResultCollection>(ResultsParameter.Name, new ResultCollection()));
islandVariableCreator.CollectedValues.Add(new ValueParameter <BoolValue>("TerminateSelectionPressure", new BoolValue(false)));
islandVariableCreator.CollectedValues.Add(new ValueParameter <DoubleValue>("SelectionPressure", new DoubleValue(0)));
islandAnalyzer1.Name = "Island Analyzer (placeholder)";
islandAnalyzer1.OperatorParameter.ActualName = IslandAnalyzerParameter.Name;
islandResultsCollector1.CollectedValues.Add(new LookupParameter <DoubleValue>("Current Selection Pressure", "Displays the rising selection pressure during a generation.", "SelectionPressure"));
islandResultsCollector1.CollectedValues.Add(new LookupParameter <DoubleValue>("Current Success Ratio", "Indicates how many successful children were already found during a generation (relative to the population size).", "CurrentSuccessRatio"));
islandResultsCollector1.ResultsParameter.ActualName = ResultsParameter.Name;
comparisonFactorInitializer.Name = "Initialize Comparison Factor";
comparisonFactorInitializer.LeftSideParameter.ActualName = ComparisonFactorParameter.Name;
comparisonFactorInitializer.RightSideParameter.ActualName = ComparisonFactorStartParameter.Name;
analyzer1.Name = "Analyzer (placeholder)";
analyzer1.OperatorParameter.ActualName = AnalyzerParameter.Name;
resultsCollector1.CopyValue = new BoolValue(false);
resultsCollector1.CollectedValues.Add(new LookupParameter <IntValue>("Migrations"));
resultsCollector1.CollectedValues.Add(new LookupParameter <IntValue>("Generations"));
resultsCollector1.CollectedValues.Add(new LookupParameter <DoubleValue>("Current Comparison Factor", null, ComparisonFactorParameter.Name));
resultsCollector1.CollectedValues.Add(new ScopeTreeLookupParameter <ResultCollection>("IslandResults", "Result set for each island", ResultsParameter.Name));
resultsCollector1.ResultsParameter.ActualName = ResultsParameter.Name;
islandTerminatedBySelectionPressure1.Name = "Island Terminated ?";
islandTerminatedBySelectionPressure1.ConditionParameter.ActualName = "TerminateSelectionPressure";
mainOperator.ComparisonFactorParameter.ActualName = ComparisonFactorParameter.Name;
mainOperator.CrossoverParameter.ActualName = CrossoverParameter.Name;
mainOperator.CurrentSuccessRatioParameter.ActualName = "CurrentSuccessRatio";
mainOperator.ElitesParameter.ActualName = ElitesParameter.Name;
mainOperator.ReevaluateElitesParameter.ActualName = ReevaluateElitesParameter.Name;
mainOperator.EvaluatedSolutionsParameter.ActualName = EvaluatedSolutionsParameter.Name;
mainOperator.EvaluatorParameter.ActualName = EvaluatorParameter.Name;
mainOperator.MaximizationParameter.ActualName = MaximizationParameter.Name;
mainOperator.MaximumSelectionPressureParameter.ActualName = MaximumSelectionPressureParameter.Name;
mainOperator.MutationProbabilityParameter.ActualName = MutationProbabilityParameter.Name;
mainOperator.MutatorParameter.ActualName = MutatorParameter.Name;
mainOperator.OffspringSelectionBeforeMutationParameter.ActualName = OffspringSelectionBeforeMutationParameter.Name;
mainOperator.QualityParameter.ActualName = QualityParameter.Name;
mainOperator.RandomParameter.ActualName = RandomParameter.Name;
mainOperator.SelectionPressureParameter.ActualName = "SelectionPressure";
mainOperator.SelectorParameter.ActualName = SelectorParameter.Name;
mainOperator.SuccessRatioParameter.ActualName = SuccessRatioParameter.Name;
mainOperator.FillPopulationWithParentsParameter.ActualName = FillPopulationWithParentsParameter.Name;
islandAnalyzer2.Name = "Island Analyzer (placeholder)";
islandAnalyzer2.OperatorParameter.ActualName = IslandAnalyzerParameter.Name;
islandResultsCollector2.CollectedValues.Add(new LookupParameter <DoubleValue>("Current Selection Pressure", "Displays the rising selection pressure during a generation.", "SelectionPressure"));
islandResultsCollector2.CollectedValues.Add(new LookupParameter <DoubleValue>("Current Success Ratio", "Indicates how many successful children were already found during a generation (relative to the population size).", "CurrentSuccessRatio"));
islandResultsCollector2.ResultsParameter.ActualName = "Results";
islandSelectionPressureComparator.Name = "SelectionPressure >= MaximumSelectionPressure ?";
islandSelectionPressureComparator.LeftSideParameter.ActualName = "SelectionPressure";
islandSelectionPressureComparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
islandSelectionPressureComparator.RightSideParameter.ActualName = MaximumSelectionPressureParameter.Name;
islandSelectionPressureComparator.ResultParameter.ActualName = "TerminateSelectionPressure";
islandTerminatedBySelectionPressure2.Name = "Island Terminated ?";
islandTerminatedBySelectionPressure2.ConditionParameter.ActualName = "TerminateSelectionPressure";
terminatedIslandsCounter.Name = "TerminatedIslands + 1";
terminatedIslandsCounter.ValueParameter.ActualName = "TerminatedIslands";
terminatedIslandsCounter.Increment = new IntValue(1);
generationsCounter.Name = "Generations + 1";
generationsCounter.ValueParameter.ActualName = "Generations";
generationsCounter.Increment = new IntValue(1);
generationsSinceLastMigrationCounter.Name = "GenerationsSinceLastMigration + 1";
generationsSinceLastMigrationCounter.ValueParameter.ActualName = "GenerationsSinceLastMigration";
generationsSinceLastMigrationCounter.Increment = new IntValue(1);
migrationComparator.Name = "GenerationsSinceLastMigration = MigrationInterval ?";
migrationComparator.LeftSideParameter.ActualName = "GenerationsSinceLastMigration";
migrationComparator.Comparison = new Comparison(ComparisonType.Equal);
migrationComparator.RightSideParameter.ActualName = MigrationIntervalParameter.Name;
migrationComparator.ResultParameter.ActualName = "Migrate";
migrationBranch.Name = "Migrate?";
migrationBranch.ConditionParameter.ActualName = "Migrate";
resetTerminatedIslandsAssigner.Name = "Reset TerminatedIslands";
resetTerminatedIslandsAssigner.LeftSideParameter.ActualName = "TerminatedIslands";
resetTerminatedIslandsAssigner.RightSideParameter.Value = new IntValue(0);
resetGenerationsSinceLastMigrationAssigner.Name = "Reset GenerationsSinceLastMigration";
resetGenerationsSinceLastMigrationAssigner.LeftSideParameter.ActualName = "GenerationsSinceLastMigration";
resetGenerationsSinceLastMigrationAssigner.RightSideParameter.Value = new IntValue(0);
migrationsCounter.Name = "Migrations + 1";
migrationsCounter.IncrementParameter.Value = new IntValue(1);
migrationsCounter.ValueParameter.ActualName = "Migrations";
reviveIslandAssigner.Name = "Revive Island";
reviveIslandAssigner.LeftSideParameter.ActualName = "TerminateSelectionPressure";
reviveIslandAssigner.RightSideParameter.Value = new BoolValue(false);
emigrantsSelector.Name = "Emigrants Selector (placeholder)";
emigrantsSelector.OperatorParameter.ActualName = EmigrantsSelectorParameter.Name;
migrator.Name = "Migrator (placeholder)";
migrator.OperatorParameter.ActualName = MigratorParameter.Name;
immigrationReplacer.Name = "Immigration Replacer (placeholder)";
immigrationReplacer.OperatorParameter.ActualName = ImmigrationReplacerParameter.Name;
generationsComparator.Name = "Generations >= MaximumGenerations ?";
generationsComparator.LeftSideParameter.ActualName = "Generations";
generationsComparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
generationsComparator.RightSideParameter.ActualName = MaximumGenerationsParameter.Name;
generationsComparator.ResultParameter.ActualName = "TerminateGenerations";
terminatedIslandsComparator.Name = "All Islands terminated ?";
terminatedIslandsComparator.LeftSideParameter.ActualName = "TerminatedIslands";
terminatedIslandsComparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
terminatedIslandsComparator.RightSideParameter.ActualName = NumberOfIslandsParameter.Name;
terminatedIslandsComparator.ResultParameter.ActualName = "TerminateTerminatedIslands";
maxEvaluatedSolutionsComparator.Name = "EvaluatedSolutions >= MaximumEvaluatedSolutions ?";
maxEvaluatedSolutionsComparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
maxEvaluatedSolutionsComparator.LeftSideParameter.ActualName = EvaluatedSolutionsParameter.Name;
maxEvaluatedSolutionsComparator.ResultParameter.ActualName = "TerminateEvaluatedSolutions";
maxEvaluatedSolutionsComparator.RightSideParameter.ActualName = "MaximumEvaluatedSolutions";
comparisonFactorModifier.Name = "Update Comparison Factor (Placeholder)";
comparisonFactorModifier.OperatorParameter.ActualName = ComparisonFactorModifierParameter.Name;
analyzer2.Name = "Analyzer (placeholder)";
analyzer2.OperatorParameter.ActualName = AnalyzerParameter.Name;
generationsTerminationCondition.Name = "Terminate (MaxGenerations) ?";
generationsTerminationCondition.ConditionParameter.ActualName = "TerminateGenerations";
terminatedIslandsCondition.Name = "Terminate (TerminatedIslands) ?";
terminatedIslandsCondition.ConditionParameter.ActualName = "TerminateTerminatedIslands";
evaluatedSolutionsTerminationCondition.Name = "Terminate (EvaluatedSolutions) ?";
evaluatedSolutionsTerminationCondition.ConditionParameter.ActualName = "TerminateEvaluatedSolutions";
#endregion
#region Create operator graph
OperatorGraph.InitialOperator = variableCreator;
variableCreator.Successor = uniformSubScopesProcessor0;
uniformSubScopesProcessor0.Operator = islandVariableCreator;
uniformSubScopesProcessor0.Successor = comparisonFactorInitializer;
islandVariableCreator.Successor = islandAnalyzer1;
islandAnalyzer1.Successor = islandResultsCollector1;
islandResultsCollector1.Successor = null;
comparisonFactorInitializer.Successor = analyzer1;
analyzer1.Successor = resultsCollector1;
resultsCollector1.Successor = uniformSubScopesProcessor1;
uniformSubScopesProcessor1.Operator = islandTerminatedBySelectionPressure1;
uniformSubScopesProcessor1.Successor = generationsCounter;
islandTerminatedBySelectionPressure1.TrueBranch = null;
islandTerminatedBySelectionPressure1.FalseBranch = mainOperator;
islandTerminatedBySelectionPressure1.Successor = null;
mainOperator.Successor = islandAnalyzer2;
islandAnalyzer2.Successor = islandResultsCollector2;
islandResultsCollector2.Successor = islandSelectionPressureComparator;
islandSelectionPressureComparator.Successor = islandTerminatedBySelectionPressure2;
islandTerminatedBySelectionPressure2.TrueBranch = terminatedIslandsCounter;
islandTerminatedBySelectionPressure2.FalseBranch = null;
islandTerminatedBySelectionPressure2.Successor = null;
generationsCounter.Successor = generationsSinceLastMigrationCounter;
generationsSinceLastMigrationCounter.Successor = migrationComparator;
migrationComparator.Successor = migrationBranch;
migrationBranch.TrueBranch = resetTerminatedIslandsAssigner;
migrationBranch.FalseBranch = null;
migrationBranch.Successor = generationsComparator;
resetTerminatedIslandsAssigner.Successor = resetGenerationsSinceLastMigrationAssigner;
resetGenerationsSinceLastMigrationAssigner.Successor = migrationsCounter;
migrationsCounter.Successor = uniformSubScopesProcessor2;
uniformSubScopesProcessor2.Operator = reviveIslandAssigner;
uniformSubScopesProcessor2.Successor = migrator;
reviveIslandAssigner.Successor = emigrantsSelector;
emigrantsSelector.Successor = null;
migrator.Successor = uniformSubScopesProcessor3;
uniformSubScopesProcessor3.Operator = immigrationReplacer;
uniformSubScopesProcessor3.Successor = null;
immigrationReplacer.Successor = null;
generationsComparator.Successor = terminatedIslandsComparator;
terminatedIslandsComparator.Successor = maxEvaluatedSolutionsComparator;
maxEvaluatedSolutionsComparator.Successor = comparisonFactorModifier;
comparisonFactorModifier.Successor = analyzer2;
analyzer2.Successor = generationsTerminationCondition;
generationsTerminationCondition.TrueBranch = null;
generationsTerminationCondition.FalseBranch = terminatedIslandsCondition;
generationsTerminationCondition.Successor = null;
terminatedIslandsCondition.TrueBranch = null;
terminatedIslandsCondition.FalseBranch = evaluatedSolutionsTerminationCondition;
terminatedIslandsCondition.Successor = null;
evaluatedSolutionsTerminationCondition.TrueBranch = null;
evaluatedSolutionsTerminationCondition.FalseBranch = uniformSubScopesProcessor1;
evaluatedSolutionsTerminationCondition.Successor = null;
#endregion
}
private void Initialize()
{
#region Create parameters
Parameters.Add(new ValueLookupParameter <IRandom>("Random", "A pseudo random number generator."));
Parameters.Add(new ValueLookupParameter <BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
Parameters.Add(new ScopeTreeLookupParameter <DoubleValue>("Quality", "The value which represents the quality of a solution."));
Parameters.Add(new ValueLookupParameter <IOperator>("Selector", "The operator used to select solutions for reproduction."));
Parameters.Add(new ValueLookupParameter <IOperator>("Crossover", "The operator used to cross solutions."));
Parameters.Add(new ValueLookupParameter <PercentValue>("MutationProbability", "The probability that the mutation operator is applied on a solution."));
Parameters.Add(new ValueLookupParameter <IOperator>("Mutator", "The operator used to mutate solutions."));
Parameters.Add(new ValueLookupParameter <IOperator>("Evaluator", "The operator used to evaluate solutions. This operator is executed in parallel, if an engine is used which supports parallelization."));
Parameters.Add(new ValueLookupParameter <IntValue>("Elites", "The numer of elite solutions which are kept in each generation."));
Parameters.Add(new ValueLookupParameter <BoolValue>("ReevaluateElites", "Flag to determine if elite individuals should be reevaluated (i.e., if stochastic fitness functions are used.)"));
Parameters.Add(new ValueLookupParameter <IntValue>("MaximumGenerations", "The maximum number of generations which should be processed."));
Parameters.Add(new ValueLookupParameter <VariableCollection>("Results", "The variable collection where results should be stored."));
Parameters.Add(new ValueLookupParameter <IOperator>("Analyzer", "The operator used to analyze each generation."));
Parameters.Add(new ValueLookupParameter <IntValue>("EvaluatedSolutions", "The number of times solutions have been evaluated."));
Parameters.Add(new ValueLookupParameter <IntValue>("PopulationSize", "The size of the population."));
Parameters.Add(new ValueLookupParameter <IntValue>("MinimumPopulationSize", "The minimum size of the population of solutions."));
Parameters.Add(new ValueLookupParameter <IntValue>("MaximumPopulationSize", "The maximum size of the population of solutions."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("ComparisonFactor", "The comparison factor."));
Parameters.Add(new ValueLookupParameter <IntValue>("Effort", "The maximum number of offspring created in each generation."));
Parameters.Add(new ValueLookupParameter <IntValue>("BatchSize", "The number of children that should be created during one iteration of the offspring creation process."));
Parameters.Add(new ValueLookupParameter <ISolutionSimilarityCalculator>("SimilarityCalculator", "The operator used to calculate the similarity between two solutions."));
Parameters.Add(new ScopeParameter("CurrentScope", "The current scope which represents a population of solutions on which the genetic algorithm should be applied."));
#endregion
#region Create operators
VariableCreator variableCreator = new VariableCreator();
Assigner assigner1 = new Assigner();
ResultsCollector resultsCollector = new ResultsCollector();
Placeholder analyzer1 = new Placeholder();
Placeholder selector = new Placeholder();
SubScopesProcessor subScopesProcessor1 = new SubScopesProcessor();
ChildrenCreator childrenCreator = new ChildrenCreator();
UniformSubScopesProcessor uniformSubScopesProcessor = new UniformSubScopesProcessor();
Placeholder crossover = new Placeholder();
StochasticBranch stochasticBranch = new StochasticBranch();
Placeholder mutator = new Placeholder();
Placeholder evaluator = new Placeholder();
WeightedParentsQualityComparator weightedParentsQualityComparator = new WeightedParentsQualityComparator();
SubScopesRemover subScopesRemover = new SubScopesRemover();
IntCounter intCounter1 = new IntCounter();
IntCounter intCounter2 = new IntCounter();
ConditionalSelector conditionalSelector = new ConditionalSelector();
RightReducer rightReducer1 = new RightReducer();
DuplicatesSelector duplicateSelector = new DuplicatesSelector();
LeftReducer leftReducer1 = new LeftReducer();
ProgressiveOffspringPreserver progressiveOffspringSelector = new ProgressiveOffspringPreserver();
SubScopesCounter subScopesCounter2 = new SubScopesCounter();
ExpressionCalculator calculator1 = new ExpressionCalculator();
ConditionalBranch conditionalBranch1 = new ConditionalBranch();
Comparator comparator1 = new Comparator();
ConditionalBranch conditionalBranch2 = new ConditionalBranch();
LeftReducer leftReducer2 = new LeftReducer();
SubScopesProcessor subScopesProcessor2 = new SubScopesProcessor();
BestSelector bestSelector = new BestSelector();
RightReducer rightReducer2 = new RightReducer();
ScopeCleaner scopeCleaner = new ScopeCleaner();
ScopeRestorer scopeRestorer = new ScopeRestorer();
MergingReducer mergingReducer = new MergingReducer();
IntCounter intCounter3 = new IntCounter();
SubScopesCounter subScopesCounter3 = new SubScopesCounter();
ExpressionCalculator calculator2 = new ExpressionCalculator();
Comparator comparator2 = new Comparator();
ConditionalBranch conditionalBranch3 = new ConditionalBranch();
Placeholder analyzer2 = new Placeholder();
Comparator comparator3 = new Comparator();
ConditionalBranch conditionalBranch4 = new ConditionalBranch();
Comparator comparator4 = new Comparator();
ConditionalBranch conditionalBranch5 = new ConditionalBranch();
Assigner assigner3 = new Assigner();
Assigner assigner4 = new Assigner();
Assigner assigner5 = new Assigner();
ConditionalBranch reevaluateElitesBranch = new ConditionalBranch();
UniformSubScopesProcessor uniformSubScopesProcessor2 = new UniformSubScopesProcessor();
Placeholder evaluator2 = new Placeholder();
SubScopesCounter subScopesCounter4 = new SubScopesCounter();
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>("Generations", new IntValue(0))); // Class RAPGA expects this to be called Generations
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>("CurrentPopulationSize", new IntValue(0)));
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>("NumberOfCreatedOffspring", new IntValue(0)));
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>("NumberOfSuccessfulOffspring", new IntValue(0)));
variableCreator.CollectedValues.Add(new ValueParameter <ScopeList>("OffspringList", new ScopeList()));
assigner1.Name = "Initialize CurrentPopulationSize";
assigner1.LeftSideParameter.ActualName = "CurrentPopulationSize";
assigner1.RightSideParameter.ActualName = PopulationSizeParameter.Name;
resultsCollector.CollectedValues.Add(new LookupParameter <IntValue>("Generations"));
resultsCollector.CollectedValues.Add(new LookupParameter <IntValue>("CurrentPopulationSize"));
resultsCollector.ResultsParameter.ActualName = "Results";
analyzer1.Name = "Analyzer";
analyzer1.OperatorParameter.ActualName = "Analyzer";
selector.Name = "Selector";
selector.OperatorParameter.ActualName = "Selector";
childrenCreator.ParentsPerChild = new IntValue(2);
uniformSubScopesProcessor.Parallel.Value = true;
crossover.Name = "Crossover";
crossover.OperatorParameter.ActualName = "Crossover";
stochasticBranch.ProbabilityParameter.ActualName = "MutationProbability";
stochasticBranch.RandomParameter.ActualName = "Random";
mutator.Name = "Mutator";
mutator.OperatorParameter.ActualName = "Mutator";
evaluator.Name = "Evaluator";
evaluator.OperatorParameter.ActualName = "Evaluator";
weightedParentsQualityComparator.ComparisonFactorParameter.ActualName = ComparisonFactorParameter.Name;
weightedParentsQualityComparator.LeftSideParameter.ActualName = QualityParameter.Name;
weightedParentsQualityComparator.MaximizationParameter.ActualName = MaximizationParameter.Name;
weightedParentsQualityComparator.RightSideParameter.ActualName = QualityParameter.Name;
weightedParentsQualityComparator.ResultParameter.ActualName = "SuccessfulOffspring";
subScopesRemover.RemoveAllSubScopes = true;
intCounter1.Name = "Increment NumberOfCreatedOffspring";
intCounter1.ValueParameter.ActualName = "NumberOfCreatedOffspring";
intCounter1.Increment = null;
intCounter1.IncrementParameter.ActualName = BatchSizeParameter.Name;
intCounter2.Name = "Increment EvaluatedSolutions";
intCounter2.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
intCounter2.Increment = null;
intCounter2.IncrementParameter.ActualName = BatchSizeParameter.Name;
conditionalSelector.ConditionParameter.ActualName = "SuccessfulOffspring";
conditionalSelector.ConditionParameter.Depth = 1;
conditionalSelector.CopySelected.Value = false;
duplicateSelector.CopySelected.Value = false;
progressiveOffspringSelector.OffspringListParameter.ActualName = "OffspringList";
progressiveOffspringSelector.ElitesParameter.ActualName = ElitesParameter.Name;
progressiveOffspringSelector.MaximumPopulationSizeParameter.ActualName = MaximumPopulationSizeParameter.Name;
subScopesCounter2.Name = "Count Successful Offspring";
subScopesCounter2.ValueParameter.ActualName = "NumberOfSuccessfulOffspring";
calculator1.Name = "NumberOfSuccessfulOffspring == MaximumPopulationSize - Elites";
calculator1.CollectedValues.Add(new ValueLookupParameter <IntValue>("NumberOfSuccessfulOffspring"));
calculator1.CollectedValues.Add(new ValueLookupParameter <IntValue>("MaximumPopulationSize"));
calculator1.CollectedValues.Add(new ValueLookupParameter <IntValue>("Elites"));
calculator1.ExpressionParameter.Value = new StringValue("NumberOfSuccessfulOffspring MaximumPopulationSize Elites - ==");
calculator1.ExpressionResultParameter.ActualName = "Break";
conditionalBranch1.Name = "Break?";
conditionalBranch1.ConditionParameter.ActualName = "Break";
comparator1.Name = "NumberOfCreatedOffspring >= Effort";
comparator1.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
comparator1.LeftSideParameter.ActualName = "NumberOfCreatedOffspring";
comparator1.RightSideParameter.ActualName = EffortParameter.Name;
comparator1.ResultParameter.ActualName = "Break";
conditionalBranch2.Name = "Break?";
conditionalBranch2.ConditionParameter.ActualName = "Break";
bestSelector.CopySelected = new BoolValue(false);
bestSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
bestSelector.NumberOfSelectedSubScopesParameter.ActualName = "Elites";
bestSelector.QualityParameter.ActualName = QualityParameter.Name;
intCounter3.Name = "Increment Generations";
intCounter3.Increment = new IntValue(1);
intCounter3.ValueParameter.ActualName = "Generations";
subScopesCounter3.Name = "Update CurrentPopulationSize";
subScopesCounter3.ValueParameter.ActualName = "CurrentPopulationSize";
subScopesCounter3.AccumulateParameter.Value = new BoolValue(false);
calculator2.Name = "Evaluate ActualSelectionPressure";
calculator2.CollectedValues.Add(new ValueLookupParameter <IntValue>("NumberOfCreatedOffspring"));
calculator2.CollectedValues.Add(new ValueLookupParameter <IntValue>("Elites"));
calculator2.CollectedValues.Add(new ValueLookupParameter <IntValue>("CurrentPopulationSize"));
calculator2.ExpressionParameter.Value = new StringValue("NumberOfCreatedOffspring Elites + CurrentPopulationSize /");
calculator2.ExpressionResultParameter.ActualName = "ActualSelectionPressure";
comparator2.Name = "CurrentPopulationSize < 1";
comparator2.Comparison = new Comparison(ComparisonType.Less);
comparator2.LeftSideParameter.ActualName = "CurrentPopulationSize";
comparator2.RightSideParameter.Value = new IntValue(1);
comparator2.ResultParameter.ActualName = "Terminate";
conditionalBranch3.Name = "Terminate?";
conditionalBranch3.ConditionParameter.ActualName = "Terminate";
analyzer2.Name = "Analyzer";
analyzer2.OperatorParameter.ActualName = "Analyzer";
comparator3.Name = "Generations >= MaximumGenerations";
comparator3.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
comparator3.LeftSideParameter.ActualName = "Generations";
comparator3.ResultParameter.ActualName = "Terminate";
comparator3.RightSideParameter.ActualName = MaximumGenerationsParameter.Name;
conditionalBranch4.Name = "Terminate?";
conditionalBranch4.ConditionParameter.ActualName = "Terminate";
comparator4.Name = "CurrentPopulationSize < MinimumPopulationSize";
comparator4.Comparison = new Comparison(ComparisonType.Less);
comparator4.LeftSideParameter.ActualName = "CurrentPopulationSize";
comparator4.RightSideParameter.ActualName = MinimumPopulationSizeParameter.Name;
comparator4.ResultParameter.ActualName = "Terminate";
conditionalBranch5.Name = "Terminate?";
conditionalBranch5.ConditionParameter.ActualName = "Terminate";
assigner3.Name = "Reset NumberOfCreatedOffspring";
assigner3.LeftSideParameter.ActualName = "NumberOfCreatedOffspring";
assigner3.RightSideParameter.Value = new IntValue(0);
assigner4.Name = "Reset NumberOfSuccessfulOffspring";
assigner4.LeftSideParameter.ActualName = "NumberOfSuccessfulOffspring";
assigner4.RightSideParameter.Value = new IntValue(0);
assigner5.Name = "Reset OffspringList";
assigner5.LeftSideParameter.ActualName = "OffspringList";
assigner5.RightSideParameter.Value = new ScopeList();
reevaluateElitesBranch.ConditionParameter.ActualName = "ReevaluateElites";
reevaluateElitesBranch.Name = "Reevaluate elites ?";
uniformSubScopesProcessor2.Parallel.Value = true;
evaluator2.Name = "Evaluator (placeholder)";
evaluator2.OperatorParameter.ActualName = EvaluatorParameter.Name;
subScopesCounter4.Name = "Increment EvaluatedSolutions";
subScopesCounter4.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
#endregion
#region Create operator graph
OperatorGraph.InitialOperator = variableCreator;
variableCreator.Successor = assigner1;
assigner1.Successor = resultsCollector;
resultsCollector.Successor = analyzer1;
analyzer1.Successor = selector;
selector.Successor = subScopesProcessor1;
subScopesProcessor1.Operators.Add(new EmptyOperator());
subScopesProcessor1.Operators.Add(childrenCreator);
subScopesProcessor1.Successor = calculator1;
childrenCreator.Successor = uniformSubScopesProcessor;
uniformSubScopesProcessor.Operator = crossover;
uniformSubScopesProcessor.Successor = intCounter1;
crossover.Successor = stochasticBranch;
stochasticBranch.FirstBranch = mutator;
stochasticBranch.SecondBranch = null;
mutator.Successor = null;
stochasticBranch.Successor = evaluator;
evaluator.Successor = weightedParentsQualityComparator;
weightedParentsQualityComparator.Successor = subScopesRemover;
intCounter1.Successor = intCounter2;
intCounter2.Successor = conditionalSelector;
conditionalSelector.Successor = rightReducer1;
rightReducer1.Successor = duplicateSelector;
duplicateSelector.Successor = leftReducer1;
leftReducer1.Successor = progressiveOffspringSelector;
progressiveOffspringSelector.Successor = subScopesCounter2;
calculator1.Successor = conditionalBranch1;
conditionalBranch1.FalseBranch = comparator1;
conditionalBranch1.TrueBranch = subScopesProcessor2;
comparator1.Successor = conditionalBranch2;
conditionalBranch2.FalseBranch = leftReducer2;
conditionalBranch2.TrueBranch = subScopesProcessor2;
leftReducer2.Successor = selector;
subScopesProcessor2.Operators.Add(bestSelector);
subScopesProcessor2.Operators.Add(scopeCleaner);
subScopesProcessor2.Successor = mergingReducer;
bestSelector.Successor = rightReducer2;
rightReducer2.Successor = reevaluateElitesBranch;
reevaluateElitesBranch.TrueBranch = uniformSubScopesProcessor2;
uniformSubScopesProcessor2.Operator = evaluator2;
uniformSubScopesProcessor2.Successor = subScopesCounter4;
evaluator2.Successor = null;
subScopesCounter4.Successor = null;
reevaluateElitesBranch.FalseBranch = null;
reevaluateElitesBranch.Successor = null;
scopeCleaner.Successor = scopeRestorer;
mergingReducer.Successor = intCounter3;
intCounter3.Successor = subScopesCounter3;
subScopesCounter3.Successor = calculator2;
calculator2.Successor = comparator2;
comparator2.Successor = conditionalBranch3;
conditionalBranch3.FalseBranch = analyzer2;
conditionalBranch3.TrueBranch = null;
analyzer2.Successor = comparator3;
comparator3.Successor = conditionalBranch4;
conditionalBranch4.FalseBranch = comparator4;
conditionalBranch4.TrueBranch = null;
conditionalBranch4.Successor = null;
comparator4.Successor = conditionalBranch5;
conditionalBranch5.FalseBranch = assigner3;
conditionalBranch5.TrueBranch = null;
conditionalBranch5.Successor = null;
assigner3.Successor = assigner4;
assigner4.Successor = assigner5;
assigner5.Successor = selector;
#endregion
}
private void Initialize()
{
#region Create parameters
Parameters.Add(new ValueLookupParameter <IRandom>("Random", "A pseudo random number generator."));
Parameters.Add(new ValueLookupParameter <BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
Parameters.Add(new LookupParameter <DoubleValue>("Quality", "The value which represents the quality of a solution."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("BestKnownQuality", "The best known quality value found so far."));
Parameters.Add(new LookupParameter <DoubleValue>("MoveQuality", "The value which represents the quality of a move."));
Parameters.Add(new LookupParameter <BoolValue>("MoveTabu", "The value that indicates if a move is tabu or not."));
Parameters.Add(new ValueLookupParameter <IntValue>("MaximumIterations", "The maximum number of generations which should be processed."));
Parameters.Add(new ValueLookupParameter <IntValue>("TabuTenure", "The length of the tabu list, and also means the number of iterations a move is kept tabu"));
Parameters.Add(new ValueLookupParameter <IOperator>("MoveGenerator", "The operator that generates the moves."));
Parameters.Add(new ValueLookupParameter <IOperator>("MoveMaker", "The operator that performs a move and updates the quality."));
Parameters.Add(new ValueLookupParameter <IOperator>("MoveEvaluator", "The operator that evaluates a move."));
Parameters.Add(new ValueLookupParameter <IOperator>("TabuChecker", "The operator that checks whether a move is tabu."));
Parameters.Add(new ValueLookupParameter <IOperator>("TabuMaker", "The operator that declares a move tabu."));
Parameters.Add(new ValueLookupParameter <IOperator>("Analyzer", "The operator used to analyze the solution and moves."));
Parameters.Add(new ValueLookupParameter <VariableCollection>("Results", "The variable collection where results should be stored."));
Parameters.Add(new LookupParameter <IntValue>("EvaluatedMoves", "The number of evaluated moves."));
#endregion
#region Create operators
VariableCreator variableCreator = new VariableCreator();
SubScopesProcessor subScopesProcessor0 = new SubScopesProcessor();
Assigner bestQualityInitializer = new Assigner();
Placeholder analyzer1 = new Placeholder();
ResultsCollector resultsCollector1 = new ResultsCollector();
SubScopesProcessor solutionProcessor = new SubScopesProcessor();
Placeholder moveGenerator = new Placeholder();
UniformSubScopesProcessor moveEvaluationProcessor = new UniformSubScopesProcessor();
Placeholder moveEvaluator = new Placeholder();
Placeholder tabuChecker = new Placeholder();
SubScopesCounter subScopesCounter = new SubScopesCounter();
SubScopesSorter moveQualitySorter = new SubScopesSorter();
TabuSelector tabuSelector = new TabuSelector();
ConditionalBranch emptyNeighborhoodBranch1 = new ConditionalBranch();
SubScopesProcessor moveMakingProcessor = new SubScopesProcessor();
UniformSubScopesProcessor selectedMoveMakingProcesor = new UniformSubScopesProcessor();
Placeholder tabuMaker = new Placeholder();
Placeholder moveMaker = new Placeholder();
MergingReducer mergingReducer = new MergingReducer();
Placeholder analyzer2 = new Placeholder();
SubScopesRemover subScopesRemover = new SubScopesRemover();
ConditionalBranch emptyNeighborhoodBranch2 = new ConditionalBranch();
BestQualityMemorizer bestQualityUpdater = new BestQualityMemorizer();
IntCounter iterationsCounter = new IntCounter();
Comparator iterationsComparator = new Comparator();
ConditionalBranch iterationsTermination = new ConditionalBranch();
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>("Iterations", new IntValue(0))); // Class TabuSearch expects this to be called Iterations
variableCreator.CollectedValues.Add(new ValueParameter <BoolValue>("EmptyNeighborhood", new BoolValue(false)));
variableCreator.CollectedValues.Add(new ValueParameter <ItemList <IItem> >("TabuList", new ItemList <IItem>()));
variableCreator.CollectedValues.Add(new ValueParameter <VariableCollection>("Memories", new VariableCollection()));
variableCreator.CollectedValues.Add(new ValueParameter <DoubleValue>("BestQuality", new DoubleValue(0)));
bestQualityInitializer.Name = "Initialize BestQuality";
bestQualityInitializer.LeftSideParameter.ActualName = "BestQuality";
bestQualityInitializer.RightSideParameter.ActualName = QualityParameter.Name;
analyzer1.Name = "Analyzer (placeholder)";
analyzer1.OperatorParameter.ActualName = AnalyzerParameter.Name;
resultsCollector1.CopyValue = new BoolValue(false);
resultsCollector1.CollectedValues.Add(new LookupParameter <IntValue>("Iterations"));
resultsCollector1.CollectedValues.Add(new LookupParameter <DoubleValue>("Best Quality", null, "BestQuality"));
resultsCollector1.ResultsParameter.ActualName = ResultsParameter.Name;
moveGenerator.Name = "MoveGenerator (placeholder)";
moveGenerator.OperatorParameter.ActualName = MoveGeneratorParameter.Name;
moveEvaluationProcessor.Parallel = new BoolValue(true);
moveEvaluator.Name = "MoveEvaluator (placeholder)";
moveEvaluator.OperatorParameter.ActualName = MoveEvaluatorParameter.Name;
tabuChecker.Name = "TabuChecker (placeholder)";
tabuChecker.OperatorParameter.ActualName = TabuCheckerParameter.Name;
subScopesCounter.Name = "Increment EvaluatedMoves";
subScopesCounter.ValueParameter.ActualName = EvaluatedMovesParameter.Name;
moveQualitySorter.DescendingParameter.ActualName = MaximizationParameter.Name;
moveQualitySorter.ValueParameter.ActualName = MoveQualityParameter.Name;
tabuSelector.AspirationParameter.Value = new BoolValue(true);
tabuSelector.BestQualityParameter.ActualName = "BestQuality";
tabuSelector.CopySelected = new BoolValue(false);
tabuSelector.EmptyNeighborhoodParameter.ActualName = "EmptyNeighborhood";
tabuSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
tabuSelector.MoveQualityParameter.ActualName = MoveQualityParameter.Name;
tabuSelector.MoveTabuParameter.ActualName = MoveTabuParameter.Name;
moveMakingProcessor.Name = "MoveMaking processor (UniformSubScopesProcessor)";
emptyNeighborhoodBranch1.Name = "Neighborhood empty?";
emptyNeighborhoodBranch1.ConditionParameter.ActualName = "EmptyNeighborhood";
tabuMaker.Name = "TabuMaker (placeholder)";
tabuMaker.OperatorParameter.ActualName = TabuMakerParameter.Name;
moveMaker.Name = "MoveMaker (placeholder)";
moveMaker.OperatorParameter.ActualName = MoveMakerParameter.Name;
analyzer2.Name = "Analyzer (placeholder)";
analyzer2.OperatorParameter.ActualName = AnalyzerParameter.Name;
subScopesRemover.RemoveAllSubScopes = true;
bestQualityUpdater.Name = "Update BestQuality";
bestQualityUpdater.MaximizationParameter.ActualName = MaximizationParameter.Name;
bestQualityUpdater.QualityParameter.ActualName = QualityParameter.Name;
bestQualityUpdater.BestQualityParameter.ActualName = "BestQuality";
iterationsCounter.Name = "Iterations Counter";
iterationsCounter.Increment = new IntValue(1);
iterationsCounter.ValueParameter.ActualName = "Iterations";
iterationsComparator.Name = "Iterations >= MaximumIterations";
iterationsComparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
iterationsComparator.LeftSideParameter.ActualName = "Iterations";
iterationsComparator.RightSideParameter.ActualName = MaximumIterationsParameter.Name;
iterationsComparator.ResultParameter.ActualName = "Terminate";
emptyNeighborhoodBranch2.Name = "Neighborhood empty?";
emptyNeighborhoodBranch2.ConditionParameter.ActualName = "EmptyNeighborhood";
iterationsTermination.Name = "Iterations Termination Condition";
iterationsTermination.ConditionParameter.ActualName = "Terminate";
#endregion
#region Create operator graph
OperatorGraph.InitialOperator = variableCreator;
variableCreator.Successor = subScopesProcessor0;
subScopesProcessor0.Operators.Add(bestQualityInitializer);
subScopesProcessor0.Successor = resultsCollector1;
bestQualityInitializer.Successor = analyzer1;
analyzer1.Successor = null;
resultsCollector1.Successor = solutionProcessor;
solutionProcessor.Operators.Add(moveGenerator);
solutionProcessor.Successor = iterationsCounter;
moveGenerator.Successor = moveEvaluationProcessor;
moveEvaluationProcessor.Operator = moveEvaluator;
moveEvaluationProcessor.Successor = subScopesCounter;
moveEvaluator.Successor = tabuChecker;
tabuChecker.Successor = null;
subScopesCounter.Successor = moveQualitySorter;
moveQualitySorter.Successor = tabuSelector;
tabuSelector.Successor = emptyNeighborhoodBranch1;
emptyNeighborhoodBranch1.FalseBranch = moveMakingProcessor;
emptyNeighborhoodBranch1.TrueBranch = null;
emptyNeighborhoodBranch1.Successor = subScopesRemover;
moveMakingProcessor.Operators.Add(new EmptyOperator());
moveMakingProcessor.Operators.Add(selectedMoveMakingProcesor);
moveMakingProcessor.Successor = mergingReducer;
selectedMoveMakingProcesor.Operator = tabuMaker;
selectedMoveMakingProcesor.Successor = null;
tabuMaker.Successor = moveMaker;
moveMaker.Successor = null;
mergingReducer.Successor = analyzer2;
analyzer2.Successor = null;
subScopesRemover.Successor = null;
iterationsCounter.Successor = iterationsComparator;
iterationsComparator.Successor = emptyNeighborhoodBranch2;
emptyNeighborhoodBranch2.TrueBranch = null;
emptyNeighborhoodBranch2.FalseBranch = iterationsTermination;
emptyNeighborhoodBranch2.Successor = null;
iterationsTermination.TrueBranch = null;
iterationsTermination.FalseBranch = solutionProcessor;
#endregion
}
private void Initialize()
{
#region Create parameters
Parameters.Add(new ValueLookupParameter <IRandom>("Random", "A pseudo random number generator."));
Parameters.Add(new ValueLookupParameter <BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
Parameters.Add(new LookupParameter <DoubleValue>("Quality", "The value which represents the quality of a solution."));
Parameters.Add(new LookupParameter <DoubleValue>("BestLocalQuality", "The value which represents the best quality found so far."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("BestKnownQuality", "The problem's best known quality value found so far."));
Parameters.Add(new LookupParameter <DoubleValue>("MoveQuality", "The value which represents the quality of a move."));
Parameters.Add(new LookupParameter <IntValue>("Iterations", "The number of iterations performed."));
Parameters.Add(new ValueLookupParameter <IntValue>("MaximumIterations", "The maximum number of generations which should be processed."));
Parameters.Add(new ValueLookupParameter <VariableCollection>("Results", "The variable collection where results should be stored."));
Parameters.Add(new ValueLookupParameter <IOperator>("MoveGenerator", "The operator that generates the moves."));
Parameters.Add(new ValueLookupParameter <IOperator>("MoveMaker", "The operator that performs a move and updates the quality."));
Parameters.Add(new ValueLookupParameter <IOperator>("MoveEvaluator", "The operator that evaluates a move."));
Parameters.Add(new ValueLookupParameter <IOperator>("Analyzer", "The operator used to analyze the solution and moves."));
Parameters.Add(new LookupParameter <IntValue>("EvaluatedMoves", "The number of evaluated moves."));
#endregion
#region Create operators
SubScopesProcessor subScopesProcessor0 = new SubScopesProcessor();
Assigner bestQualityInitializer = new Assigner();
Placeholder analyzer1 = new Placeholder();
ResultsCollector resultsCollector1 = new ResultsCollector();
SubScopesProcessor mainProcessor = new SubScopesProcessor();
Placeholder moveGenerator = new Placeholder();
UniformSubScopesProcessor moveEvaluationProcessor = new UniformSubScopesProcessor();
Placeholder moveEvaluator = new Placeholder();
SubScopesCounter subScopesCounter = new SubScopesCounter();
BestSelector bestSelector = new BestSelector();
SubScopesProcessor moveMakingProcessor = new SubScopesProcessor();
UniformSubScopesProcessor selectedMoveMakingProcessor = new UniformSubScopesProcessor();
QualityComparator qualityComparator = new QualityComparator();
ConditionalBranch improvesQualityBranch = new ConditionalBranch();
Placeholder moveMaker = new Placeholder();
Assigner bestQualityUpdater = new Assigner();
ResultsCollector resultsCollector2 = new ResultsCollector();
MergingReducer mergingReducer = new MergingReducer();
Placeholder analyzer2 = new Placeholder();
SubScopesRemover subScopesRemover = new SubScopesRemover();
IntCounter iterationsCounter = new IntCounter();
Comparator iterationsComparator = new Comparator();
ConditionalBranch iterationsTermination = new ConditionalBranch();
bestQualityInitializer.Name = "Initialize BestQuality";
bestQualityInitializer.LeftSideParameter.ActualName = BestLocalQualityParameter.Name;
bestQualityInitializer.RightSideParameter.ActualName = QualityParameter.Name;
analyzer1.Name = "Analyzer (placeholder)";
analyzer1.OperatorParameter.ActualName = AnalyzerParameter.Name;
resultsCollector1.CopyValue = new BoolValue(false);
resultsCollector1.CollectedValues.Add(new LookupParameter <IntValue>(IterationsParameter.Name));
resultsCollector1.CollectedValues.Add(new LookupParameter <DoubleValue>(BestLocalQualityParameter.Name, null, BestLocalQualityParameter.Name));
resultsCollector1.ResultsParameter.ActualName = ResultsParameter.Name;
moveGenerator.Name = "MoveGenerator (placeholder)";
moveGenerator.OperatorParameter.ActualName = MoveGeneratorParameter.Name;
moveEvaluationProcessor.Parallel = new BoolValue(true);
moveEvaluator.Name = "MoveEvaluator (placeholder)";
moveEvaluator.OperatorParameter.ActualName = MoveEvaluatorParameter.Name;
subScopesCounter.Name = "Increment EvaluatedMoves";
subScopesCounter.ValueParameter.ActualName = EvaluatedMovesParameter.Name;
bestSelector.CopySelected = new BoolValue(false);
bestSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
bestSelector.NumberOfSelectedSubScopesParameter.Value = new IntValue(1);
bestSelector.QualityParameter.ActualName = MoveQualityParameter.Name;
qualityComparator.LeftSideParameter.ActualName = MoveQualityParameter.Name;
qualityComparator.RightSideParameter.ActualName = QualityParameter.Name;
qualityComparator.ResultParameter.ActualName = "IsBetter";
improvesQualityBranch.ConditionParameter.ActualName = "IsBetter";
moveMaker.Name = "MoveMaker (placeholder)";
moveMaker.OperatorParameter.ActualName = MoveMakerParameter.Name;
bestQualityUpdater.Name = "Update BestQuality";
bestQualityUpdater.LeftSideParameter.ActualName = BestLocalQualityParameter.Name;
bestQualityUpdater.RightSideParameter.ActualName = QualityParameter.Name;
resultsCollector2.CopyValue = new BoolValue(false);
resultsCollector2.CollectedValues.Add(new LookupParameter <DoubleValue>(BestLocalQualityParameter.Name, null, BestLocalQualityParameter.Name));
resultsCollector2.ResultsParameter.ActualName = ResultsParameter.Name;
analyzer2.Name = "Analyzer (placeholder)";
analyzer2.OperatorParameter.ActualName = AnalyzerParameter.Name;
subScopesRemover.RemoveAllSubScopes = true;
iterationsCounter.Name = "Iterations Counter";
iterationsCounter.Increment = new IntValue(1);
iterationsCounter.ValueParameter.ActualName = IterationsParameter.Name;
iterationsComparator.Name = "Iterations >= MaximumIterations";
iterationsComparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
iterationsComparator.LeftSideParameter.ActualName = IterationsParameter.Name;
iterationsComparator.RightSideParameter.ActualName = MaximumIterationsParameter.Name;
iterationsComparator.ResultParameter.ActualName = "Terminate";
iterationsTermination.Name = "Iterations Termination Condition";
iterationsTermination.ConditionParameter.ActualName = "Terminate";
#endregion
#region Create operator graph
OperatorGraph.InitialOperator = subScopesProcessor0; // don't change this without adapting the constructor of LocalSearchImprovementOperator
subScopesProcessor0.Operators.Add(bestQualityInitializer);
subScopesProcessor0.Successor = resultsCollector1;
bestQualityInitializer.Successor = analyzer1;
analyzer1.Successor = null;
resultsCollector1.Successor = mainProcessor;
mainProcessor.Operators.Add(moveGenerator);
mainProcessor.Successor = iterationsCounter;
moveGenerator.Successor = moveEvaluationProcessor;
moveEvaluationProcessor.Operator = moveEvaluator;
moveEvaluationProcessor.Successor = subScopesCounter;
moveEvaluator.Successor = null;
subScopesCounter.Successor = bestSelector;
bestSelector.Successor = moveMakingProcessor;
moveMakingProcessor.Operators.Add(new EmptyOperator());
moveMakingProcessor.Operators.Add(selectedMoveMakingProcessor);
moveMakingProcessor.Successor = mergingReducer;
selectedMoveMakingProcessor.Operator = qualityComparator;
qualityComparator.Successor = improvesQualityBranch;
improvesQualityBranch.TrueBranch = moveMaker;
improvesQualityBranch.FalseBranch = null;
improvesQualityBranch.Successor = null;
moveMaker.Successor = bestQualityUpdater;
bestQualityUpdater.Successor = null;
mergingReducer.Successor = analyzer2;
analyzer2.Successor = subScopesRemover;
subScopesRemover.Successor = null;
iterationsCounter.Successor = iterationsComparator;
iterationsComparator.Successor = iterationsTermination;
iterationsTermination.TrueBranch = null;
iterationsTermination.FalseBranch = mainProcessor;
#endregion
}
/// <summary cref="IValueVisitor.Visit(ConditionalBranch)"/>
public void Visit(ConditionalBranch branch)
{
// TODO: implement
throw new NotImplementedException();
}
private void Initialize()
{
#region Create parameters
Parameters.Add(new ValueLookupParameter <IRandom>("Random", "A pseudo random number generator."));
Parameters.Add(new ValueLookupParameter <BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
Parameters.Add(new ScopeTreeLookupParameter <DoubleValue>("Quality", "The value which represents the quality of a solution."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("BestKnownQuality", "The best known quality value found so far."));
Parameters.Add(new ValueLookupParameter <IntValue>("PopulationSize", "µ (mu) - the size of the population."));
Parameters.Add(new ValueLookupParameter <IntValue>("ParentsPerChild", "ρ (rho) - how many parents should be recombined."));
Parameters.Add(new ValueLookupParameter <IntValue>("MaximumGenerations", "The maximum number of generations which should be processed."));
Parameters.Add(new ValueLookupParameter <BoolValue>("PlusSelection", "True for plus selection (elitist population), false for comma selection (non-elitist population)."));
Parameters.Add(new ValueLookupParameter <BoolValue>("ReevaluateElites", "Flag to determine if elite individuals should be reevaluated (i.e., if stochastic fitness functions are used.)"));
Parameters.Add(new ValueLookupParameter <IOperator>("Mutator", "The operator used to mutate solutions."));
Parameters.Add(new ValueLookupParameter <IOperator>("Recombinator", "The operator used to cross solutions."));
Parameters.Add(new ValueLookupParameter <IOperator>("Evaluator", "The operator used to evaluate solutions. This operator is executed in parallel, if an engine is used which supports parallelization."));
Parameters.Add(new ValueLookupParameter <VariableCollection>("Results", "The variable collection where results should be stored."));
Parameters.Add(new ValueLookupParameter <IOperator>("Analyzer", "The operator used to analyze each generation."));
Parameters.Add(new LookupParameter <IntValue>("EvaluatedSolutions", "The number of times solutions have been evaluated."));
Parameters.Add(new ScopeParameter("CurrentScope", "The current scope which represents a population of solutions on which the OffspringSelectionEvolutionStrategy should be applied."));
Parameters.Add(new ValueLookupParameter <IOperator>("StrategyParameterManipulator", "The operator to mutate the endogeneous strategy parameters."));
Parameters.Add(new ValueLookupParameter <IOperator>("StrategyParameterCrossover", "The operator to cross the endogeneous strategy parameters."));
Parameters.Add(new LookupParameter <DoubleValue>("CurrentSuccessRatio", "The current success ratio."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("SuccessRatio", "The ratio of successful to total children that should be achieved."));
Parameters.Add(new LookupParameter <DoubleValue>("SelectionPressure", "The actual selection pressure."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("MaximumSelectionPressure", "The maximum selection pressure that terminates the algorithm."));
Parameters.Add(new ValueLookupParameter <IntValue>("MaximumEvaluatedSolutions", "The maximum number of evaluated solutions."));
Parameters.Add(new ValueLookupParameter <IntValue>("SelectedParents", "How much parents should be selected each time the offspring selection step is performed until the population is filled. This parameter should be about the same or twice the size of PopulationSize for smaller problems, and less for large problems."));
Parameters.Add(new LookupParameter <DoubleValue>("ComparisonFactor", "The comparison factor is used to determine whether the offspring should be compared to the better parent, the worse parent or a quality value linearly interpolated between them. It is in the range [0;1]."));
#endregion
#region Create operators
VariableCreator variableCreator = new VariableCreator();
ResultsCollector resultsCollector1 = new ResultsCollector();
Placeholder analyzer1 = new Placeholder();
WithoutRepeatingBatchedRandomSelector selector = new WithoutRepeatingBatchedRandomSelector();
SubScopesProcessor subScopesProcessor1 = new SubScopesProcessor();
Comparator useRecombinationComparator = new Comparator();
ConditionalBranch useRecombinationBranch = new ConditionalBranch();
ChildrenCreator childrenCreator = new ChildrenCreator();
UniformSubScopesProcessor uniformSubScopesProcessor1 = new UniformSubScopesProcessor();
Placeholder recombinator = new Placeholder();
Placeholder strategyRecombinator = new Placeholder();
Placeholder strategyMutator1 = new Placeholder();
Placeholder mutator1 = new Placeholder();
SubScopesRemover subScopesRemover = new SubScopesRemover();
UniformSubScopesProcessor uniformSubScopesProcessor2 = new UniformSubScopesProcessor();
Placeholder strategyMutator2 = new Placeholder();
Placeholder mutator2 = new Placeholder();
UniformSubScopesProcessor uniformSubScopesProcessor3 = new UniformSubScopesProcessor();
Placeholder evaluator = new Placeholder();
SubScopesCounter subScopesCounter = new SubScopesCounter();
ConditionalBranch plusOrCommaReplacementBranch = new ConditionalBranch();
MergingReducer plusReplacement = new MergingReducer();
RightReducer commaReplacement = new RightReducer();
BestSelector bestSelector = new BestSelector();
RightReducer rightReducer = new RightReducer();
IntCounter intCounter = new IntCounter();
Comparator maxGenerationsComparator = new Comparator();
Placeholder analyzer2 = new Placeholder();
ConditionalBranch conditionalBranchTerminate = new ConditionalBranch();
ConditionalBranch reevaluateElitesBranch = new ConditionalBranch();
SubScopesProcessor subScopesProcessor2 = new SubScopesProcessor();
UniformSubScopesProcessor uniformSubScopesProcessor4 = new UniformSubScopesProcessor();
Placeholder evaluator2 = new Placeholder();
SubScopesCounter subScopesCounter2 = new SubScopesCounter();
WeightedParentsQualityComparator parentsComparator = new WeightedParentsQualityComparator();
SubScopesRemover subScopesRemover_afterCompare = new SubScopesRemover();
EvolutionStrategyOffspringSelector offspringSelector = new EvolutionStrategyOffspringSelector();
ChildrenCopyCreator childrenCopyCreator = new ChildrenCopyCreator();
Comparator maxSelectionPressureComparator = new Comparator();
ConditionalBranch conditionalBranchTerminateSelPressure = new ConditionalBranch();
Comparator maxEvaluatedSolutionsComparator = new Comparator();
ConditionalBranch conditionalBranchTerminateEvalSolutions = new ConditionalBranch();
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>("Generations", new IntValue(0))); // Class OffspringSelectionEvolutionStrategy expects this to be called Generations
variableCreator.CollectedValues.Add(new ValueParameter <DoubleValue>("SelectionPressure", new DoubleValue(0)));
variableCreator.CollectedValues.Add(new ValueParameter <DoubleValue>("CurrentSuccessRatio", new DoubleValue(0)));
resultsCollector1.CollectedValues.Add(new LookupParameter <IntValue>("Generations"));
resultsCollector1.CollectedValues.Add(new LookupParameter <DoubleValue>("Current Selection Pressure", "Displays the rising selection pressure during a generation.", "SelectionPressure"));
resultsCollector1.CollectedValues.Add(new LookupParameter <DoubleValue>("Current Success Ratio", "Indicates how many successful children were already found during a generation (relative to the population size).", "CurrentSuccessRatio"));
resultsCollector1.CopyValue = new BoolValue(false);
resultsCollector1.ResultsParameter.ActualName = ResultsParameter.Name;
analyzer1.Name = "Analyzer (placeholder)";
analyzer1.OperatorParameter.ActualName = AnalyzerParameter.Name;
selector.Name = "ES Random Selector";
selector.RandomParameter.ActualName = RandomParameter.Name;
selector.ParentsPerChildParameter.ActualName = ParentsPerChildParameter.Name;
selector.ChildrenParameter.ActualName = SelectedParentsParameter.Name;
useRecombinationComparator.Name = "ParentsPerChild > 1";
useRecombinationComparator.LeftSideParameter.ActualName = ParentsPerChildParameter.Name;
useRecombinationComparator.RightSideParameter.Value = new IntValue(1);
useRecombinationComparator.Comparison = new Comparison(ComparisonType.Greater);
useRecombinationComparator.ResultParameter.ActualName = "UseRecombination";
useRecombinationBranch.Name = "Use Recombination?";
useRecombinationBranch.ConditionParameter.ActualName = "UseRecombination";
childrenCreator.ParentsPerChild = null;
childrenCreator.ParentsPerChildParameter.ActualName = ParentsPerChildParameter.Name;
recombinator.Name = "Recombinator (placeholder)";
recombinator.OperatorParameter.ActualName = RecombinatorParameter.Name;
strategyRecombinator.Name = "Strategy Parameter Recombinator (placeholder)";
strategyRecombinator.OperatorParameter.ActualName = StrategyParameterCrossoverParameter.Name;
strategyMutator1.Name = "Strategy Parameter Manipulator (placeholder)";
strategyMutator1.OperatorParameter.ActualName = StrategyParameterManipulatorParameter.Name;
mutator1.Name = "Mutator (placeholder)";
mutator1.OperatorParameter.ActualName = MutatorParameter.Name;
subScopesRemover.RemoveAllSubScopes = true;
strategyMutator2.Name = "Strategy Parameter Manipulator (placeholder)";
strategyMutator2.OperatorParameter.ActualName = StrategyParameterManipulatorParameter.Name;
mutator2.Name = "Mutator (placeholder)";
mutator2.OperatorParameter.ActualName = MutatorParameter.Name;
uniformSubScopesProcessor3.Parallel.Value = true;
evaluator.Name = "Evaluator (placeholder)";
evaluator.OperatorParameter.ActualName = EvaluatorParameter.Name;
subScopesCounter.Name = "Increment EvaluatedSolutions";
subScopesCounter.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
plusOrCommaReplacementBranch.ConditionParameter.ActualName = PlusSelectionParameter.Name;
bestSelector.CopySelected = new BoolValue(false);
bestSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
bestSelector.NumberOfSelectedSubScopesParameter.ActualName = PopulationSizeParameter.Name;
bestSelector.QualityParameter.ActualName = QualityParameter.Name;
intCounter.Increment = new IntValue(1);
intCounter.ValueParameter.ActualName = "Generations";
maxGenerationsComparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
maxGenerationsComparator.LeftSideParameter.ActualName = "Generations";
maxGenerationsComparator.ResultParameter.ActualName = "Terminate";
maxGenerationsComparator.RightSideParameter.ActualName = MaximumGenerationsParameter.Name;
analyzer2.Name = "Analyzer (placeholder)";
analyzer2.OperatorParameter.ActualName = AnalyzerParameter.Name;
conditionalBranchTerminate.ConditionParameter.ActualName = "Terminate";
reevaluateElitesBranch.ConditionParameter.ActualName = "ReevaluateElites";
reevaluateElitesBranch.Name = "Reevaluate elites ?";
uniformSubScopesProcessor4.Parallel.Value = true;
evaluator2.Name = "Evaluator (placeholder)";
evaluator2.OperatorParameter.ActualName = EvaluatorParameter.Name;
subScopesCounter2.Name = "Increment EvaluatedSolutions";
subScopesCounter2.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
parentsComparator.ComparisonFactorParameter.ActualName = ComparisonFactorParameter.Name;
parentsComparator.LeftSideParameter.ActualName = QualityParameter.Name;
parentsComparator.RightSideParameter.ActualName = QualityParameter.Name;
parentsComparator.MaximizationParameter.ActualName = MaximizationParameter.Name;
parentsComparator.ResultParameter.ActualName = "SuccessfulOffspring";
subScopesRemover_afterCompare.RemoveAllSubScopes = true;
offspringSelector.CurrentSuccessRatioParameter.ActualName = CurrentSuccessRatioParameter.Name;
offspringSelector.MaximumSelectionPressureParameter.ActualName = MaximumSelectionPressureParameter.Name;
offspringSelector.SelectionPressureParameter.ActualName = SelectionPressureParameter.Name;
offspringSelector.SuccessRatioParameter.ActualName = SuccessRatioParameter.Name;
offspringSelector.OffspringPopulationParameter.ActualName = "OffspringPopulation";
offspringSelector.OffspringPopulationWinnersParameter.ActualName = "OffspringPopulationWinners";
offspringSelector.SuccessfulOffspringParameter.ActualName = "SuccessfulOffspring";
offspringSelector.QualityParameter.ActualName = QualityParameter.Name;
maxSelectionPressureComparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
maxSelectionPressureComparator.LeftSideParameter.ActualName = "SelectionPressure";
maxSelectionPressureComparator.ResultParameter.ActualName = "TerminateSelectionPressure";
maxSelectionPressureComparator.RightSideParameter.ActualName = MaximumSelectionPressureParameter.Name;
conditionalBranchTerminateSelPressure.ConditionParameter.ActualName = "TerminateSelectionPressure";
maxEvaluatedSolutionsComparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
maxEvaluatedSolutionsComparator.LeftSideParameter.ActualName = "EvaluatedSolutions";
maxEvaluatedSolutionsComparator.ResultParameter.ActualName = "TerminateEvaluatedSolutions";
maxEvaluatedSolutionsComparator.RightSideParameter.ActualName = MaximumEvaluatedSolutionsParameter.Name;
conditionalBranchTerminateEvalSolutions.ConditionParameter.ActualName = "TerminateEvaluatedSolutions";
#endregion
#region Create operator graph
OperatorGraph.InitialOperator = variableCreator;
variableCreator.Successor = resultsCollector1;
resultsCollector1.Successor = analyzer1;
analyzer1.Successor = selector;
selector.Successor = subScopesProcessor1;
subScopesProcessor1.Operators.Add(new EmptyOperator());
subScopesProcessor1.Operators.Add(useRecombinationComparator);
subScopesProcessor1.Successor = offspringSelector;
offspringSelector.OffspringCreator = selector;
offspringSelector.Successor = plusOrCommaReplacementBranch;
useRecombinationComparator.Successor = useRecombinationBranch;
useRecombinationBranch.TrueBranch = childrenCreator;
useRecombinationBranch.FalseBranch = childrenCopyCreator;
childrenCopyCreator.Successor = uniformSubScopesProcessor2;
useRecombinationBranch.Successor = uniformSubScopesProcessor3;
childrenCreator.Successor = uniformSubScopesProcessor1;
uniformSubScopesProcessor1.Operator = recombinator;
uniformSubScopesProcessor1.Successor = null;
recombinator.Successor = strategyRecombinator;
strategyRecombinator.Successor = strategyMutator1;
strategyMutator1.Successor = mutator1;
mutator1.Successor = null;
uniformSubScopesProcessor2.Operator = strategyMutator2;
uniformSubScopesProcessor2.Successor = null;
strategyMutator2.Successor = mutator2;
mutator2.Successor = null;
uniformSubScopesProcessor3.Operator = evaluator;
uniformSubScopesProcessor3.Successor = subScopesCounter;
evaluator.Successor = parentsComparator;
parentsComparator.Successor = subScopesRemover_afterCompare;
subScopesRemover_afterCompare.Successor = null;
subScopesCounter.Successor = null;
plusOrCommaReplacementBranch.TrueBranch = reevaluateElitesBranch;
reevaluateElitesBranch.TrueBranch = subScopesProcessor2;
reevaluateElitesBranch.FalseBranch = null;
subScopesProcessor2.Operators.Add(uniformSubScopesProcessor4);
subScopesProcessor2.Operators.Add(new EmptyOperator());
uniformSubScopesProcessor4.Operator = evaluator2;
uniformSubScopesProcessor4.Successor = subScopesCounter2;
subScopesCounter2.Successor = null;
reevaluateElitesBranch.Successor = plusReplacement;
plusReplacement.Successor = bestSelector;
bestSelector.Successor = rightReducer;
plusOrCommaReplacementBranch.FalseBranch = commaReplacement;
plusOrCommaReplacementBranch.Successor = intCounter;
intCounter.Successor = maxGenerationsComparator;
maxGenerationsComparator.Successor = maxSelectionPressureComparator;
maxSelectionPressureComparator.Successor = maxEvaluatedSolutionsComparator;
maxEvaluatedSolutionsComparator.Successor = analyzer2;
analyzer2.Successor = conditionalBranchTerminate;
conditionalBranchTerminate.FalseBranch = conditionalBranchTerminateSelPressure;
conditionalBranchTerminate.TrueBranch = null;
conditionalBranchTerminate.Successor = null;
conditionalBranchTerminateSelPressure.FalseBranch = conditionalBranchTerminateEvalSolutions;
conditionalBranchTerminateSelPressure.TrueBranch = null;
conditionalBranchTerminateSelPressure.Successor = null;
conditionalBranchTerminateEvalSolutions.FalseBranch = selector;
conditionalBranchTerminateEvalSolutions.TrueBranch = null;
conditionalBranchTerminateEvalSolutions.Successor = null;
#endregion
}
private void Initialize()
{
#region Create parameters
Parameters.Add(new ValueLookupParameter <IRandom>("Random", "A pseudo random number generator."));
Parameters.Add(new ValueLookupParameter <BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
Parameters.Add(new LookupParameter <DoubleValue>("Quality", "The value which represents the quality of a solution."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("BestKnownQuality", "The best known quality value found so far."));
Parameters.Add(new ValueLookupParameter <IOperator>("Evaluator", "The operator used to evaluate solutions. This operator is executed in parallel, if an engine is used which supports parallelization."));
Parameters.Add(new LookupParameter <IntValue>("Iterations", "The iterations to count."));
Parameters.Add(new ValueLookupParameter <IntValue>("MaximumIterations", "The maximum number of generations which should be processed."));
Parameters.Add(new ValueLookupParameter <VariableCollection>("Results", "The variable collection where results should be stored."));
Parameters.Add(new ValueLookupParameter <IOperator>("Analyzer", "The operator used to analyze the solution."));
Parameters.Add(new LookupParameter <IntValue>("EvaluatedSolutions", "The number of evaluated solutions."));
Parameters.Add(new ValueLookupParameter <ILocalImprovementOperator>("LocalImprovement", "The local improvement operation."));
Parameters.Add(new ValueLookupParameter <IMultiNeighborhoodShakingOperator>("ShakingOperator", "The shaking operation."));
Parameters.Add(new LookupParameter <IntValue>("CurrentNeighborhoodIndex", "The index of the current shaking operation that should be applied."));
Parameters.Add(new LookupParameter <IntValue>("NeighborhoodCount", "The number of neighborhood operators used for shaking."));
#endregion
#region Create operators
VariableCreator variableCreator = new VariableCreator();
SubScopesProcessor subScopesProcessor0 = new SubScopesProcessor();
Assigner bestQualityInitializer = new Assigner();
Placeholder analyzer1 = new Placeholder();
ResultsCollector resultsCollector1 = new ResultsCollector();
CombinedOperator iteration = new CombinedOperator();
Assigner iterationInit = new Assigner();
SubScopesCloner createChild = new SubScopesCloner();
SubScopesProcessor childProcessor = new SubScopesProcessor();
Assigner qualityAssigner = new Assigner();
Placeholder shaking = new Placeholder();
Placeholder localImprovement = new Placeholder();
Placeholder evaluator = new Placeholder();
IntCounter evalCounter = new IntCounter();
QualityComparator qualityComparator = new QualityComparator();
ConditionalBranch improvesQualityBranch = new ConditionalBranch();
Assigner bestQualityUpdater = new Assigner();
BestSelector bestSelector = new BestSelector();
RightReducer rightReducer = new RightReducer();
IntCounter indexCounter = new IntCounter();
Assigner indexResetter = new Assigner();
Placeholder analyzer2 = new Placeholder();
Comparator indexComparator = new Comparator();
ConditionalBranch indexTermination = new ConditionalBranch();
IntCounter iterationsCounter = new IntCounter();
Comparator iterationsComparator = new Comparator();
ConditionalBranch iterationsTermination = new ConditionalBranch();
variableCreator.CollectedValues.Add(new ValueParameter <BoolValue>("IsBetter", new BoolValue(false)));
variableCreator.CollectedValues.Add(new ValueParameter <DoubleValue>("BestQuality", new DoubleValue(0)));
bestQualityInitializer.Name = "Initialize BestQuality";
bestQualityInitializer.LeftSideParameter.ActualName = "BestQuality";
bestQualityInitializer.RightSideParameter.ActualName = QualityParameter.Name;
analyzer1.Name = "Analyzer (placeholder)";
analyzer1.OperatorParameter.ActualName = AnalyzerParameter.Name;
resultsCollector1.CopyValue = new BoolValue(false);
resultsCollector1.CollectedValues.Add(new LookupParameter <DoubleValue>("Best Quality", null, "BestQuality"));
resultsCollector1.ResultsParameter.ActualName = ResultsParameter.Name;
iteration.Name = "MainLoop Body";
iterationInit.Name = "Init k = 0";
iterationInit.LeftSideParameter.ActualName = CurrentNeighborhoodIndexParameter.Name;
iterationInit.RightSideParameter.Value = new IntValue(0);
createChild.Name = "Clone solution";
qualityAssigner.Name = "Assign quality";
qualityAssigner.LeftSideParameter.ActualName = "OriginalQuality";
qualityAssigner.RightSideParameter.ActualName = QualityParameter.Name;
shaking.Name = "Shaking operator (placeholder)";
shaking.OperatorParameter.ActualName = ShakingOperatorParameter.Name;
localImprovement.Name = "Local improvement operator (placeholder)";
localImprovement.OperatorParameter.ActualName = LocalImprovementParameter.Name;
evaluator.Name = "Evaluation operator (placeholder)";
evaluator.OperatorParameter.ActualName = EvaluatorParameter.Name;
evalCounter.Name = "Count evaluations";
evalCounter.Increment.Value = 1;
evalCounter.ValueParameter.ActualName = EvaluatedSolutionsParameter.ActualName;
qualityComparator.LeftSideParameter.ActualName = QualityParameter.Name;
qualityComparator.RightSideParameter.ActualName = "OriginalQuality";
qualityComparator.ResultParameter.ActualName = "IsBetter";
improvesQualityBranch.ConditionParameter.ActualName = "IsBetter";
bestQualityUpdater.Name = "Update BestQuality";
bestQualityUpdater.LeftSideParameter.ActualName = "BestQuality";
bestQualityUpdater.RightSideParameter.ActualName = QualityParameter.Name;
bestSelector.CopySelected = new BoolValue(false);
bestSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
bestSelector.NumberOfSelectedSubScopesParameter.Value = new IntValue(1);
bestSelector.QualityParameter.ActualName = QualityParameter.Name;
indexCounter.Name = "Count neighborhood index";
indexCounter.Increment.Value = 1;
indexCounter.ValueParameter.ActualName = CurrentNeighborhoodIndexParameter.Name;
indexResetter.Name = "Reset neighborhood index";
indexResetter.LeftSideParameter.ActualName = CurrentNeighborhoodIndexParameter.Name;
indexResetter.RightSideParameter.Value = new IntValue(0);
analyzer2.Name = "Analyzer (placeholder)";
analyzer2.OperatorParameter.ActualName = AnalyzerParameter.Name;
iterationsCounter.Name = "Iterations Counter";
iterationsCounter.Increment = new IntValue(1);
iterationsCounter.ValueParameter.ActualName = IterationsParameter.Name;
iterationsComparator.Name = "Iterations >= MaximumIterations";
iterationsComparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
iterationsComparator.LeftSideParameter.ActualName = IterationsParameter.Name;
iterationsComparator.RightSideParameter.ActualName = MaximumIterationsParameter.Name;
iterationsComparator.ResultParameter.ActualName = "Terminate";
iterationsTermination.Name = "Iterations Termination Condition";
iterationsTermination.ConditionParameter.ActualName = "Terminate";
indexComparator.Name = "k < k_max (index condition)";
indexComparator.LeftSideParameter.ActualName = CurrentNeighborhoodIndexParameter.Name;
indexComparator.RightSideParameter.ActualName = NeighborhoodCountParameter.Name;
indexComparator.Comparison = new Comparison(ComparisonType.Less);
indexComparator.ResultParameter.ActualName = "ContinueIteration";
indexTermination.Name = "Index Termination Condition";
indexTermination.ConditionParameter.ActualName = "ContinueIteration";
#endregion
#region Create operator graph
OperatorGraph.InitialOperator = variableCreator;
variableCreator.Successor = subScopesProcessor0;
subScopesProcessor0.Operators.Add(bestQualityInitializer);
subScopesProcessor0.Successor = analyzer1;
analyzer1.Successor = resultsCollector1;
/////////
resultsCollector1.Successor = iteration;
iteration.OperatorGraph.InitialOperator = iterationInit;
iteration.Successor = iterationsCounter;
iterationInit.Successor = createChild;
createChild.Successor = childProcessor;
childProcessor.Operators.Add(new EmptyOperator());
childProcessor.Operators.Add(qualityAssigner);
childProcessor.Successor = bestSelector;
/////////
qualityAssigner.Successor = shaking;
shaking.Successor = evaluator;
evaluator.Successor = evalCounter;
evalCounter.Successor = localImprovement;
localImprovement.Successor = qualityComparator;
qualityComparator.Successor = improvesQualityBranch;
improvesQualityBranch.TrueBranch = bestQualityUpdater;
improvesQualityBranch.FalseBranch = indexCounter;
bestQualityUpdater.Successor = indexResetter;
indexResetter.Successor = null;
indexCounter.Successor = null;
/////////
bestSelector.Successor = rightReducer;
rightReducer.Successor = analyzer2;
analyzer2.Successor = indexComparator;
indexComparator.Successor = indexTermination;
indexTermination.TrueBranch = createChild;
indexTermination.FalseBranch = null;
iterationsCounter.Successor = iterationsComparator;
iterationsComparator.Successor = iterationsTermination;
iterationsTermination.TrueBranch = null;
iterationsTermination.FalseBranch = iteration;
#endregion
}
public IslandGeneticAlgorithmMainLoop()
: base()
{
#region Create parameters
Parameters.Add(new ValueLookupParameter <IRandom>("Random", "A pseudo random number generator."));
Parameters.Add(new ValueLookupParameter <BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
Parameters.Add(new ScopeTreeLookupParameter <DoubleValue>("Quality", "The value which represents the quality of a solution."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("BestKnownQuality", "The best known quality value found so far."));
Parameters.Add(new ValueLookupParameter <IntValue>("NumberOfIslands", "The number of islands."));
Parameters.Add(new ValueLookupParameter <IntValue>("MigrationInterval", "The number of generations that should pass between migration phases."));
Parameters.Add(new ValueLookupParameter <PercentValue>("MigrationRate", "The proportion of individuals that should migrate between the islands."));
Parameters.Add(new ValueLookupParameter <IOperator>("Migrator", "The migration strategy."));
Parameters.Add(new ValueLookupParameter <IOperator>("EmigrantsSelector", "Selects the individuals that will be migrated."));
Parameters.Add(new ValueLookupParameter <IOperator>("ImmigrationReplacer", "Replaces some of the original population with the immigrants."));
Parameters.Add(new ValueLookupParameter <IntValue>("PopulationSize", "The size of the population of solutions."));
Parameters.Add(new ValueLookupParameter <IntValue>("MaximumGenerations", "The maximum number of generations that the algorithm should process."));
Parameters.Add(new ValueLookupParameter <IOperator>("Selector", "The operator used to select solutions for reproduction."));
Parameters.Add(new ValueLookupParameter <IOperator>("Crossover", "The operator used to cross solutions."));
Parameters.Add(new ValueLookupParameter <PercentValue>("MutationProbability", "The probability that the mutation operator is applied on a solution."));
Parameters.Add(new ValueLookupParameter <IOperator>("Mutator", "The operator used to mutate solutions."));
Parameters.Add(new ValueLookupParameter <IOperator>("Evaluator", "The operator used to evaluate solutions."));
Parameters.Add(new ValueLookupParameter <IntValue>("Elites", "The numer of elite solutions which are kept in each generation."));
Parameters.Add(new ValueLookupParameter <BoolValue>("ReevaluateElites", "Flag to determine if elite individuals should be reevaluated (i.e., if stochastic fitness functions are used.)"));
Parameters.Add(new ValueLookupParameter <ResultCollection>("Results", "The results collection to store the results."));
Parameters.Add(new ValueLookupParameter <IOperator>("Analyzer", "The operator used to the analyze the islands."));
Parameters.Add(new ValueLookupParameter <IOperator>("IslandAnalyzer", "The operator used to analyze each island."));
Parameters.Add(new LookupParameter <IntValue>("EvaluatedSolutions", "The number of times a solution has been evaluated."));
Parameters.Add(new LookupParameter <IntValue>("IslandGenerations", "The number of generations calculated on one island."));
Parameters.Add(new LookupParameter <IntValue>("IslandEvaluatedSolutions", "The number of times a solution has been evaluated on one island."));
Parameters.Add(new ValueLookupParameter <BoolValue>("Migrate", "Migrate the island?"));
#endregion
#region Create operators
VariableCreator variableCreator = new VariableCreator();
UniformSubScopesProcessor uniformSubScopesProcessor0 = new UniformSubScopesProcessor();
VariableCreator islandVariableCreator = new VariableCreator();
Placeholder islandAnalyzer1 = new Placeholder();
LocalRandomCreator localRandomCreator = new LocalRandomCreator();
Placeholder analyzer1 = new Placeholder();
ResultsCollector resultsCollector1 = new ResultsCollector();
UniformSubScopesProcessor uniformSubScopesProcessor1 = new UniformSubScopesProcessor();
Assigner generationsAssigner = new Assigner();
Assigner evaluatedSolutionsAssigner = new Assigner();
Placeholder selector = new Placeholder();
SubScopesProcessor subScopesProcessor1 = new SubScopesProcessor();
ChildrenCreator childrenCreator = new ChildrenCreator();
UniformSubScopesProcessor uniformSubScopesProcessor2 = new UniformSubScopesProcessor();
Placeholder crossover = new Placeholder();
StochasticBranch stochasticBranch = new StochasticBranch();
Placeholder mutator = new Placeholder();
SubScopesRemover subScopesRemover = new SubScopesRemover();
UniformSubScopesProcessor uniformSubScopesProcessor3 = new UniformSubScopesProcessor();
Placeholder evaluator = new Placeholder();
SubScopesCounter subScopesCounter = new SubScopesCounter();
SubScopesProcessor subScopesProcessor2 = new SubScopesProcessor();
BestSelector bestSelector = new BestSelector();
RightReducer rightReducer = new RightReducer();
MergingReducer mergingReducer = new MergingReducer();
IntCounter islandGenerationsCounter = new IntCounter();
Comparator checkIslandGenerationsReachedMaximum = new Comparator();
ConditionalBranch checkContinueEvolution = new ConditionalBranch();
DataReducer generationsReducer = new DataReducer();
DataReducer evaluatedSolutionsReducer = new DataReducer();
Placeholder islandAnalyzer2 = new Placeholder();
UniformSubScopesProcessor uniformSubScopesProcessor5 = new UniformSubScopesProcessor();
Placeholder emigrantsSelector = new Placeholder();
IntCounter migrationsCounter = new IntCounter();
Placeholder migrator = new Placeholder();
UniformSubScopesProcessor uniformSubScopesProcessor6 = new UniformSubScopesProcessor();
Placeholder immigrationReplacer = new Placeholder();
Comparator generationsComparator = new Comparator();
Placeholder analyzer2 = new Placeholder();
ConditionalBranch generationsTerminationCondition = new ConditionalBranch();
ConditionalBranch reevaluateElitesBranch = new ConditionalBranch();
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>("Migrations", new IntValue(0)));
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>("GenerationsSinceLastMigration", new IntValue(0)));
variableCreator.CollectedValues.Add(new ValueParameter <IntValue>("Generations", new IntValue(0))); // Class IslandGeneticAlgorithm expects this to be called Generations
islandVariableCreator.CollectedValues.Add(new ValueParameter <ResultCollection>("Results", new ResultCollection()));
islandVariableCreator.CollectedValues.Add(new ValueParameter <IntValue>("IslandGenerations", new IntValue(0)));
islandVariableCreator.CollectedValues.Add(new ValueParameter <IntValue>("IslandEvaluatedSolutions", new IntValue(0)));
islandAnalyzer1.Name = "Island Analyzer (placeholder)";
islandAnalyzer1.OperatorParameter.ActualName = IslandAnalyzerParameter.Name;
analyzer1.Name = "Analyzer (placeholder)";
analyzer1.OperatorParameter.ActualName = AnalyzerParameter.Name;
resultsCollector1.CollectedValues.Add(new LookupParameter <IntValue>("Migrations"));
resultsCollector1.CollectedValues.Add(new LookupParameter <IntValue>("Generations"));
resultsCollector1.CollectedValues.Add(new ScopeTreeLookupParameter <ResultCollection>("IslandResults", "Result set for each island", "Results"));
resultsCollector1.ResultsParameter.ActualName = ResultsParameter.Name;
uniformSubScopesProcessor1.Parallel.Value = true;
generationsAssigner.Name = "Initialize Island Generations";
generationsAssigner.LeftSideParameter.ActualName = IslandGenerations.Name;
generationsAssigner.RightSideParameter.Value = new IntValue(0);
evaluatedSolutionsAssigner.Name = "Initialize Island evaluated solutions";
evaluatedSolutionsAssigner.LeftSideParameter.ActualName = IslandEvaluatedSolutions.Name;
evaluatedSolutionsAssigner.RightSideParameter.Value = new IntValue(0);
selector.Name = "Selector (placeholder)";
selector.OperatorParameter.ActualName = SelectorParameter.Name;
childrenCreator.ParentsPerChild = new IntValue(2);
crossover.Name = "Crossover (placeholder)";
crossover.OperatorParameter.ActualName = CrossoverParameter.Name;
stochasticBranch.ProbabilityParameter.ActualName = MutationProbabilityParameter.Name;
//set it to the random number generator of the island
stochasticBranch.RandomParameter.ActualName = "LocalRandom";
mutator.Name = "Mutator (placeholder)";
mutator.OperatorParameter.ActualName = MutatorParameter.Name;
subScopesRemover.RemoveAllSubScopes = true;
evaluator.Name = "Evaluator (placeholder)";
evaluator.OperatorParameter.ActualName = EvaluatorParameter.Name;
subScopesCounter.Name = "Increment EvaluatedSolutions";
subScopesCounter.ValueParameter.ActualName = IslandEvaluatedSolutions.Name;
bestSelector.CopySelected = new BoolValue(false);
bestSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
bestSelector.NumberOfSelectedSubScopesParameter.ActualName = ElitesParameter.Name;
bestSelector.QualityParameter.ActualName = QualityParameter.Name;
islandGenerationsCounter.Name = "Increment island generatrions";
islandGenerationsCounter.ValueParameter.ActualName = IslandGenerations.Name;
islandGenerationsCounter.Increment = new IntValue(1);
checkIslandGenerationsReachedMaximum.LeftSideParameter.ActualName = IslandGenerations.Name;
checkIslandGenerationsReachedMaximum.RightSideParameter.ActualName = MigrationIntervalParameter.Name;
checkIslandGenerationsReachedMaximum.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
checkIslandGenerationsReachedMaximum.ResultParameter.ActualName = Migrate.Name;
checkContinueEvolution.Name = "Migrate?";
checkContinueEvolution.ConditionParameter.ActualName = Migrate.Name;
checkContinueEvolution.FalseBranch = selector;
islandAnalyzer2.Name = "Island Analyzer (placeholder)";
islandAnalyzer2.OperatorParameter.ActualName = IslandAnalyzerParameter.Name;
generationsReducer.Name = "Increment Generations";
generationsReducer.ParameterToReduce.ActualName = islandGenerationsCounter.ValueParameter.ActualName;
generationsReducer.TargetParameter.ActualName = "Generations";
generationsReducer.ReductionOperation.Value = new ReductionOperation(ReductionOperations.Min);
generationsReducer.TargetOperation.Value = new ReductionOperation(ReductionOperations.Sum);
evaluatedSolutionsReducer.Name = "Increment Evaluated Solutions";
evaluatedSolutionsReducer.ParameterToReduce.ActualName = IslandEvaluatedSolutions.Name;
evaluatedSolutionsReducer.TargetParameter.ActualName = EvaluatedSolutionsParameter.Name;
evaluatedSolutionsReducer.ReductionOperation.Value = new ReductionOperation(ReductionOperations.Sum);
evaluatedSolutionsReducer.TargetOperation.Value = new ReductionOperation(ReductionOperations.Sum);
emigrantsSelector.Name = "Emigrants Selector (placeholder)";
emigrantsSelector.OperatorParameter.ActualName = EmigrantsSelectorParameter.Name;
migrationsCounter.Name = "Increment number of Migrations";
migrationsCounter.ValueParameter.ActualName = "Migrations";
migrationsCounter.Increment = new IntValue(1);
migrator.Name = "Migrator (placeholder)";
migrator.OperatorParameter.ActualName = MigratorParameter.Name;
immigrationReplacer.Name = "Immigration Replacer (placeholder)";
immigrationReplacer.OperatorParameter.ActualName = ImmigrationReplacerParameter.Name;
generationsComparator.Name = "Generations >= MaximumGenerations ?";
generationsComparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
generationsComparator.LeftSideParameter.ActualName = "Generations";
generationsComparator.ResultParameter.ActualName = "TerminateGenerations";
generationsComparator.RightSideParameter.ActualName = MaximumGenerationsParameter.Name;
analyzer2.Name = "Analyzer (placeholder)";
analyzer2.OperatorParameter.ActualName = AnalyzerParameter.Name;
generationsTerminationCondition.Name = "Terminate?";
generationsTerminationCondition.ConditionParameter.ActualName = "TerminateGenerations";
reevaluateElitesBranch.ConditionParameter.ActualName = "ReevaluateElites";
reevaluateElitesBranch.Name = "Reevaluate elites ?";
#endregion
#region Create operator graph
OperatorGraph.InitialOperator = variableCreator;
variableCreator.Successor = uniformSubScopesProcessor0;
uniformSubScopesProcessor0.Operator = islandVariableCreator;
uniformSubScopesProcessor0.Successor = analyzer1;
islandVariableCreator.Successor = islandAnalyzer1;
// BackwardsCompatibility3.3
//the local randoms are created by the island GA itself and are only here to ensure same algorithm results
#region Backwards compatible code, remove local random creator with 3.4 and rewire the operator graph
islandAnalyzer1.Successor = localRandomCreator;
localRandomCreator.Successor = null;
#endregion
analyzer1.Successor = resultsCollector1;
resultsCollector1.Successor = uniformSubScopesProcessor1;
uniformSubScopesProcessor1.Operator = generationsAssigner;
uniformSubScopesProcessor1.Successor = generationsReducer;
generationsReducer.Successor = evaluatedSolutionsReducer;
evaluatedSolutionsReducer.Successor = migrationsCounter;
migrationsCounter.Successor = uniformSubScopesProcessor5;
generationsAssigner.Successor = evaluatedSolutionsAssigner;
evaluatedSolutionsAssigner.Successor = selector;
selector.Successor = subScopesProcessor1;
subScopesProcessor1.Operators.Add(new EmptyOperator());
subScopesProcessor1.Operators.Add(childrenCreator);
subScopesProcessor1.Successor = subScopesProcessor2;
childrenCreator.Successor = uniformSubScopesProcessor2;
uniformSubScopesProcessor2.Operator = crossover;
uniformSubScopesProcessor2.Successor = uniformSubScopesProcessor3;
crossover.Successor = stochasticBranch;
stochasticBranch.FirstBranch = mutator;
stochasticBranch.SecondBranch = null;
stochasticBranch.Successor = subScopesRemover;
mutator.Successor = null;
subScopesRemover.Successor = null;
uniformSubScopesProcessor3.Operator = evaluator;
uniformSubScopesProcessor3.Successor = subScopesCounter;
evaluator.Successor = null;
subScopesCounter.Successor = null;
subScopesProcessor2.Operators.Add(bestSelector);
subScopesProcessor2.Operators.Add(new EmptyOperator());
subScopesProcessor2.Successor = mergingReducer;
mergingReducer.Successor = islandAnalyzer2;
bestSelector.Successor = rightReducer;
rightReducer.Successor = reevaluateElitesBranch;
reevaluateElitesBranch.TrueBranch = uniformSubScopesProcessor3;
reevaluateElitesBranch.FalseBranch = null;
reevaluateElitesBranch.Successor = null;
islandAnalyzer2.Successor = islandGenerationsCounter;
islandGenerationsCounter.Successor = checkIslandGenerationsReachedMaximum;
checkIslandGenerationsReachedMaximum.Successor = checkContinueEvolution;
uniformSubScopesProcessor5.Operator = emigrantsSelector;
emigrantsSelector.Successor = null;
uniformSubScopesProcessor5.Successor = migrator;
migrator.Successor = uniformSubScopesProcessor6;
uniformSubScopesProcessor6.Operator = immigrationReplacer;
uniformSubScopesProcessor6.Successor = generationsComparator;
generationsComparator.Successor = analyzer2;
analyzer2.Successor = generationsTerminationCondition;
generationsTerminationCondition.TrueBranch = null;
generationsTerminationCondition.FalseBranch = uniformSubScopesProcessor1;
generationsTerminationCondition.Successor = null;
#endregion
}
protected GaussianProcessBase(IDataAnalysisProblem problem)
: base()
{
Problem = problem;
Parameters.Add(new ValueParameter <IMeanFunction>(MeanFunctionParameterName, "The mean function to use.", new MeanConst()));
Parameters.Add(new ValueParameter <ICovarianceFunction>(CovarianceFunctionParameterName, "The covariance function to use.", new CovarianceSquaredExponentialIso()));
Parameters.Add(new ValueParameter <IntValue>(MinimizationIterationsParameterName, "The number of iterations for likelihood optimization with LM-BFGS.", new IntValue(20)));
Parameters.Add(new ValueParameter <IntValue>(SeedParameterName, "The random seed used to initialize the new pseudo random number generator.", new IntValue(0)));
Parameters.Add(new ValueParameter <BoolValue>(SetSeedRandomlyParameterName, "True if the random seed should be set to a random value, otherwise false.", new BoolValue(true)));
Parameters.Add(new ValueParameter <BoolValue>(ApproximateGradientsParameterName, "Indicates that gradients should not be approximated (necessary for LM-BFGS).", new BoolValue(false)));
Parameters[ApproximateGradientsParameterName].Hidden = true; // should not be changed
Parameters.Add(new FixedValueParameter <BoolValue>(ScaleInputValuesParameterName,
"Determines if the input variable values are scaled to the range [0..1] for training.", new BoolValue(true)));
Parameters[ScaleInputValuesParameterName].Hidden = true;
// necessary for BFGS
Parameters.Add(new FixedValueParameter <BoolValue>("Maximization (BFGS)", new BoolValue(false)));
Parameters["Maximization (BFGS)"].Hidden = true;
var randomCreator = new HeuristicLab.Random.RandomCreator();
var gpInitializer = new GaussianProcessHyperparameterInitializer();
var bfgsInitializer = new LbfgsInitializer();
var makeStep = new LbfgsMakeStep();
var branch = new ConditionalBranch();
var modelCreator = new Placeholder();
var updateResults = new LbfgsUpdateResults();
var analyzer = new LbfgsAnalyzer();
var finalModelCreator = new Placeholder();
var finalAnalyzer = new LbfgsAnalyzer();
var solutionCreator = new Placeholder();
OperatorGraph.InitialOperator = randomCreator;
randomCreator.SeedParameter.ActualName = SeedParameterName;
randomCreator.SeedParameter.Value = null;
randomCreator.SetSeedRandomlyParameter.ActualName = SetSeedRandomlyParameterName;
randomCreator.SetSeedRandomlyParameter.Value = null;
randomCreator.Successor = gpInitializer;
gpInitializer.CovarianceFunctionParameter.ActualName = CovarianceFunctionParameterName;
gpInitializer.MeanFunctionParameter.ActualName = MeanFunctionParameterName;
gpInitializer.ProblemDataParameter.ActualName = Problem.ProblemDataParameter.Name;
gpInitializer.HyperparameterParameter.ActualName = HyperparameterParameterName;
gpInitializer.RandomParameter.ActualName = randomCreator.RandomParameter.Name;
gpInitializer.Successor = bfgsInitializer;
bfgsInitializer.IterationsParameter.ActualName = MinimizationIterationsParameterName;
bfgsInitializer.PointParameter.ActualName = HyperparameterParameterName;
bfgsInitializer.ApproximateGradientsParameter.ActualName = ApproximateGradientsParameterName;
bfgsInitializer.Successor = makeStep;
makeStep.StateParameter.ActualName = bfgsInitializer.StateParameter.Name;
makeStep.PointParameter.ActualName = HyperparameterParameterName;
makeStep.Successor = branch;
branch.ConditionParameter.ActualName = makeStep.TerminationCriterionParameter.Name;
branch.FalseBranch = modelCreator;
branch.TrueBranch = finalModelCreator;
modelCreator.OperatorParameter.ActualName = ModelCreatorParameterName;
modelCreator.Successor = updateResults;
updateResults.MaximizationParameter.ActualName = "Maximization (BFGS)";
updateResults.StateParameter.ActualName = bfgsInitializer.StateParameter.Name;
updateResults.QualityParameter.ActualName = NegativeLogLikelihoodParameterName;
updateResults.QualityGradientsParameter.ActualName = HyperparameterGradientsParameterName;
updateResults.ApproximateGradientsParameter.ActualName = ApproximateGradientsParameterName;
updateResults.Successor = analyzer;
analyzer.QualityParameter.ActualName = NegativeLogLikelihoodParameterName;
analyzer.PointParameter.ActualName = HyperparameterParameterName;
analyzer.QualityGradientsParameter.ActualName = HyperparameterGradientsParameterName;
analyzer.StateParameter.ActualName = bfgsInitializer.StateParameter.Name;
analyzer.PointsTableParameter.ActualName = "Hyperparameter table";
analyzer.QualityGradientsTableParameter.ActualName = "Gradients table";
analyzer.QualitiesTableParameter.ActualName = "Negative log likelihood table";
analyzer.Successor = makeStep;
finalModelCreator.OperatorParameter.ActualName = ModelCreatorParameterName;
finalModelCreator.Successor = finalAnalyzer;
finalAnalyzer.QualityParameter.ActualName = NegativeLogLikelihoodParameterName;
finalAnalyzer.PointParameter.ActualName = HyperparameterParameterName;
finalAnalyzer.QualityGradientsParameter.ActualName = HyperparameterGradientsParameterName;
finalAnalyzer.PointsTableParameter.ActualName = analyzer.PointsTableParameter.ActualName;
finalAnalyzer.QualityGradientsTableParameter.ActualName = analyzer.QualityGradientsTableParameter.ActualName;
finalAnalyzer.QualitiesTableParameter.ActualName = analyzer.QualitiesTableParameter.ActualName;
finalAnalyzer.Successor = solutionCreator;
solutionCreator.OperatorParameter.ActualName = SolutionCreatorParameterName;
}
public virtual Statement visit(ConditionalBranch s)
{
s.condition = visitReadProgramVariable(s.condition);
return(s);
}
private void Initialize()
{
#region Create parameters
Parameters.Add(new ValueLookupParameter <IRandom>("Random", "A pseudo random number generator."));
Parameters.Add(new ValueLookupParameter <IntValue>("SwarmSize", "Size of the particle swarm."));
Parameters.Add(new ValueLookupParameter <IntValue>("MaxIterations", "Maximal number of iterations."));
Parameters.Add(new ValueLookupParameter <IOperator>("Analyzer", "The operator used to analyze each generation."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("CurrentInertia", "Inertia weight on a particle's movement (omega)."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("PersonalBestAttraction", "Weight for particle's pull towards its personal best soution (phi_p)."));
Parameters.Add(new ValueLookupParameter <DoubleValue>("NeighborBestAttraction", "Weight for pull towards the neighborhood best solution or global best solution in case of a totally connected topology (phi_g)."));
Parameters.Add(new ValueLookupParameter <IOperator>("ParticleUpdater", "Operator that calculates new position and velocity of a particle"));
Parameters.Add(new ValueLookupParameter <IOperator>("TopologyUpdater", "Updates the neighborhood description vectors"));
Parameters.Add(new ValueLookupParameter <IOperator>("InertiaUpdater", "Updates the omega parameter"));
Parameters.Add(new ValueLookupParameter <IOperator>("Evaluator", "Evaluates a particle solution."));
Parameters.Add(new ValueLookupParameter <ResultCollection>("Results", "The variable collection where results should be stored."));
Parameters.Add(new LookupParameter <IntValue>("EvaluatedSolutions", "The number of times solutions have been evaluated."));
Parameters.Add(new ValueLookupParameter <ISwarmUpdater>("SwarmUpdater", "The encoding-specific swarm updater."));
#endregion
#region Create operators
ResultsCollector resultsCollector = new ResultsCollector();
Placeholder swarmUpdaterPlaceholer1 = new Placeholder();
Placeholder evaluatorPlaceholder = new Placeholder();
Placeholder analyzerPlaceholder = new Placeholder();
Placeholder analyzer2Placeholder = new Placeholder();
UniformSubScopesProcessor uniformSubScopeProcessor = new UniformSubScopesProcessor();
Placeholder particleUpdaterPlaceholder = new Placeholder();
Placeholder topologyUpdaterPlaceholder = new Placeholder();
UniformSubScopesProcessor evaluationProcessor = new UniformSubScopesProcessor();
Placeholder swarmUpdater = new Placeholder();
IntCounter iterationsCounter = new IntCounter();
Comparator iterationsComparator = new Comparator();
ConditionalBranch conditionalBranch = new ConditionalBranch();
Placeholder inertiaUpdaterPlaceholder = new Placeholder();
SubScopesCounter subScopesCounter = new SubScopesCounter();
#endregion
#region Create operator graph
OperatorGraph.InitialOperator = resultsCollector;
resultsCollector.CollectedValues.Add(new LookupParameter <IntValue>("Iterations"));
resultsCollector.CollectedValues.Add(new LookupParameter <DoubleValue>("CurrentInertia"));
resultsCollector.CollectedValues.Add(new LookupParameter <IntValue>("Evaluated Solutions", null, "EvaluatedSolutions"));
resultsCollector.ResultsParameter.ActualName = "Results";
resultsCollector.Successor = swarmUpdaterPlaceholer1;
swarmUpdaterPlaceholer1.Name = "(Swarm Updater)";
swarmUpdaterPlaceholer1.OperatorParameter.ActualName = SwarmUpdaterParameter.ActualName;
swarmUpdaterPlaceholer1.Successor = analyzerPlaceholder;
analyzerPlaceholder.Name = "(Analyzer)";
analyzerPlaceholder.OperatorParameter.ActualName = AnalyzerParameter.Name;
analyzerPlaceholder.Successor = uniformSubScopeProcessor;
uniformSubScopeProcessor.Operator = particleUpdaterPlaceholder;
uniformSubScopeProcessor.Successor = evaluationProcessor;
particleUpdaterPlaceholder.Name = "(ParticleUpdater)";
particleUpdaterPlaceholder.OperatorParameter.ActualName = ParticleUpdaterParameter.Name;
evaluationProcessor.Parallel = new BoolValue(true);
evaluationProcessor.Operator = evaluatorPlaceholder;
evaluationProcessor.Successor = subScopesCounter;
evaluatorPlaceholder.Name = "(Evaluator)";
evaluatorPlaceholder.OperatorParameter.ActualName = EvaluatorParameter.Name;
subScopesCounter.Name = "Increment EvaluatedSolutions";
subScopesCounter.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
subScopesCounter.Successor = topologyUpdaterPlaceholder;
topologyUpdaterPlaceholder.Name = "(TopologyUpdater)";
topologyUpdaterPlaceholder.OperatorParameter.ActualName = TopologyUpdaterParameter.Name;
topologyUpdaterPlaceholder.Successor = swarmUpdater;
swarmUpdater.Name = "(Swarm Updater)";
swarmUpdater.OperatorParameter.ActualName = SwarmUpdaterParameter.ActualName;
swarmUpdater.Successor = inertiaUpdaterPlaceholder;
inertiaUpdaterPlaceholder.Name = "(Inertia Updater)";
inertiaUpdaterPlaceholder.OperatorParameter.ActualName = InertiaUpdaterParameter.ActualName;
inertiaUpdaterPlaceholder.Successor = iterationsCounter;
iterationsCounter.Name = "Iterations++";
iterationsCounter.ValueParameter.ActualName = "Iterations";
iterationsCounter.Successor = iterationsComparator;
iterationsComparator.LeftSideParameter.ActualName = "Iterations";
iterationsComparator.Comparison = new Comparison(ComparisonType.Less);
iterationsComparator.RightSideParameter.ActualName = "MaxIterations";
iterationsComparator.ResultParameter.ActualName = "ContinueIteration";
iterationsComparator.Successor = conditionalBranch;
conditionalBranch.Name = "ContinueIteration?";
conditionalBranch.ConditionParameter.ActualName = "ContinueIteration";
conditionalBranch.TrueBranch = analyzerPlaceholder;
conditionalBranch.FalseBranch = analyzer2Placeholder;
analyzer2Placeholder.Name = "(Analyzer)";
analyzer2Placeholder.OperatorParameter.ActualName = AnalyzerParameter.Name;
#endregion
}
