Free cookie consent management tool by TermsFeed Policy Generator

source: branches/CloningRefactoring/HeuristicLab.Algorithms.OffspringSelectionGeneticAlgorithm/3.3/OffspringSelectionGeneticAlgorithmMainOperator.cs @ 4669

Last change on this file since 4669 was 4669, checked in by mkommend, 13 years ago

Refactored Algorithms.* and fixed BoolValue (ticket #922).
File size: 14.9 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2010 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
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Operators;
26using HeuristicLab.Optimization.Operators;
27using HeuristicLab.Parameters;
28using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
29using HeuristicLab.Selection;
30
31namespace 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    }
45    public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
46      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
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]
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    }
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."));
106      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The value which represents the quality of a solution."));
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."));
111      Parameters.Add(new ValueLookupParameter<IOperator>("Evaluator", "The operator used to evaluate solutions."));
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      UniformSubScopesProcessor uniformSubScopesProcessor = new UniformSubScopesProcessor();
127      Placeholder crossover = new Placeholder();
128      ConditionalBranch osBeforeMutationBranch = new ConditionalBranch();
129      Placeholder evaluator1 = new Placeholder();
130      IntCounter evaluationCounter1 = new IntCounter();
131      WeightedParentsQualityComparator qualityComparer1 = new WeightedParentsQualityComparator();
132      StochasticBranch mutationBranch1 = new StochasticBranch();
133      Placeholder mutator1 = new Placeholder();
134      Placeholder evaluator2 = new Placeholder();
135      IntCounter evaluationCounter2 = new IntCounter();
136      StochasticBranch mutationBranch2 = new StochasticBranch();
137      Placeholder mutator2 = new Placeholder();
138      Placeholder evaluator3 = new Placeholder();
139      IntCounter evaluationCounter3 = new IntCounter();
140      WeightedParentsQualityComparator qualityComparer2 = new WeightedParentsQualityComparator();
141      SubScopesRemover subScopesRemover = new SubScopesRemover();
142      OffspringSelector offspringSelector = new OffspringSelector();
143      SubScopesProcessor subScopesProcessor2 = new SubScopesProcessor();
144      BestSelector bestSelector = new BestSelector();
145      WorstSelector worstSelector = new WorstSelector();
146      RightReducer rightReducer = new RightReducer();
147      LeftReducer leftReducer = new LeftReducer();
148      MergingReducer mergingReducer = new MergingReducer();
149
150      selector.Name = "Selector (placeholder)";
151      selector.OperatorParameter.ActualName = SelectorParameter.Name;
152
153      childrenCreator.ParentsPerChild = new IntValue(2);
154
155      crossover.Name = "Crossover (placeholder)";
156      crossover.OperatorParameter.ActualName = CrossoverParameter.Name;
157
158      osBeforeMutationBranch.Name = "Apply OS before mutation?";
159      osBeforeMutationBranch.ConditionParameter.ActualName = OffspringSelectionBeforeMutationParameter.Name;
160
161      evaluator1.Name = "Evaluator (placeholder)";
162      evaluator1.OperatorParameter.ActualName = EvaluatorParameter.Name;
163
164      evaluationCounter1.Name = "EvaluatedSolutions++";
165      evaluationCounter1.Increment = new IntValue(1);
166      evaluationCounter1.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
167
168      qualityComparer1.ComparisonFactorParameter.ActualName = ComparisonFactorParameter.Name;
169      qualityComparer1.LeftSideParameter.ActualName = QualityParameter.Name;
170      qualityComparer1.MaximizationParameter.ActualName = MaximizationParameter.Name;
171      qualityComparer1.RightSideParameter.ActualName = QualityParameter.Name;
172      qualityComparer1.ResultParameter.ActualName = "SuccessfulOffspring";
173
174      mutationBranch1.ProbabilityParameter.ActualName = MutationProbabilityParameter.Name;
175      mutationBranch1.RandomParameter.ActualName = RandomParameter.Name;
176
177      mutator1.Name = "Mutator (placeholder)";
178      mutator1.OperatorParameter.ActualName = MutatorParameter.Name;
179
180      evaluator2.Name = "Evaluator (placeholder)";
181      evaluator2.OperatorParameter.ActualName = EvaluatorParameter.Name;
182
183      evaluationCounter2.Name = "EvaluatedSolutions++";
184      evaluationCounter2.Increment = new IntValue(1);
185      evaluationCounter2.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
186
187      mutationBranch2.ProbabilityParameter.ActualName = MutationProbabilityParameter.Name;
188      mutationBranch2.RandomParameter.ActualName = RandomParameter.Name;
189
190      mutator2.Name = "Mutator (placeholder)";
191      mutator2.OperatorParameter.ActualName = MutatorParameter.Name;
192
193      evaluator3.Name = "Evaluator (placeholder)";
194      evaluator3.OperatorParameter.ActualName = EvaluatorParameter.Name;
195
196      evaluationCounter3.Name = "EvaluatedSolutions++";
197      evaluationCounter3.Increment = new IntValue(1);
198      evaluationCounter3.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
199
200      qualityComparer2.ComparisonFactorParameter.ActualName = ComparisonFactorParameter.Name;
201      qualityComparer2.LeftSideParameter.ActualName = QualityParameter.Name;
202      qualityComparer2.MaximizationParameter.ActualName = MaximizationParameter.Name;
203      qualityComparer2.RightSideParameter.ActualName = QualityParameter.Name;
204      qualityComparer2.ResultParameter.ActualName = "SuccessfulOffspring";
205
206      subScopesRemover.RemoveAllSubScopes = true;
207
208      offspringSelector.CurrentSuccessRatioParameter.ActualName = CurrentSuccessRatioParameter.Name;
209      offspringSelector.MaximumSelectionPressureParameter.ActualName = MaximumSelectionPressureParameter.Name;
210      offspringSelector.SelectionPressureParameter.ActualName = SelectionPressureParameter.Name;
211      offspringSelector.SuccessRatioParameter.ActualName = SuccessRatioParameter.Name;
212      offspringSelector.OffspringPopulationParameter.ActualName = "OffspringPopulation";
213      offspringSelector.OffspringPopulationWinnersParameter.ActualName = "OffspringPopulationWinners";
214      offspringSelector.SuccessfulOffspringParameter.ActualName = "SuccessfulOffspring";
215
216      bestSelector.CopySelected = new BoolValue(false);
217      bestSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
218      bestSelector.NumberOfSelectedSubScopesParameter.ActualName = ElitesParameter.Name;
219      bestSelector.QualityParameter.ActualName = QualityParameter.Name;
220
221      worstSelector.CopySelected = new BoolValue(false);
222      worstSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
223      worstSelector.NumberOfSelectedSubScopesParameter.ActualName = ElitesParameter.Name;
224      worstSelector.QualityParameter.ActualName = QualityParameter.Name;
225      #endregion
226
227      #region Create operator graph
228      OperatorGraph.InitialOperator = selector;
229      selector.Successor = subScopesProcessor1;
230      subScopesProcessor1.Operators.Add(new EmptyOperator());
231      subScopesProcessor1.Operators.Add(childrenCreator);
232      subScopesProcessor1.Successor = offspringSelector;
233      childrenCreator.Successor = uniformSubScopesProcessor;
234      uniformSubScopesProcessor.Operator = crossover;
235      uniformSubScopesProcessor.Successor = null;
236      crossover.Successor = osBeforeMutationBranch;
237      osBeforeMutationBranch.TrueBranch = evaluator1;
238      osBeforeMutationBranch.FalseBranch = mutationBranch2;
239      osBeforeMutationBranch.Successor = subScopesRemover;
240      evaluator1.Successor = evaluationCounter1;
241      evaluationCounter1.Successor = qualityComparer1;
242      qualityComparer1.Successor = mutationBranch1;
243      mutationBranch1.FirstBranch = mutator1;
244      mutationBranch1.SecondBranch = null;
245      mutationBranch1.Successor = null;
246      mutator1.Successor = evaluator2;
247      evaluator2.Successor = evaluationCounter2;
248      evaluationCounter2.Successor = null;
249      mutationBranch2.FirstBranch = mutator2;
250      mutationBranch2.SecondBranch = null;
251      mutationBranch2.Successor = evaluator3;
252      mutator2.Successor = null;
253      evaluator3.Successor = evaluationCounter3;
254      evaluationCounter3.Successor = qualityComparer2;
255      subScopesRemover.Successor = null;
256      offspringSelector.OffspringCreator = selector;
257      offspringSelector.Successor = subScopesProcessor2;
258      subScopesProcessor2.Operators.Add(bestSelector);
259      subScopesProcessor2.Operators.Add(worstSelector);
260      subScopesProcessor2.Successor = mergingReducer;
261      bestSelector.Successor = rightReducer;
262      rightReducer.Successor = null;
263      worstSelector.Successor = leftReducer;
264      leftReducer.Successor = null;
265      mergingReducer.Successor = null;
266      #endregion
267    }
268
269    public override IOperation Apply() {
270      if (CrossoverParameter.ActualValue == null)
271        return null;
272      return base.Apply();
273    }
274  }
275}
Note: See TracBrowser for help on using the repository browser.