Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Algorithms.SGA/3.3/SGAMainLoop.cs @ 3095

Last change on this file since 3095 was 3095, checked in by swagner, 15 years ago

Finished best and best known quality handling (#920)
File size: 17.1 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.Analysis;
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.SGA {
32  /// <summary>
33  /// An operator which represents the main loop of a standard genetic algorithm (SGA).
34  /// </summary>
35  [Item("SGAMainLoop", "An operator which represents the main loop of a standard genetic algorithm (SGA).")]
36  [Creatable("Test")]
37  [StorableClass]
38  public sealed class SGAMainLoop : 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 SubScopesLookupParameter<DoubleValue> QualityParameter {
47      get { return (SubScopesLookupParameter<DoubleValue>)Parameters["Quality"]; }
48    }
49    public ValueLookupParameter<DoubleValue> BestKnownQualityParameter {
50      get { return (ValueLookupParameter<DoubleValue>)Parameters["BestKnownQuality"]; }
51    }
52    public ValueLookupParameter<IOperator> SelectorParameter {
53      get { return (ValueLookupParameter<IOperator>)Parameters["Selector"]; }
54    }
55    public ValueLookupParameter<IOperator> CrossoverParameter {
56      get { return (ValueLookupParameter<IOperator>)Parameters["Crossover"]; }
57    }
58    public ValueLookupParameter<PercentValue> MutationProbabilityParameter {
59      get { return (ValueLookupParameter<PercentValue>)Parameters["MutationProbability"]; }
60    }
61    public ValueLookupParameter<IOperator> MutatorParameter {
62      get { return (ValueLookupParameter<IOperator>)Parameters["Mutator"]; }
63    }
64    public ValueLookupParameter<IOperator> EvaluatorParameter {
65      get { return (ValueLookupParameter<IOperator>)Parameters["Evaluator"]; }
66    }
67    public ValueLookupParameter<IntValue> ElitesParameter {
68      get { return (ValueLookupParameter<IntValue>)Parameters["Elites"]; }
69    }
70    public ValueLookupParameter<IntValue> MaximumGenerationsParameter {
71      get { return (ValueLookupParameter<IntValue>)Parameters["MaximumGenerations"]; }
72    }
73    public ValueLookupParameter<VariableCollection> ResultsParameter {
74      get { return (ValueLookupParameter<VariableCollection>)Parameters["Results"]; }
75    }
76    private ScopeParameter CurrentScopeParameter {
77      get { return (ScopeParameter)Parameters["CurrentScope"]; }
78    }
79
80    public IScope CurrentScope {
81      get { return CurrentScopeParameter.ActualValue; }
82    }
83    #endregion
84
85    [StorableConstructor]
86    private SGAMainLoop(bool deserializing) : base() { }
87    public SGAMainLoop()
88      : base() {
89      Initialize();
90    }
91
92    private void Initialize() {
93      #region Create parameters
94      Parameters.Add(new ValueLookupParameter<IRandom>("Random", "A pseudo random number generator."));
95      Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
96      Parameters.Add(new SubScopesLookupParameter<DoubleValue>("Quality", "The value which represents the quality of a solution."));
97      Parameters.Add(new ValueLookupParameter<DoubleValue>("BestKnownQuality", "The best known quality value found so far."));
98      Parameters.Add(new ValueLookupParameter<IOperator>("Selector", "The operator used to select solutions for reproduction."));
99      Parameters.Add(new ValueLookupParameter<IOperator>("Crossover", "The operator used to cross solutions."));
100      Parameters.Add(new ValueLookupParameter<PercentValue>("MutationProbability", "The probability that the mutation operator is applied on a solution."));
101      Parameters.Add(new ValueLookupParameter<IOperator>("Mutator", "The operator used to mutate solutions."));
102      Parameters.Add(new ValueLookupParameter<IOperator>("Evaluator", "The operator used to evaluate solutions."));
103      Parameters.Add(new ValueLookupParameter<IntValue>("Elites", "The numer of elite solutions which are kept in each generation."));
104      Parameters.Add(new ValueLookupParameter<IntValue>("MaximumGenerations", "The maximum number of generations which should be processed."));
105      Parameters.Add(new ValueLookupParameter<VariableCollection>("Results", "The variable collection where results should be stored."));
106      Parameters.Add(new ScopeParameter("CurrentScope", "The current scope which represents a population of solutions on which the SGA should be applied."));
107      #endregion
108
109      #region Create operators
110      VariableCreator variableCreator = new VariableCreator();
111      BestQualityMemorizer bestQualityMemorizer1 = new BestQualityMemorizer();
112      BestQualityMemorizer bestQualityMemorizer2 = new BestQualityMemorizer();
113      BestAverageWorstQualityCalculator bestAverageWorstQualityCalculator1 = new BestAverageWorstQualityCalculator();
114      DataTableValuesCollector dataTableValuesCollector1 = new DataTableValuesCollector();
115      QualityDifferenceCalculator qualityDifferenceCalculator1 = new QualityDifferenceCalculator();
116      ResultsCollector resultsCollector = new ResultsCollector();
117      SubScopesSorter subScopesSorter1 = new SubScopesSorter();
118      Placeholder selector = new Placeholder();
119      SequentialSubScopesProcessor sequentialSubScopesProcessor1 = new SequentialSubScopesProcessor();
120      ChildrenCreator childrenCreator = new ChildrenCreator();
121      UniformSequentialSubScopesProcessor uniformSequentialSubScopesProcessor = new UniformSequentialSubScopesProcessor();
122      Placeholder crossover = new Placeholder();
123      StochasticBranch stochasticBranch = new StochasticBranch();
124      Placeholder mutator = new Placeholder();
125      Placeholder evaluator = new Placeholder();
126      SubScopesRemover subScopesRemover = new SubScopesRemover();
127      SubScopesSorter subScopesSorter2 = new SubScopesSorter();
128      SequentialSubScopesProcessor sequentialSubScopesProcessor2 = new SequentialSubScopesProcessor();
129      LeftSelector leftSelector = new LeftSelector();
130      RightReducer rightReducer = new RightReducer();
131      MergingReducer mergingReducer = new MergingReducer();
132      IntCounter intCounter = new IntCounter();
133      Comparator comparator = new Comparator();
134      BestQualityMemorizer bestQualityMemorizer3 = new BestQualityMemorizer();
135      BestQualityMemorizer bestQualityMemorizer4 = new BestQualityMemorizer();
136      BestAverageWorstQualityCalculator bestAverageWorstQualityCalculator2 = new BestAverageWorstQualityCalculator();
137      DataTableValuesCollector dataTableValuesCollector2 = new DataTableValuesCollector();
138      QualityDifferenceCalculator qualityDifferenceCalculator2 = new QualityDifferenceCalculator();
139      ConditionalBranch conditionalBranch = new ConditionalBranch();
140
141      variableCreator.CollectedValues.Add(new ValueParameter<IntValue>("Generations", new IntValue(0)));
142
143      bestQualityMemorizer1.BestQualityParameter.ActualName = "BestQuality";
144      bestQualityMemorizer1.MaximizationParameter.ActualName = "Maximization";
145      bestQualityMemorizer1.QualityParameter.ActualName = "Quality";
146
147      bestQualityMemorizer2.BestQualityParameter.ActualName = "BestKnownQuality";
148      bestQualityMemorizer2.MaximizationParameter.ActualName = "Maximization";
149      bestQualityMemorizer2.QualityParameter.ActualName = "Quality";
150
151      bestAverageWorstQualityCalculator1.AverageQualityParameter.ActualName = "CurrentAverageQuality";
152      bestAverageWorstQualityCalculator1.BestQualityParameter.ActualName = "CurrentBestQuality";
153      bestAverageWorstQualityCalculator1.MaximizationParameter.ActualName = "Maximization";
154      bestAverageWorstQualityCalculator1.QualityParameter.ActualName = "Quality";
155      bestAverageWorstQualityCalculator1.WorstQualityParameter.ActualName = "CurrentWorstQuality";
156
157      dataTableValuesCollector1.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Best Quality", null, "CurrentBestQuality"));
158      dataTableValuesCollector1.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Average Quality", null, "CurrentAverageQuality"));
159      dataTableValuesCollector1.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Worst Quality", null, "CurrentWorstQuality"));
160      dataTableValuesCollector1.CollectedValues.Add(new LookupParameter<DoubleValue>("Best Quality", null, "BestQuality"));
161      dataTableValuesCollector1.CollectedValues.Add(new LookupParameter<DoubleValue>("Best Known Quality", null, "BestKnownQuality"));
162      dataTableValuesCollector1.DataTableParameter.ActualName = "Qualities";
163
164      qualityDifferenceCalculator1.AbsoluteDifferenceParameter.ActualName = "AbsoluteDifferenceBestKnownToBest";
165      qualityDifferenceCalculator1.FirstQualityParameter.ActualName = "BestKnownQuality";
166      qualityDifferenceCalculator1.RelativeDifferenceParameter.ActualName = "RelativeDifferenceBestKnownToBest";
167      qualityDifferenceCalculator1.SecondQualityParameter.ActualName = "BestQuality";
168
169      resultsCollector.CollectedValues.Add(new LookupParameter<IntValue>("Generations"));
170      resultsCollector.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Best Quality", null, "CurrentBestQuality"));
171      resultsCollector.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Average Quality", null, "CurrentAverageQuality"));
172      resultsCollector.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Worst Quality", null, "CurrentWorstQuality"));
173      resultsCollector.CollectedValues.Add(new LookupParameter<DoubleValue>("Best Quality", null, "BestQuality"));
174      resultsCollector.CollectedValues.Add(new LookupParameter<DoubleValue>("Best Known Quality", null, "BestKnownQuality"));
175      resultsCollector.CollectedValues.Add(new LookupParameter<DoubleValue>("Absolute Difference of Best Known Quality to Best Quality", null, "AbsoluteDifferenceBestKnownToBest"));
176      resultsCollector.CollectedValues.Add(new LookupParameter<DoubleValue>("Relative Difference of Best Known Quality to Best Quality", null, "RelativeDifferenceBestKnownToBest"));
177      resultsCollector.CollectedValues.Add(new LookupParameter<DataTable>("Qualities"));
178      resultsCollector.ResultsParameter.ActualName = "Results";
179
180      subScopesSorter1.DescendingParameter.ActualName = "Maximization";
181      subScopesSorter1.ValueParameter.ActualName = "Quality";
182
183      selector.Name = "Selector";
184      selector.OperatorParameter.ActualName = "Selector";
185
186      childrenCreator.ParentsPerChild = new IntValue(2);
187
188      crossover.Name = "Crossover";
189      crossover.OperatorParameter.ActualName = "Crossover";
190
191      stochasticBranch.ProbabilityParameter.ActualName = "MutationProbability";
192      stochasticBranch.RandomParameter.ActualName = "Random";
193
194      mutator.Name = "Mutator";
195      mutator.OperatorParameter.ActualName = "Mutator";
196
197      evaluator.Name = "Evaluator";
198      evaluator.OperatorParameter.ActualName = "Evaluator";
199
200      subScopesRemover.RemoveAllSubScopes = true;
201
202      subScopesSorter2.DescendingParameter.ActualName = "Maximization";
203      subScopesSorter2.ValueParameter.ActualName = "Quality";
204
205      leftSelector.CopySelected = new BoolValue(false);
206      leftSelector.NumberOfSelectedSubScopesParameter.ActualName = "Elites";
207
208      intCounter.Increment = new IntValue(1);
209      intCounter.ValueParameter.ActualName = "Generations";
210
211      comparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
212      comparator.LeftSideParameter.ActualName = "Generations";
213      comparator.ResultParameter.ActualName = "Terminate";
214      comparator.RightSideParameter.ActualName = "MaximumGenerations";
215
216      bestQualityMemorizer3.BestQualityParameter.ActualName = "BestQuality";
217      bestQualityMemorizer3.MaximizationParameter.ActualName = "Maximization";
218      bestQualityMemorizer3.QualityParameter.ActualName = "Quality";
219
220      bestQualityMemorizer4.BestQualityParameter.ActualName = "BestKnownQuality";
221      bestQualityMemorizer4.MaximizationParameter.ActualName = "Maximization";
222      bestQualityMemorizer4.QualityParameter.ActualName = "Quality";
223
224      bestAverageWorstQualityCalculator2.AverageQualityParameter.ActualName = "CurrentAverageQuality";
225      bestAverageWorstQualityCalculator2.BestQualityParameter.ActualName = "CurrentBestQuality";
226      bestAverageWorstQualityCalculator2.MaximizationParameter.ActualName = "Maximization";
227      bestAverageWorstQualityCalculator2.QualityParameter.ActualName = "Quality";
228      bestAverageWorstQualityCalculator2.WorstQualityParameter.ActualName = "CurrentWorstQuality";
229
230      dataTableValuesCollector2.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Best Quality", null, "CurrentBestQuality"));
231      dataTableValuesCollector2.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Average Quality", null, "CurrentAverageQuality"));
232      dataTableValuesCollector2.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Worst Quality", null, "CurrentWorstQuality"));
233      dataTableValuesCollector2.CollectedValues.Add(new LookupParameter<DoubleValue>("Best Quality", null, "BestQuality"));
234      dataTableValuesCollector2.CollectedValues.Add(new LookupParameter<DoubleValue>("Best Known Quality", null, "BestKnownQuality"));
235      dataTableValuesCollector2.DataTableParameter.ActualName = "Qualities";
236
237      qualityDifferenceCalculator2.AbsoluteDifferenceParameter.ActualName = "AbsoluteDifferenceBestKnownToBest";
238      qualityDifferenceCalculator2.FirstQualityParameter.ActualName = "BestKnownQuality";
239      qualityDifferenceCalculator2.RelativeDifferenceParameter.ActualName = "RelativeDifferenceBestKnownToBest";
240      qualityDifferenceCalculator2.SecondQualityParameter.ActualName = "BestQuality";
241
242      conditionalBranch.ConditionParameter.ActualName = "Terminate";
243      #endregion
244
245      #region Create operator graph
246      OperatorGraph.InitialOperator = variableCreator;
247      variableCreator.Successor = bestQualityMemorizer1;
248      bestQualityMemorizer1.Successor = bestQualityMemorizer2;
249      bestQualityMemorizer2.Successor = bestAverageWorstQualityCalculator1;
250      bestAverageWorstQualityCalculator1.Successor = dataTableValuesCollector1;
251      dataTableValuesCollector1.Successor = qualityDifferenceCalculator1;
252      qualityDifferenceCalculator1.Successor = resultsCollector;
253      resultsCollector.Successor = subScopesSorter1;
254      subScopesSorter1.Successor = selector;
255      selector.Successor = sequentialSubScopesProcessor1;
256      sequentialSubScopesProcessor1.Operators.Add(new EmptyOperator());
257      sequentialSubScopesProcessor1.Operators.Add(childrenCreator);
258      sequentialSubScopesProcessor1.Successor = sequentialSubScopesProcessor2;
259      childrenCreator.Successor = uniformSequentialSubScopesProcessor;
260      uniformSequentialSubScopesProcessor.Operator = crossover;
261      uniformSequentialSubScopesProcessor.Successor = subScopesSorter2;
262      crossover.Successor = stochasticBranch;
263      stochasticBranch.FirstBranch = mutator;
264      stochasticBranch.SecondBranch = null;
265      stochasticBranch.Successor = evaluator;
266      mutator.Successor = null;
267      evaluator.Successor = subScopesRemover;
268      subScopesRemover.Successor = null;
269      subScopesSorter2.Successor = null;
270      sequentialSubScopesProcessor2.Operators.Add(leftSelector);
271      sequentialSubScopesProcessor2.Operators.Add(new EmptyOperator());
272      sequentialSubScopesProcessor2.Successor = mergingReducer;
273      leftSelector.Successor = rightReducer;
274      rightReducer.Successor = null;
275      mergingReducer.Successor = intCounter;
276      intCounter.Successor = comparator;
277      comparator.Successor = bestQualityMemorizer3;
278      bestQualityMemorizer3.Successor = bestQualityMemorizer4;
279      bestQualityMemorizer4.Successor = bestAverageWorstQualityCalculator2;
280      bestAverageWorstQualityCalculator2.Successor = dataTableValuesCollector2;
281      dataTableValuesCollector2.Successor = qualityDifferenceCalculator2;
282      qualityDifferenceCalculator2.Successor = conditionalBranch;
283      conditionalBranch.FalseBranch = subScopesSorter1;
284      conditionalBranch.TrueBranch = null;
285      conditionalBranch.Successor = null;
286      #endregion
287    }
288  }
289}
Note: See TracBrowser for help on using the repository browser.