[3611] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[7259] | 3 | * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3611] | 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 |
|
---|
[4722] | 22 | using HeuristicLab.Common;
|
---|
[3611] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Operators;
|
---|
| 26 | using HeuristicLab.Optimization.Operators;
|
---|
| 27 | using HeuristicLab.Parameters;
|
---|
| 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 29 | using HeuristicLab.Selection;
|
---|
| 30 |
|
---|
| 31 | namespace HeuristicLab.Algorithms.OffspringSelectionGeneticAlgorithm {
|
---|
| 32 | /// <summary>
|
---|
| 33 | /// An operator which represents the main loop of an offspring selection genetic algorithm.
|
---|
| 34 | /// </summary>
|
---|
| 35 | [Item("OffspringSelectionGeneticAlgorithmMainOperator", "An operator that represents the core of an offspring selection genetic algorithm.")]
|
---|
| 36 | [StorableClass]
|
---|
| 37 | public sealed class OffspringSelectionGeneticAlgorithmMainOperator : AlgorithmOperator {
|
---|
| 38 | #region Parameter properties
|
---|
| 39 | public ValueLookupParameter<IRandom> RandomParameter {
|
---|
| 40 | get { return (ValueLookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 41 | }
|
---|
| 42 | public ValueLookupParameter<BoolValue> MaximizationParameter {
|
---|
| 43 | get { return (ValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
|
---|
| 44 | }
|
---|
[3659] | 45 | public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
|
---|
| 46 | get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
|
---|
[3611] | 47 | }
|
---|
| 48 | public ValueLookupParameter<IOperator> SelectorParameter {
|
---|
| 49 | get { return (ValueLookupParameter<IOperator>)Parameters["Selector"]; }
|
---|
| 50 | }
|
---|
| 51 | public ValueLookupParameter<IOperator> CrossoverParameter {
|
---|
| 52 | get { return (ValueLookupParameter<IOperator>)Parameters["Crossover"]; }
|
---|
| 53 | }
|
---|
| 54 | public ValueLookupParameter<PercentValue> MutationProbabilityParameter {
|
---|
| 55 | get { return (ValueLookupParameter<PercentValue>)Parameters["MutationProbability"]; }
|
---|
| 56 | }
|
---|
| 57 | public ValueLookupParameter<IOperator> MutatorParameter {
|
---|
| 58 | get { return (ValueLookupParameter<IOperator>)Parameters["Mutator"]; }
|
---|
| 59 | }
|
---|
| 60 | public ValueLookupParameter<IOperator> EvaluatorParameter {
|
---|
| 61 | get { return (ValueLookupParameter<IOperator>)Parameters["Evaluator"]; }
|
---|
| 62 | }
|
---|
| 63 | public LookupParameter<IntValue> EvaluatedSolutionsParameter {
|
---|
| 64 | get { return (LookupParameter<IntValue>)Parameters["EvaluatedSolutions"]; }
|
---|
| 65 | }
|
---|
| 66 | public ValueLookupParameter<IntValue> ElitesParameter {
|
---|
| 67 | get { return (ValueLookupParameter<IntValue>)Parameters["Elites"]; }
|
---|
| 68 | }
|
---|
| 69 | public LookupParameter<DoubleValue> ComparisonFactorParameter {
|
---|
| 70 | get { return (LookupParameter<DoubleValue>)Parameters["ComparisonFactor"]; }
|
---|
| 71 | }
|
---|
| 72 | public LookupParameter<DoubleValue> CurrentSuccessRatioParameter {
|
---|
| 73 | get { return (LookupParameter<DoubleValue>)Parameters["CurrentSuccessRatio"]; }
|
---|
| 74 | }
|
---|
| 75 | public ValueLookupParameter<DoubleValue> SuccessRatioParameter {
|
---|
| 76 | get { return (ValueLookupParameter<DoubleValue>)Parameters["SuccessRatio"]; }
|
---|
| 77 | }
|
---|
| 78 | public LookupParameter<DoubleValue> SelectionPressureParameter {
|
---|
| 79 | get { return (LookupParameter<DoubleValue>)Parameters["SelectionPressure"]; }
|
---|
| 80 | }
|
---|
| 81 | public ValueLookupParameter<DoubleValue> MaximumSelectionPressureParameter {
|
---|
| 82 | get { return (ValueLookupParameter<DoubleValue>)Parameters["MaximumSelectionPressure"]; }
|
---|
| 83 | }
|
---|
| 84 | public ValueLookupParameter<BoolValue> OffspringSelectionBeforeMutationParameter {
|
---|
| 85 | get { return (ValueLookupParameter<BoolValue>)Parameters["OffspringSelectionBeforeMutation"]; }
|
---|
| 86 | }
|
---|
| 87 | #endregion
|
---|
| 88 |
|
---|
| 89 | [StorableConstructor]
|
---|
[4722] | 90 | private OffspringSelectionGeneticAlgorithmMainOperator(bool deserializing) : base(deserializing) { }
|
---|
| 91 | private OffspringSelectionGeneticAlgorithmMainOperator(OffspringSelectionGeneticAlgorithmMainOperator original, Cloner cloner)
|
---|
| 92 | : base(original, cloner) {
|
---|
| 93 | }
|
---|
| 94 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 95 | return new OffspringSelectionGeneticAlgorithmMainOperator(this, cloner);
|
---|
| 96 | }
|
---|
[3611] | 97 | public OffspringSelectionGeneticAlgorithmMainOperator()
|
---|
| 98 | : base() {
|
---|
| 99 | Initialize();
|
---|
| 100 | }
|
---|
| 101 |
|
---|
| 102 | private void Initialize() {
|
---|
| 103 | #region Create parameters
|
---|
| 104 | Parameters.Add(new ValueLookupParameter<IRandom>("Random", "A pseudo random number generator."));
|
---|
| 105 | Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
|
---|
[3659] | 106 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The value which represents the quality of a solution."));
|
---|
[3611] | 107 | Parameters.Add(new ValueLookupParameter<IOperator>("Selector", "The operator used to select solutions for reproduction."));
|
---|
| 108 | Parameters.Add(new ValueLookupParameter<IOperator>("Crossover", "The operator used to cross solutions."));
|
---|
| 109 | Parameters.Add(new ValueLookupParameter<PercentValue>("MutationProbability", "The probability that the mutation operator is applied on a solution."));
|
---|
| 110 | Parameters.Add(new ValueLookupParameter<IOperator>("Mutator", "The operator used to mutate solutions."));
|
---|
[5208] | 111 | 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."));
|
---|
[3611] | 112 | Parameters.Add(new LookupParameter<IntValue>("EvaluatedSolutions", "The number of evaluated solutions."));
|
---|
| 113 | Parameters.Add(new ValueLookupParameter<IntValue>("Elites", "The numer of elite solutions which are kept in each generation."));
|
---|
| 114 | 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]."));
|
---|
| 115 | Parameters.Add(new LookupParameter<DoubleValue>("CurrentSuccessRatio", "The current success ratio."));
|
---|
| 116 | Parameters.Add(new ValueLookupParameter<DoubleValue>("SuccessRatio", "The ratio of successful to total children that should be achieved."));
|
---|
| 117 | Parameters.Add(new LookupParameter<DoubleValue>("SelectionPressure", "The actual selection pressure."));
|
---|
| 118 | Parameters.Add(new ValueLookupParameter<DoubleValue>("MaximumSelectionPressure", "The maximum selection pressure that terminates the algorithm."));
|
---|
| 119 | 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."));
|
---|
| 120 | #endregion
|
---|
| 121 |
|
---|
| 122 | #region Create operators
|
---|
| 123 | Placeholder selector = new Placeholder();
|
---|
| 124 | SubScopesProcessor subScopesProcessor1 = new SubScopesProcessor();
|
---|
| 125 | ChildrenCreator childrenCreator = new ChildrenCreator();
|
---|
| 126 | ConditionalBranch osBeforeMutationBranch = new ConditionalBranch();
|
---|
[5208] | 127 | UniformSubScopesProcessor uniformSubScopesProcessor1 = new UniformSubScopesProcessor();
|
---|
| 128 | Placeholder crossover1 = new Placeholder();
|
---|
| 129 | UniformSubScopesProcessor uniformSubScopesProcessor2 = new UniformSubScopesProcessor();
|
---|
[3611] | 130 | Placeholder evaluator1 = new Placeholder();
|
---|
[5356] | 131 | SubScopesCounter subScopesCounter1 = new SubScopesCounter();
|
---|
[3611] | 132 | WeightedParentsQualityComparator qualityComparer1 = new WeightedParentsQualityComparator();
|
---|
[5208] | 133 | SubScopesRemover subScopesRemover1 = new SubScopesRemover();
|
---|
| 134 | UniformSubScopesProcessor uniformSubScopesProcessor3 = new UniformSubScopesProcessor();
|
---|
[3611] | 135 | StochasticBranch mutationBranch1 = new StochasticBranch();
|
---|
| 136 | Placeholder mutator1 = new Placeholder();
|
---|
[5208] | 137 | VariableCreator variableCreator1 = new VariableCreator();
|
---|
| 138 | VariableCreator variableCreator2 = new VariableCreator();
|
---|
| 139 | ConditionalSelector conditionalSelector = new ConditionalSelector();
|
---|
| 140 | SubScopesProcessor subScopesProcessor2 = new SubScopesProcessor();
|
---|
| 141 | UniformSubScopesProcessor uniformSubScopesProcessor4 = new UniformSubScopesProcessor();
|
---|
[3611] | 142 | Placeholder evaluator2 = new Placeholder();
|
---|
[5356] | 143 | SubScopesCounter subScopesCounter2 = new SubScopesCounter();
|
---|
[5208] | 144 | MergingReducer mergingReducer1 = new MergingReducer();
|
---|
| 145 | UniformSubScopesProcessor uniformSubScopesProcessor5 = new UniformSubScopesProcessor();
|
---|
| 146 | Placeholder crossover2 = new Placeholder();
|
---|
[3611] | 147 | StochasticBranch mutationBranch2 = new StochasticBranch();
|
---|
| 148 | Placeholder mutator2 = new Placeholder();
|
---|
[5208] | 149 | UniformSubScopesProcessor uniformSubScopesProcessor6 = new UniformSubScopesProcessor();
|
---|
[3611] | 150 | Placeholder evaluator3 = new Placeholder();
|
---|
[5356] | 151 | SubScopesCounter subScopesCounter3 = new SubScopesCounter();
|
---|
[3611] | 152 | WeightedParentsQualityComparator qualityComparer2 = new WeightedParentsQualityComparator();
|
---|
[5208] | 153 | SubScopesRemover subScopesRemover2 = new SubScopesRemover();
|
---|
[3611] | 154 | OffspringSelector offspringSelector = new OffspringSelector();
|
---|
[5208] | 155 | SubScopesProcessor subScopesProcessor3 = new SubScopesProcessor();
|
---|
[3713] | 156 | BestSelector bestSelector = new BestSelector();
|
---|
| 157 | WorstSelector worstSelector = new WorstSelector();
|
---|
[3611] | 158 | RightReducer rightReducer = new RightReducer();
|
---|
[3699] | 159 | LeftReducer leftReducer = new LeftReducer();
|
---|
[5208] | 160 | MergingReducer mergingReducer2 = new MergingReducer();
|
---|
[4068] | 161 |
|
---|
[3611] | 162 | selector.Name = "Selector (placeholder)";
|
---|
| 163 | selector.OperatorParameter.ActualName = SelectorParameter.Name;
|
---|
| 164 |
|
---|
| 165 | childrenCreator.ParentsPerChild = new IntValue(2);
|
---|
| 166 |
|
---|
| 167 | osBeforeMutationBranch.Name = "Apply OS before mutation?";
|
---|
| 168 | osBeforeMutationBranch.ConditionParameter.ActualName = OffspringSelectionBeforeMutationParameter.Name;
|
---|
| 169 |
|
---|
[5208] | 170 | crossover1.Name = "Crossover (placeholder)";
|
---|
| 171 | crossover1.OperatorParameter.ActualName = CrossoverParameter.Name;
|
---|
| 172 |
|
---|
| 173 | uniformSubScopesProcessor2.Parallel.Value = true;
|
---|
| 174 |
|
---|
[3611] | 175 | evaluator1.Name = "Evaluator (placeholder)";
|
---|
| 176 | evaluator1.OperatorParameter.ActualName = EvaluatorParameter.Name;
|
---|
| 177 |
|
---|
[5356] | 178 | subScopesCounter1.Name = "Increment EvaluatedSolutions";
|
---|
| 179 | subScopesCounter1.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
|
---|
[3611] | 180 |
|
---|
| 181 | qualityComparer1.ComparisonFactorParameter.ActualName = ComparisonFactorParameter.Name;
|
---|
| 182 | qualityComparer1.LeftSideParameter.ActualName = QualityParameter.Name;
|
---|
| 183 | qualityComparer1.MaximizationParameter.ActualName = MaximizationParameter.Name;
|
---|
| 184 | qualityComparer1.RightSideParameter.ActualName = QualityParameter.Name;
|
---|
| 185 | qualityComparer1.ResultParameter.ActualName = "SuccessfulOffspring";
|
---|
| 186 |
|
---|
[5208] | 187 | subScopesRemover1.RemoveAllSubScopes = true;
|
---|
| 188 |
|
---|
[3611] | 189 | mutationBranch1.ProbabilityParameter.ActualName = MutationProbabilityParameter.Name;
|
---|
| 190 | mutationBranch1.RandomParameter.ActualName = RandomParameter.Name;
|
---|
| 191 |
|
---|
| 192 | mutator1.Name = "Mutator (placeholder)";
|
---|
| 193 | mutator1.OperatorParameter.ActualName = MutatorParameter.Name;
|
---|
| 194 |
|
---|
[5208] | 195 | variableCreator1.Name = "MutatedOffspring = true";
|
---|
| 196 | variableCreator1.CollectedValues.Add(new ValueParameter<BoolValue>("MutatedOffspring", null, new BoolValue(true), false));
|
---|
| 197 |
|
---|
| 198 | variableCreator2.Name = "MutatedOffspring = false";
|
---|
| 199 | variableCreator2.CollectedValues.Add(new ValueParameter<BoolValue>("MutatedOffspring", null, new BoolValue(false), false));
|
---|
| 200 |
|
---|
| 201 | conditionalSelector.ConditionParameter.ActualName = "MutatedOffspring";
|
---|
| 202 | conditionalSelector.ConditionParameter.Depth = 1;
|
---|
| 203 | conditionalSelector.CopySelected.Value = false;
|
---|
| 204 |
|
---|
| 205 | uniformSubScopesProcessor4.Parallel.Value = true;
|
---|
| 206 |
|
---|
[3611] | 207 | evaluator2.Name = "Evaluator (placeholder)";
|
---|
| 208 | evaluator2.OperatorParameter.ActualName = EvaluatorParameter.Name;
|
---|
| 209 |
|
---|
[5356] | 210 | subScopesCounter2.Name = "Increment EvaluatedSolutions";
|
---|
| 211 | subScopesCounter2.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
|
---|
[3611] | 212 |
|
---|
[5208] | 213 | crossover2.Name = "Crossover (placeholder)";
|
---|
| 214 | crossover2.OperatorParameter.ActualName = CrossoverParameter.Name;
|
---|
| 215 |
|
---|
[3611] | 216 | mutationBranch2.ProbabilityParameter.ActualName = MutationProbabilityParameter.Name;
|
---|
| 217 | mutationBranch2.RandomParameter.ActualName = RandomParameter.Name;
|
---|
| 218 |
|
---|
| 219 | mutator2.Name = "Mutator (placeholder)";
|
---|
| 220 | mutator2.OperatorParameter.ActualName = MutatorParameter.Name;
|
---|
| 221 |
|
---|
[5208] | 222 | uniformSubScopesProcessor6.Parallel.Value = true;
|
---|
| 223 |
|
---|
[3611] | 224 | evaluator3.Name = "Evaluator (placeholder)";
|
---|
| 225 | evaluator3.OperatorParameter.ActualName = EvaluatorParameter.Name;
|
---|
| 226 |
|
---|
[5356] | 227 | subScopesCounter3.Name = "Increment EvaluatedSolutions";
|
---|
| 228 | subScopesCounter3.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
|
---|
[3611] | 229 |
|
---|
| 230 | qualityComparer2.ComparisonFactorParameter.ActualName = ComparisonFactorParameter.Name;
|
---|
| 231 | qualityComparer2.LeftSideParameter.ActualName = QualityParameter.Name;
|
---|
| 232 | qualityComparer2.MaximizationParameter.ActualName = MaximizationParameter.Name;
|
---|
| 233 | qualityComparer2.RightSideParameter.ActualName = QualityParameter.Name;
|
---|
| 234 | qualityComparer2.ResultParameter.ActualName = "SuccessfulOffspring";
|
---|
| 235 |
|
---|
[5208] | 236 | subScopesRemover2.RemoveAllSubScopes = true;
|
---|
[3611] | 237 |
|
---|
| 238 | offspringSelector.CurrentSuccessRatioParameter.ActualName = CurrentSuccessRatioParameter.Name;
|
---|
| 239 | offspringSelector.MaximumSelectionPressureParameter.ActualName = MaximumSelectionPressureParameter.Name;
|
---|
| 240 | offspringSelector.SelectionPressureParameter.ActualName = SelectionPressureParameter.Name;
|
---|
| 241 | offspringSelector.SuccessRatioParameter.ActualName = SuccessRatioParameter.Name;
|
---|
[3740] | 242 | offspringSelector.OffspringPopulationParameter.ActualName = "OffspringPopulation";
|
---|
| 243 | offspringSelector.OffspringPopulationWinnersParameter.ActualName = "OffspringPopulationWinners";
|
---|
| 244 | offspringSelector.SuccessfulOffspringParameter.ActualName = "SuccessfulOffspring";
|
---|
[3611] | 245 |
|
---|
[3713] | 246 | bestSelector.CopySelected = new BoolValue(false);
|
---|
| 247 | bestSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
|
---|
| 248 | bestSelector.NumberOfSelectedSubScopesParameter.ActualName = ElitesParameter.Name;
|
---|
| 249 | bestSelector.QualityParameter.ActualName = QualityParameter.Name;
|
---|
[3699] | 250 |
|
---|
[3713] | 251 | worstSelector.CopySelected = new BoolValue(false);
|
---|
| 252 | worstSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
|
---|
| 253 | worstSelector.NumberOfSelectedSubScopesParameter.ActualName = ElitesParameter.Name;
|
---|
| 254 | worstSelector.QualityParameter.ActualName = QualityParameter.Name;
|
---|
[3611] | 255 | #endregion
|
---|
| 256 |
|
---|
| 257 | #region Create operator graph
|
---|
| 258 | OperatorGraph.InitialOperator = selector;
|
---|
| 259 | selector.Successor = subScopesProcessor1;
|
---|
| 260 | subScopesProcessor1.Operators.Add(new EmptyOperator());
|
---|
| 261 | subScopesProcessor1.Operators.Add(childrenCreator);
|
---|
| 262 | subScopesProcessor1.Successor = offspringSelector;
|
---|
[5208] | 263 | childrenCreator.Successor = osBeforeMutationBranch;
|
---|
| 264 | osBeforeMutationBranch.TrueBranch = uniformSubScopesProcessor1;
|
---|
| 265 | osBeforeMutationBranch.FalseBranch = uniformSubScopesProcessor5;
|
---|
| 266 | osBeforeMutationBranch.Successor = null;
|
---|
| 267 | uniformSubScopesProcessor1.Operator = crossover1;
|
---|
| 268 | uniformSubScopesProcessor1.Successor = uniformSubScopesProcessor2;
|
---|
| 269 | crossover1.Successor = null;
|
---|
| 270 | uniformSubScopesProcessor2.Operator = evaluator1;
|
---|
[5356] | 271 | uniformSubScopesProcessor2.Successor = subScopesCounter1;
|
---|
| 272 | evaluator1.Successor = qualityComparer1;
|
---|
[5208] | 273 | qualityComparer1.Successor = subScopesRemover1;
|
---|
| 274 | subScopesRemover1.Successor = null;
|
---|
[5356] | 275 | subScopesCounter1.Successor = uniformSubScopesProcessor3;
|
---|
[5208] | 276 | uniformSubScopesProcessor3.Operator = mutationBranch1;
|
---|
| 277 | uniformSubScopesProcessor3.Successor = conditionalSelector;
|
---|
[3611] | 278 | mutationBranch1.FirstBranch = mutator1;
|
---|
[5208] | 279 | mutationBranch1.SecondBranch = variableCreator2;
|
---|
[3611] | 280 | mutationBranch1.Successor = null;
|
---|
[5208] | 281 | mutator1.Successor = variableCreator1;
|
---|
| 282 | variableCreator1.Successor = null;
|
---|
| 283 | variableCreator2.Successor = null;
|
---|
| 284 | conditionalSelector.Successor = subScopesProcessor2;
|
---|
| 285 | subScopesProcessor2.Operators.Add(new EmptyOperator());
|
---|
| 286 | subScopesProcessor2.Operators.Add(uniformSubScopesProcessor4);
|
---|
| 287 | subScopesProcessor2.Successor = mergingReducer1;
|
---|
| 288 | uniformSubScopesProcessor4.Operator = evaluator2;
|
---|
[5356] | 289 | uniformSubScopesProcessor4.Successor = subScopesCounter2;
|
---|
| 290 | evaluator2.Successor = null;
|
---|
| 291 | subScopesCounter2.Successor = null;
|
---|
[5208] | 292 | mergingReducer1.Successor = null;
|
---|
| 293 | uniformSubScopesProcessor5.Operator = crossover2;
|
---|
| 294 | uniformSubScopesProcessor5.Successor = uniformSubScopesProcessor6;
|
---|
| 295 | crossover2.Successor = mutationBranch2;
|
---|
[3611] | 296 | mutationBranch2.FirstBranch = mutator2;
|
---|
| 297 | mutationBranch2.SecondBranch = null;
|
---|
[5208] | 298 | mutationBranch2.Successor = null;
|
---|
[3611] | 299 | mutator2.Successor = null;
|
---|
[5208] | 300 | uniformSubScopesProcessor6.Operator = evaluator3;
|
---|
[5356] | 301 | uniformSubScopesProcessor6.Successor = subScopesCounter3;
|
---|
| 302 | evaluator3.Successor = qualityComparer2;
|
---|
[5208] | 303 | qualityComparer2.Successor = subScopesRemover2;
|
---|
| 304 | subScopesRemover2.Successor = null;
|
---|
[5356] | 305 | subScopesCounter3.Successor = null;
|
---|
[3611] | 306 | offspringSelector.OffspringCreator = selector;
|
---|
[5208] | 307 | offspringSelector.Successor = subScopesProcessor3;
|
---|
| 308 | subScopesProcessor3.Operators.Add(bestSelector);
|
---|
| 309 | subScopesProcessor3.Operators.Add(worstSelector);
|
---|
| 310 | subScopesProcessor3.Successor = mergingReducer2;
|
---|
[3713] | 311 | bestSelector.Successor = rightReducer;
|
---|
[3611] | 312 | rightReducer.Successor = null;
|
---|
[3713] | 313 | worstSelector.Successor = leftReducer;
|
---|
[3699] | 314 | leftReducer.Successor = null;
|
---|
[5208] | 315 | mergingReducer2.Successor = null;
|
---|
[3611] | 316 | #endregion
|
---|
| 317 | }
|
---|
[3715] | 318 |
|
---|
| 319 | public override IOperation Apply() {
|
---|
| 320 | if (CrossoverParameter.ActualValue == null)
|
---|
| 321 | return null;
|
---|
| 322 | return base.Apply();
|
---|
| 323 | }
|
---|
[3611] | 324 | }
|
---|
| 325 | }
|
---|