Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Algorithms.GeneticAlgorithm/3.3/GeneticAlgorithmMainLoop.cs @ 3265

Last change on this file since 3265 was 3198, checked in by swagner, 14 years ago

Renamed files/classes (#945).

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