| 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| 3 | * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
|---|
| 4 | *
|
|---|
| 5 | * This file is part of HeuristicLab.
|
|---|
| 6 | *
|
|---|
| 7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
|---|
| 8 | * it under the terms of the GNU General Public License as published by
|
|---|
| 9 | * the Free Software Foundation, either version 3 of the License, or
|
|---|
| 10 | * (at your option) any later version.
|
|---|
| 11 | *
|
|---|
| 12 | * HeuristicLab is distributed in the hope that it will be useful,
|
|---|
| 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|---|
| 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|---|
| 15 | * GNU General Public License for more details.
|
|---|
| 16 | *
|
|---|
| 17 | * You should have received a copy of the GNU General Public License
|
|---|
| 18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
|---|
| 19 | */
|
|---|
| 20 | #endregion
|
|---|
| 21 |
|
|---|
| 22 | using HeuristicLab.Common;
|
|---|
| 23 | using HeuristicLab.Core;
|
|---|
| 24 | using HeuristicLab.Data;
|
|---|
| 25 | using HeuristicLab.Operators;
|
|---|
| 26 | using HeuristicLab.Optimization;
|
|---|
| 27 | using HeuristicLab.Optimization.Operators;
|
|---|
| 28 | using HeuristicLab.Parameters;
|
|---|
| 29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
|---|
| 30 | using HeuristicLab.Selection;
|
|---|
| 31 |
|
|---|
| 32 | namespace HeuristicLab.Algorithms.GeneticAlgorithm {
|
|---|
| 33 | /// <summary>
|
|---|
| 34 | /// An island genetic algorithm main loop operator.
|
|---|
| 35 | /// </summary>
|
|---|
| 36 | [Item("ParallelIslandGeneticAlgorithmMainLoop", "An island genetic algorithm main loop operator.")]
|
|---|
| 37 | [StorableClass]
|
|---|
| 38 | public sealed class ParallelIslandGeneticAlgorithmMainLoop : AlgorithmOperator {
|
|---|
| 39 | #region Parameter Properties
|
|---|
| 40 | public ValueLookupParameter<IRandom> RandomParameter {
|
|---|
| 41 | get { return (ValueLookupParameter<IRandom>)Parameters["Random"]; }
|
|---|
| 42 | }
|
|---|
| 43 | public ValueLookupParameter<BoolValue> MaximizationParameter {
|
|---|
| 44 | get { return (ValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
|
|---|
| 45 | }
|
|---|
| 46 | public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
|
|---|
| 47 | get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
|
|---|
| 48 | }
|
|---|
| 49 | public ValueLookupParameter<DoubleValue> BestKnownQualityParameter {
|
|---|
| 50 | get { return (ValueLookupParameter<DoubleValue>)Parameters["BestKnownQuality"]; }
|
|---|
| 51 | }
|
|---|
| 52 | public ValueLookupParameter<IntValue> NumberOfIslandsParameter {
|
|---|
| 53 | get { return (ValueLookupParameter<IntValue>)Parameters["NumberOfIslands"]; }
|
|---|
| 54 | }
|
|---|
| 55 | public ValueLookupParameter<IntValue> MigrationIntervalParameter {
|
|---|
| 56 | get { return (ValueLookupParameter<IntValue>)Parameters["MigrationInterval"]; }
|
|---|
| 57 | }
|
|---|
| 58 | public ValueLookupParameter<PercentValue> MigrationRateParameter {
|
|---|
| 59 | get { return (ValueLookupParameter<PercentValue>)Parameters["MigrationRate"]; }
|
|---|
| 60 | }
|
|---|
| 61 | public ValueLookupParameter<IOperator> MigratorParameter {
|
|---|
| 62 | get { return (ValueLookupParameter<IOperator>)Parameters["Migrator"]; }
|
|---|
| 63 | }
|
|---|
| 64 | public ValueLookupParameter<IOperator> EmigrantsSelectorParameter {
|
|---|
| 65 | get { return (ValueLookupParameter<IOperator>)Parameters["EmigrantsSelector"]; }
|
|---|
| 66 | }
|
|---|
| 67 | public ValueLookupParameter<IOperator> ImmigrationReplacerParameter {
|
|---|
| 68 | get { return (ValueLookupParameter<IOperator>)Parameters["ImmigrationReplacer"]; }
|
|---|
| 69 | }
|
|---|
| 70 | public ValueLookupParameter<IntValue> PopulationSizeParameter {
|
|---|
| 71 | get { return (ValueLookupParameter<IntValue>)Parameters["PopulationSize"]; }
|
|---|
| 72 | }
|
|---|
| 73 | public ValueLookupParameter<IntValue> MaximumGenerationsParameter {
|
|---|
| 74 | get { return (ValueLookupParameter<IntValue>)Parameters["MaximumGenerations"]; }
|
|---|
| 75 | }
|
|---|
| 76 | public ValueLookupParameter<IOperator> SelectorParameter {
|
|---|
| 77 | get { return (ValueLookupParameter<IOperator>)Parameters["Selector"]; }
|
|---|
| 78 | }
|
|---|
| 79 | public ValueLookupParameter<IOperator> CrossoverParameter {
|
|---|
| 80 | get { return (ValueLookupParameter<IOperator>)Parameters["Crossover"]; }
|
|---|
| 81 | }
|
|---|
| 82 | public ValueLookupParameter<PercentValue> MutationProbabilityParameter {
|
|---|
| 83 | get { return (ValueLookupParameter<PercentValue>)Parameters["MutationProbability"]; }
|
|---|
| 84 | }
|
|---|
| 85 | public ValueLookupParameter<IOperator> MutatorParameter {
|
|---|
| 86 | get { return (ValueLookupParameter<IOperator>)Parameters["Mutator"]; }
|
|---|
| 87 | }
|
|---|
| 88 | public ValueLookupParameter<IOperator> EvaluatorParameter {
|
|---|
| 89 | get { return (ValueLookupParameter<IOperator>)Parameters["Evaluator"]; }
|
|---|
| 90 | }
|
|---|
| 91 | public ValueLookupParameter<IntValue> ElitesParameter {
|
|---|
| 92 | get { return (ValueLookupParameter<IntValue>)Parameters["Elites"]; }
|
|---|
| 93 | }
|
|---|
| 94 | public ValueLookupParameter<ResultCollection> ResultsParameter {
|
|---|
| 95 | get { return (ValueLookupParameter<ResultCollection>)Parameters["Results"]; }
|
|---|
| 96 | }
|
|---|
| 97 | public ValueLookupParameter<IOperator> AnalyzerParameter {
|
|---|
| 98 | get { return (ValueLookupParameter<IOperator>)Parameters["Analyzer"]; }
|
|---|
| 99 | }
|
|---|
| 100 | public ValueLookupParameter<IOperator> IslandAnalyzerParameter {
|
|---|
| 101 | get { return (ValueLookupParameter<IOperator>)Parameters["IslandAnalyzer"]; }
|
|---|
| 102 | }
|
|---|
| 103 | public LookupParameter<IntValue> EvaluatedSolutionsParameter {
|
|---|
| 104 | get { return (LookupParameter<IntValue>)Parameters["EvaluatedSolutions"]; }
|
|---|
| 105 | }
|
|---|
| 106 | public LookupParameter<IntValue> IslandGenerations {
|
|---|
| 107 | get { return (LookupParameter<IntValue>)Parameters["IslandGenerations"]; }
|
|---|
| 108 | }
|
|---|
| 109 | public LookupParameter<IntValue> IslandEvaluatedSolutions {
|
|---|
| 110 | get { return (LookupParameter<IntValue>)Parameters["IslandEvaluatedSolutions"]; }
|
|---|
| 111 | }
|
|---|
| 112 | public ValueLookupParameter<BoolValue> Migrate {
|
|---|
| 113 | get { return (ValueLookupParameter<BoolValue>)Parameters["Migrate"]; }
|
|---|
| 114 | }
|
|---|
| 115 | #endregion
|
|---|
| 116 |
|
|---|
| 117 | [StorableConstructor]
|
|---|
| 118 | private ParallelIslandGeneticAlgorithmMainLoop(bool deserializing) : base(deserializing) { }
|
|---|
| 119 | private ParallelIslandGeneticAlgorithmMainLoop(ParallelIslandGeneticAlgorithmMainLoop original, Cloner cloner)
|
|---|
| 120 | : base(original, cloner) {
|
|---|
| 121 | }
|
|---|
| 122 | public override IDeepCloneable Clone(Cloner cloner) {
|
|---|
| 123 | return new ParallelIslandGeneticAlgorithmMainLoop(this, cloner);
|
|---|
| 124 | }
|
|---|
| 125 | public ParallelIslandGeneticAlgorithmMainLoop()
|
|---|
| 126 | : base() {
|
|---|
| 127 | #region Create parameters
|
|---|
| 128 | Parameters.Add(new ValueLookupParameter<IRandom>("Random", "A pseudo random number generator."));
|
|---|
| 129 | Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
|
|---|
| 130 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The value which represents the quality of a solution."));
|
|---|
| 131 | Parameters.Add(new ValueLookupParameter<DoubleValue>("BestKnownQuality", "The best known quality value found so far."));
|
|---|
| 132 | Parameters.Add(new ValueLookupParameter<IntValue>("NumberOfIslands", "The number of islands."));
|
|---|
| 133 | Parameters.Add(new ValueLookupParameter<IntValue>("MigrationInterval", "The number of generations that should pass between migration phases."));
|
|---|
| 134 | Parameters.Add(new ValueLookupParameter<PercentValue>("MigrationRate", "The proportion of individuals that should migrate between the islands."));
|
|---|
| 135 | Parameters.Add(new ValueLookupParameter<IOperator>("Migrator", "The migration strategy."));
|
|---|
| 136 | Parameters.Add(new ValueLookupParameter<IOperator>("EmigrantsSelector", "Selects the individuals that will be migrated."));
|
|---|
| 137 | Parameters.Add(new ValueLookupParameter<IOperator>("ImmigrationReplacer", "Replaces some of the original population with the immigrants."));
|
|---|
| 138 | Parameters.Add(new ValueLookupParameter<IntValue>("PopulationSize", "The size of the population of solutions."));
|
|---|
| 139 | Parameters.Add(new ValueLookupParameter<IntValue>("MaximumGenerations", "The maximum number of generations that the algorithm should process."));
|
|---|
| 140 | Parameters.Add(new ValueLookupParameter<IOperator>("Selector", "The operator used to select solutions for reproduction."));
|
|---|
| 141 | Parameters.Add(new ValueLookupParameter<IOperator>("Crossover", "The operator used to cross solutions."));
|
|---|
| 142 | Parameters.Add(new ValueLookupParameter<PercentValue>("MutationProbability", "The probability that the mutation operator is applied on a solution."));
|
|---|
| 143 | Parameters.Add(new ValueLookupParameter<IOperator>("Mutator", "The operator used to mutate solutions."));
|
|---|
| 144 | 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."));
|
|---|
| 145 | Parameters.Add(new ValueLookupParameter<IntValue>("Elites", "The numer of elite solutions which are kept in each generation."));
|
|---|
| 146 | Parameters.Add(new ValueLookupParameter<ResultCollection>("Results", "The results collection to store the results."));
|
|---|
| 147 | Parameters.Add(new ValueLookupParameter<IOperator>("Analyzer", "The operator used to the analyze the islands."));
|
|---|
| 148 | Parameters.Add(new ValueLookupParameter<IOperator>("IslandAnalyzer", "The operator used to analyze each island."));
|
|---|
| 149 | Parameters.Add(new LookupParameter<IntValue>("EvaluatedSolutions", "The number of times a solution has been evaluated."));
|
|---|
| 150 | Parameters.Add(new LookupParameter<IntValue>("IslandGenerations", "The number of generations calculated on one island."));
|
|---|
| 151 | Parameters.Add(new LookupParameter<IntValue>("IslandEvaluatedSolutions", "The number of times a solution has been evaluated on one island."));
|
|---|
| 152 | Parameters.Add(new ValueLookupParameter<BoolValue>("Migrate", "Migrate the island?"));
|
|---|
| 153 | #endregion
|
|---|
| 154 |
|
|---|
| 155 | #region Create operators
|
|---|
| 156 | VariableCreator variableCreator = new VariableCreator();
|
|---|
| 157 | UniformSubScopesProcessor uniformSubScopesProcessor0 = new UniformSubScopesProcessor();
|
|---|
| 158 | VariableCreator islandVariableCreator = new VariableCreator();
|
|---|
| 159 | Placeholder islandAnalyzer1 = new Placeholder();
|
|---|
| 160 | Placeholder analyzer1 = new Placeholder();
|
|---|
| 161 | ResultsCollector resultsCollector1 = new ResultsCollector();
|
|---|
| 162 | UniformSubScopesProcessor uniformSubScopesProcessor1 = new UniformSubScopesProcessor();
|
|---|
| 163 | Assigner generationsAssigner = new Assigner();
|
|---|
| 164 | Assigner evaluatedSolutionsAssigner = new Assigner();
|
|---|
| 165 | Placeholder selector = new Placeholder();
|
|---|
| 166 | SubScopesProcessor subScopesProcessor1 = new SubScopesProcessor();
|
|---|
| 167 | ChildrenCreator childrenCreator = new ChildrenCreator();
|
|---|
| 168 | UniformSubScopesProcessor uniformSubScopesProcessor2 = new UniformSubScopesProcessor();
|
|---|
| 169 | Placeholder crossover = new Placeholder();
|
|---|
| 170 | StochasticBranch stochasticBranch = new StochasticBranch();
|
|---|
| 171 | Placeholder mutator = new Placeholder();
|
|---|
| 172 | SubScopesRemover subScopesRemover = new SubScopesRemover();
|
|---|
| 173 | UniformSubScopesProcessor uniformSubScopesProcessor3 = new UniformSubScopesProcessor();
|
|---|
| 174 | Placeholder evaluator = new Placeholder();
|
|---|
| 175 | SubScopesCounter subScopesCounter = new SubScopesCounter();
|
|---|
| 176 | SubScopesProcessor subScopesProcessor2 = new SubScopesProcessor();
|
|---|
| 177 | BestSelector bestSelector = new BestSelector();
|
|---|
| 178 | RightReducer rightReducer = new RightReducer();
|
|---|
| 179 | MergingReducer mergingReducer = new MergingReducer();
|
|---|
| 180 | IntCounter islandGenerationsCounter = new IntCounter();
|
|---|
| 181 | Comparator checkIslandGenerationsReachedMaximum = new Comparator();
|
|---|
| 182 | ConditionalBranch checkContinueEvolution = new ConditionalBranch();
|
|---|
| 183 | SubScopesIntReducer generationsReducer = new SubScopesIntReducer();
|
|---|
| 184 | AllSubScopesIntReducer evaluatedSolutionsReducer = new AllSubScopesIntReducer();
|
|---|
| 185 | UniformSubScopesProcessor uniformSubScopesProcessor4 = new UniformSubScopesProcessor();
|
|---|
| 186 | Placeholder islandAnalyzer2 = new Placeholder();
|
|---|
| 187 | UniformSubScopesProcessor uniformSubScopesProcessor5 = new UniformSubScopesProcessor();
|
|---|
| 188 | Placeholder emigrantsSelector = new Placeholder();
|
|---|
| 189 | Placeholder migrator = new Placeholder();
|
|---|
| 190 | UniformSubScopesProcessor uniformSubScopesProcessor6 = new UniformSubScopesProcessor();
|
|---|
| 191 | Placeholder immigrationReplacer = new Placeholder();
|
|---|
| 192 | Comparator generationsComparator = new Comparator();
|
|---|
| 193 | Placeholder analyzer2 = new Placeholder();
|
|---|
| 194 | ConditionalBranch generationsTerminationCondition = new ConditionalBranch();
|
|---|
| 195 |
|
|---|
| 196 |
|
|---|
| 197 | variableCreator.CollectedValues.Add(new ValueParameter<IntValue>("Migrations", new IntValue(0)));
|
|---|
| 198 | variableCreator.CollectedValues.Add(new ValueParameter<IntValue>("GenerationsSinceLastMigration", new IntValue(0)));
|
|---|
| 199 | variableCreator.CollectedValues.Add(new ValueParameter<IntValue>("Generations", new IntValue(0))); // Class IslandGeneticAlgorithm expects this to be called Generations
|
|---|
| 200 |
|
|---|
| 201 | islandVariableCreator.CollectedValues.Add(new ValueParameter<ResultCollection>("Results", new ResultCollection()));
|
|---|
| 202 | islandVariableCreator.CollectedValues.Add(new ValueParameter<IntValue>("IslandGenerations", new IntValue(0)));
|
|---|
| 203 | islandVariableCreator.CollectedValues.Add(new ValueParameter<IntValue>("IslandEvaluatedSolutions", new IntValue(0)));
|
|---|
| 204 |
|
|---|
| 205 | islandAnalyzer1.Name = "Island Analyzer (placeholder)";
|
|---|
| 206 | islandAnalyzer1.OperatorParameter.ActualName = IslandAnalyzerParameter.Name;
|
|---|
| 207 |
|
|---|
| 208 | analyzer1.Name = "Analyzer (placeholder)";
|
|---|
| 209 | analyzer1.OperatorParameter.ActualName = AnalyzerParameter.Name;
|
|---|
| 210 |
|
|---|
| 211 | resultsCollector1.CollectedValues.Add(new LookupParameter<IntValue>("Migrations"));
|
|---|
| 212 | resultsCollector1.CollectedValues.Add(new LookupParameter<IntValue>("Generations"));
|
|---|
| 213 | resultsCollector1.CollectedValues.Add(new ScopeTreeLookupParameter<ResultCollection>("IslandResults", "Result set for each island", "Results"));
|
|---|
| 214 | resultsCollector1.ResultsParameter.ActualName = ResultsParameter.Name;
|
|---|
| 215 |
|
|---|
| 216 | uniformSubScopesProcessor1.Parallel.Value = true;
|
|---|
| 217 |
|
|---|
| 218 | generationsAssigner.Name = "Initialize Island Generations";
|
|---|
| 219 | generationsAssigner.LeftSideParameter.ActualName = IslandGenerations.Name;
|
|---|
| 220 | generationsAssigner.RightSideParameter.Value = new IntValue(0);
|
|---|
| 221 |
|
|---|
| 222 | evaluatedSolutionsAssigner.Name = "Initialize Island evaluated solutions";
|
|---|
| 223 | evaluatedSolutionsAssigner.LeftSideParameter.ActualName = IslandEvaluatedSolutions.Name;
|
|---|
| 224 | evaluatedSolutionsAssigner.RightSideParameter.Value = new IntValue(0);
|
|---|
| 225 |
|
|---|
| 226 | selector.Name = "Selector (placeholder)";
|
|---|
| 227 | selector.OperatorParameter.ActualName = SelectorParameter.Name;
|
|---|
| 228 |
|
|---|
| 229 | childrenCreator.ParentsPerChild = new IntValue(2);
|
|---|
| 230 |
|
|---|
| 231 | crossover.Name = "Crossover (placeholder)";
|
|---|
| 232 | crossover.OperatorParameter.ActualName = CrossoverParameter.Name;
|
|---|
| 233 |
|
|---|
| 234 | stochasticBranch.ProbabilityParameter.ActualName = MutationProbabilityParameter.Name;
|
|---|
| 235 | stochasticBranch.RandomParameter.ActualName = RandomParameter.Name;
|
|---|
| 236 |
|
|---|
| 237 | mutator.Name = "Mutator (placeholder)";
|
|---|
| 238 | mutator.OperatorParameter.ActualName = MutatorParameter.Name;
|
|---|
| 239 |
|
|---|
| 240 | subScopesRemover.RemoveAllSubScopes = true;
|
|---|
| 241 |
|
|---|
| 242 | uniformSubScopesProcessor3.Parallel.Value = true;
|
|---|
| 243 |
|
|---|
| 244 | evaluator.Name = "Evaluator (placeholder)";
|
|---|
| 245 | evaluator.OperatorParameter.ActualName = EvaluatorParameter.Name;
|
|---|
| 246 |
|
|---|
| 247 | subScopesCounter.Name = "Increment EvaluatedSolutions";
|
|---|
| 248 | subScopesCounter.ValueParameter.ActualName = IslandEvaluatedSolutions.Name;
|
|---|
| 249 |
|
|---|
| 250 | bestSelector.CopySelected = new BoolValue(false);
|
|---|
| 251 | bestSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
|
|---|
| 252 | bestSelector.NumberOfSelectedSubScopesParameter.ActualName = ElitesParameter.Name;
|
|---|
| 253 | bestSelector.QualityParameter.ActualName = QualityParameter.Name;
|
|---|
| 254 |
|
|---|
| 255 | islandGenerationsCounter.Name = "Increment island generatrions";
|
|---|
| 256 | islandGenerationsCounter.ValueParameter.ActualName = IslandGenerations.Name;
|
|---|
| 257 | islandGenerationsCounter.Increment = new IntValue(1);
|
|---|
| 258 |
|
|---|
| 259 | checkIslandGenerationsReachedMaximum.LeftSideParameter.ActualName = IslandGenerations.Name;
|
|---|
| 260 | checkIslandGenerationsReachedMaximum.RightSideParameter.ActualName = MigrationIntervalParameter.Name;
|
|---|
| 261 | checkIslandGenerationsReachedMaximum.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
|
|---|
| 262 | checkIslandGenerationsReachedMaximum.ResultParameter.ActualName = Migrate.Name;
|
|---|
| 263 |
|
|---|
| 264 | checkContinueEvolution.Name = "Migrate?";
|
|---|
| 265 | checkContinueEvolution.ConditionParameter.ActualName = Migrate.Name;
|
|---|
| 266 | checkContinueEvolution.FalseBranch = selector;
|
|---|
| 267 |
|
|---|
| 268 | islandAnalyzer2.Name = "Island Analyzer (placeholder)";
|
|---|
| 269 | islandAnalyzer2.OperatorParameter.ActualName = IslandAnalyzerParameter.Name;
|
|---|
| 270 |
|
|---|
| 271 | generationsReducer.Name = "Increment Generations";
|
|---|
| 272 | generationsReducer.ParameterToReduce.Value = new StringValue(islandGenerationsCounter.ValueParameter.ActualName);
|
|---|
| 273 | generationsReducer.TargetParameterName.Value = new StringValue("Generations"); //TODO: fixme
|
|---|
| 274 |
|
|---|
| 275 | evaluatedSolutionsReducer.Name = "Increment Evaluated Solutions";
|
|---|
| 276 | evaluatedSolutionsReducer.ParameterToReduce.Value = new StringValue(IslandEvaluatedSolutions.Name);
|
|---|
| 277 | evaluatedSolutionsReducer.TargetParameterName.Value = new StringValue(EvaluatedSolutionsParameter.Name);
|
|---|
| 278 |
|
|---|
| 279 | emigrantsSelector.Name = "Emigrants Selector (placeholder)";
|
|---|
| 280 | emigrantsSelector.OperatorParameter.ActualName = EmigrantsSelectorParameter.Name;
|
|---|
| 281 |
|
|---|
| 282 | migrator.Name = "Migrator (placeholder)";
|
|---|
| 283 | migrator.OperatorParameter.ActualName = MigratorParameter.Name;
|
|---|
| 284 |
|
|---|
| 285 | immigrationReplacer.Name = "Immigration Replacer (placeholder)";
|
|---|
| 286 | immigrationReplacer.OperatorParameter.ActualName = ImmigrationReplacerParameter.Name;
|
|---|
| 287 |
|
|---|
| 288 | generationsComparator.Name = "Generations >= MaximumGenerations ?";
|
|---|
| 289 | generationsComparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
|
|---|
| 290 | generationsComparator.LeftSideParameter.ActualName = "Generations";
|
|---|
| 291 | generationsComparator.ResultParameter.ActualName = "TerminateGenerations";
|
|---|
| 292 | generationsComparator.RightSideParameter.ActualName = MaximumGenerationsParameter.Name;
|
|---|
| 293 |
|
|---|
| 294 | analyzer2.Name = "Analyzer (placeholder)";
|
|---|
| 295 | analyzer2.OperatorParameter.ActualName = AnalyzerParameter.Name;
|
|---|
| 296 |
|
|---|
| 297 | generationsTerminationCondition.Name = "Terminate?";
|
|---|
| 298 | generationsTerminationCondition.ConditionParameter.ActualName = "TerminateGenerations";
|
|---|
| 299 | #endregion
|
|---|
| 300 |
|
|---|
| 301 | #region Create operator graph
|
|---|
| 302 | OperatorGraph.InitialOperator = variableCreator;
|
|---|
| 303 | variableCreator.Successor = uniformSubScopesProcessor0;
|
|---|
| 304 | uniformSubScopesProcessor0.Operator = islandVariableCreator;
|
|---|
| 305 | uniformSubScopesProcessor0.Successor = analyzer1;
|
|---|
| 306 | islandVariableCreator.Successor = islandAnalyzer1;
|
|---|
| 307 | islandAnalyzer1.Successor = null;
|
|---|
| 308 | analyzer1.Successor = resultsCollector1;
|
|---|
| 309 | resultsCollector1.Successor = uniformSubScopesProcessor1;
|
|---|
| 310 | uniformSubScopesProcessor1.Operator = generationsAssigner;
|
|---|
| 311 | uniformSubScopesProcessor1.Successor = generationsReducer;
|
|---|
| 312 | generationsReducer.Successor = evaluatedSolutionsReducer;
|
|---|
| 313 | generationsAssigner.Successor = evaluatedSolutionsAssigner;
|
|---|
| 314 | evaluatedSolutionsAssigner.Successor = selector;
|
|---|
| 315 | selector.Successor = subScopesProcessor1;
|
|---|
| 316 | subScopesProcessor1.Operators.Add(new EmptyOperator());
|
|---|
| 317 | subScopesProcessor1.Operators.Add(childrenCreator);
|
|---|
| 318 | subScopesProcessor1.Successor = subScopesProcessor2;
|
|---|
| 319 | childrenCreator.Successor = uniformSubScopesProcessor2;
|
|---|
| 320 | uniformSubScopesProcessor2.Operator = crossover;
|
|---|
| 321 | uniformSubScopesProcessor2.Successor = uniformSubScopesProcessor3;
|
|---|
| 322 | crossover.Successor = stochasticBranch;
|
|---|
| 323 | stochasticBranch.FirstBranch = mutator;
|
|---|
| 324 | stochasticBranch.SecondBranch = null;
|
|---|
| 325 | stochasticBranch.Successor = subScopesRemover;
|
|---|
| 326 | mutator.Successor = null;
|
|---|
| 327 | subScopesRemover.Successor = null;
|
|---|
| 328 | uniformSubScopesProcessor3.Operator = evaluator;
|
|---|
| 329 | uniformSubScopesProcessor3.Successor = subScopesCounter;
|
|---|
| 330 | evaluator.Successor = null;
|
|---|
| 331 | subScopesCounter.Successor = null;
|
|---|
| 332 | subScopesCounter.Successor = null;
|
|---|
| 333 | subScopesProcessor2.Operators.Add(bestSelector);
|
|---|
| 334 | subScopesProcessor2.Operators.Add(new EmptyOperator());
|
|---|
| 335 | subScopesProcessor2.Successor = mergingReducer;
|
|---|
| 336 | mergingReducer.Successor = null;
|
|---|
| 337 | bestSelector.Successor = rightReducer;
|
|---|
| 338 | rightReducer.Successor = islandGenerationsCounter;
|
|---|
| 339 | islandGenerationsCounter.Successor = checkIslandGenerationsReachedMaximum;
|
|---|
| 340 | checkIslandGenerationsReachedMaximum.Successor = checkContinueEvolution;
|
|---|
| 341 | evaluatedSolutionsReducer.Successor = uniformSubScopesProcessor4;
|
|---|
| 342 | uniformSubScopesProcessor4.Operator = islandAnalyzer2;
|
|---|
| 343 | uniformSubScopesProcessor4.Successor = uniformSubScopesProcessor5;
|
|---|
| 344 | islandAnalyzer2.Successor = null;
|
|---|
| 345 | uniformSubScopesProcessor5.Operator = emigrantsSelector;
|
|---|
| 346 | uniformSubScopesProcessor5.Successor = migrator;
|
|---|
| 347 | migrator.Successor = uniformSubScopesProcessor6;
|
|---|
| 348 | uniformSubScopesProcessor6.Operator = immigrationReplacer;
|
|---|
| 349 | uniformSubScopesProcessor6.Successor = generationsComparator;
|
|---|
| 350 | generationsComparator.Successor = analyzer2;
|
|---|
| 351 | analyzer2.Successor = generationsTerminationCondition;
|
|---|
| 352 | generationsTerminationCondition.TrueBranch = null;
|
|---|
| 353 | generationsTerminationCondition.FalseBranch = uniformSubScopesProcessor1;
|
|---|
| 354 | generationsTerminationCondition.Successor = null;
|
|---|
| 355 | #endregion
|
|---|
| 356 | }
|
|---|
| 357 |
|
|---|
| 358 | public override IOperation Apply() {
|
|---|
| 359 | if (CrossoverParameter.ActualValue == null)
|
|---|
| 360 | return null;
|
|---|
| 361 | return base.Apply();
|
|---|
| 362 | }
|
|---|
| 363 | }
|
|---|
| 364 | }
|
|---|
