Free cookie consent management tool by TermsFeed Policy Generator

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

Last change on this file since 17073 was 16565, checked in by gkronber, 6 years ago

#2520: merged changes from PersistenceOverhaul branch (r16451:16564) into trunk
File size: 12.9 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2019 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 HEAL.Attic;
29using HeuristicLab.Selection;
30
31namespace HeuristicLab.Algorithms.GeneticAlgorithm {
32  /// <summary>
33  /// An operator which represents the main loop of a genetic algorithm.
34  /// </summary>
35  [Item("GeneticAlgorithmMainLoop", "An operator which represents the main loop of a genetic algorithm.")]
36  [StorableType("890C1856-16C9-45F0-A0DD-67A152A70D28")]
37  public sealed class GeneticAlgorithmMainLoop : 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 ValueLookupParameter<IntValue> ElitesParameter {
64      get { return (ValueLookupParameter<IntValue>)Parameters["Elites"]; }
65    }
66    public IValueLookupParameter<BoolValue> ReevaluateElitesParameter {
67      get { return (IValueLookupParameter<BoolValue>)Parameters["ReevaluateElites"]; }
68    }
69    public ValueLookupParameter<IntValue> MaximumGenerationsParameter {
70      get { return (ValueLookupParameter<IntValue>)Parameters["MaximumGenerations"]; }
71    }
72    public ValueLookupParameter<VariableCollection> ResultsParameter {
73      get { return (ValueLookupParameter<VariableCollection>)Parameters["Results"]; }
74    }
75    public ValueLookupParameter<IOperator> AnalyzerParameter {
76      get { return (ValueLookupParameter<IOperator>)Parameters["Analyzer"]; }
77    }
78    public ValueLookupParameter<IntValue> EvaluatedSolutionsParameter {
79      get { return (ValueLookupParameter<IntValue>)Parameters["EvaluatedSolutions"]; }
80    }
81    public ValueLookupParameter<IntValue> PopulationSizeParameter {
82      get { return (ValueLookupParameter<IntValue>)Parameters["PopulationSize"]; }
83    }
84    private ScopeParameter CurrentScopeParameter {
85      get { return (ScopeParameter)Parameters["CurrentScope"]; }
86    }
87
88    public IScope CurrentScope {
89      get { return CurrentScopeParameter.ActualValue; }
90    }
91    #endregion
92
93    [StorableConstructor]
94    private GeneticAlgorithmMainLoop(StorableConstructorFlag _) : base(_) { }
95    private GeneticAlgorithmMainLoop(GeneticAlgorithmMainLoop original, Cloner cloner)
96      : base(original, cloner) {
97    }
98    public override IDeepCloneable Clone(Cloner cloner) {
99      return new GeneticAlgorithmMainLoop(this, cloner);
100    }
101    public GeneticAlgorithmMainLoop()
102      : base() {
103      Initialize();
104    }
105
106    private void Initialize() {
107      #region Create parameters
108      Parameters.Add(new ValueLookupParameter<IRandom>("Random", "A pseudo random number generator."));
109      Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
110      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The value which represents the quality of a solution."));
111      Parameters.Add(new ValueLookupParameter<IOperator>("Selector", "The operator used to select solutions for reproduction."));
112      Parameters.Add(new ValueLookupParameter<IOperator>("Crossover", "The operator used to cross solutions."));
113      Parameters.Add(new ValueLookupParameter<PercentValue>("MutationProbability", "The probability that the mutation operator is applied on a solution."));
114      Parameters.Add(new ValueLookupParameter<IOperator>("Mutator", "The operator used to mutate solutions."));
115      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."));
116      Parameters.Add(new ValueLookupParameter<IntValue>("Elites", "The numer of elite solutions which are kept in each generation."));
117      Parameters.Add(new ValueLookupParameter<BoolValue>("ReevaluateElites", "Flag to determine if elite individuals should be reevaluated (i.e., if stochastic fitness functions are used.)"));
118      Parameters.Add(new ValueLookupParameter<IntValue>("MaximumGenerations", "The maximum number of generations which should be processed."));
119      Parameters.Add(new ValueLookupParameter<VariableCollection>("Results", "The variable collection where results should be stored."));
120      Parameters.Add(new ValueLookupParameter<IOperator>("Analyzer", "The operator used to analyze each generation."));
121      Parameters.Add(new ValueLookupParameter<IntValue>("EvaluatedSolutions", "The number of times solutions have been evaluated."));
122      Parameters.Add(new ValueLookupParameter<IntValue>("PopulationSize", "The size of the population."));
123      Parameters.Add(new ScopeParameter("CurrentScope", "The current scope which represents a population of solutions on which the genetic algorithm should be applied."));
124      #endregion
125
126      #region Create operators
127      VariableCreator variableCreator = new VariableCreator();
128      ResultsCollector resultsCollector1 = new ResultsCollector();
129      Placeholder analyzer1 = new Placeholder();
130      Placeholder selector = new Placeholder();
131      SubScopesProcessor subScopesProcessor1 = new SubScopesProcessor();
132      ChildrenCreator childrenCreator = new ChildrenCreator();
133      UniformSubScopesProcessor uniformSubScopesProcessor1 = new UniformSubScopesProcessor();
134      Placeholder crossover = new Placeholder();
135      StochasticBranch stochasticBranch = new StochasticBranch();
136      Placeholder mutator = new Placeholder();
137      SubScopesRemover subScopesRemover = new SubScopesRemover();
138      UniformSubScopesProcessor uniformSubScopesProcessor2 = new UniformSubScopesProcessor();
139      Placeholder evaluator = new Placeholder();
140      SubScopesCounter subScopesCounter = new SubScopesCounter();
141      SubScopesProcessor subScopesProcessor2 = new SubScopesProcessor();
142      BestSelector bestSelector = new BestSelector();
143      RightReducer rightReducer = new RightReducer();
144      MergingReducer mergingReducer = new MergingReducer();
145      IntCounter intCounter = new IntCounter();
146      Comparator comparator = new Comparator();
147      Placeholder analyzer2 = new Placeholder();
148      ConditionalBranch conditionalBranch = new ConditionalBranch();
149      ConditionalBranch reevaluateElitesBranch = new ConditionalBranch();
150
151      variableCreator.CollectedValues.Add(new ValueParameter<IntValue>("Generations", new IntValue(0))); // Class GeneticAlgorithm expects this to be called Generations
152
153      resultsCollector1.CollectedValues.Add(new LookupParameter<IntValue>("Generations"));
154      resultsCollector1.ResultsParameter.ActualName = "Results";
155
156      analyzer1.Name = "Analyzer";
157      analyzer1.OperatorParameter.ActualName = "Analyzer";
158
159      selector.Name = "Selector";
160      selector.OperatorParameter.ActualName = "Selector";
161
162      childrenCreator.ParentsPerChild = new IntValue(2);
163
164      crossover.Name = "Crossover";
165      crossover.OperatorParameter.ActualName = "Crossover";
166
167      stochasticBranch.ProbabilityParameter.ActualName = "MutationProbability";
168      stochasticBranch.RandomParameter.ActualName = "Random";
169
170      mutator.Name = "Mutator";
171      mutator.OperatorParameter.ActualName = "Mutator";
172
173      subScopesRemover.RemoveAllSubScopes = true;
174
175      uniformSubScopesProcessor2.Parallel.Value = true;
176
177      evaluator.Name = "Evaluator";
178      evaluator.OperatorParameter.ActualName = "Evaluator";
179
180      subScopesCounter.Name = "Increment EvaluatedSolutions";
181      subScopesCounter.ValueParameter.ActualName = EvaluatedSolutionsParameter.Name;
182
183      bestSelector.CopySelected = new BoolValue(false);
184      bestSelector.MaximizationParameter.ActualName = "Maximization";
185      bestSelector.NumberOfSelectedSubScopesParameter.ActualName = "Elites";
186      bestSelector.QualityParameter.ActualName = "Quality";
187
188      intCounter.Increment = new IntValue(1);
189      intCounter.ValueParameter.ActualName = "Generations";
190
191      comparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
192      comparator.LeftSideParameter.ActualName = "Generations";
193      comparator.ResultParameter.ActualName = "Terminate";
194      comparator.RightSideParameter.ActualName = "MaximumGenerations";
195
196      analyzer2.Name = "Analyzer";
197      analyzer2.OperatorParameter.ActualName = "Analyzer";
198
199      conditionalBranch.ConditionParameter.ActualName = "Terminate";
200
201      reevaluateElitesBranch.ConditionParameter.ActualName = "ReevaluateElites";
202      reevaluateElitesBranch.Name = "Reevaluate elites ?";
203      #endregion
204
205      #region Create operator graph
206      OperatorGraph.InitialOperator = variableCreator;
207      variableCreator.Successor = resultsCollector1;
208      resultsCollector1.Successor = analyzer1;
209      analyzer1.Successor = selector;
210      selector.Successor = subScopesProcessor1;
211      subScopesProcessor1.Operators.Add(new EmptyOperator());
212      subScopesProcessor1.Operators.Add(childrenCreator);
213      subScopesProcessor1.Successor = subScopesProcessor2;
214      childrenCreator.Successor = uniformSubScopesProcessor1;
215      uniformSubScopesProcessor1.Operator = crossover;
216      uniformSubScopesProcessor1.Successor = uniformSubScopesProcessor2;
217      crossover.Successor = stochasticBranch;
218      stochasticBranch.FirstBranch = mutator;
219      stochasticBranch.SecondBranch = null;
220      stochasticBranch.Successor = subScopesRemover;
221      mutator.Successor = null;
222      subScopesRemover.Successor = null;
223      uniformSubScopesProcessor2.Operator = evaluator;
224      uniformSubScopesProcessor2.Successor = subScopesCounter;
225      evaluator.Successor = null;
226      subScopesCounter.Successor = null;
227      subScopesProcessor2.Operators.Add(bestSelector);
228      subScopesProcessor2.Operators.Add(new EmptyOperator());
229      subScopesProcessor2.Successor = mergingReducer;
230      bestSelector.Successor = rightReducer;
231      rightReducer.Successor = reevaluateElitesBranch;
232      reevaluateElitesBranch.TrueBranch = uniformSubScopesProcessor2;
233      reevaluateElitesBranch.FalseBranch = null;
234      reevaluateElitesBranch.Successor = null;
235      mergingReducer.Successor = intCounter;
236      intCounter.Successor = comparator;
237      comparator.Successor = analyzer2;
238      analyzer2.Successor = conditionalBranch;
239      conditionalBranch.FalseBranch = selector;
240      conditionalBranch.TrueBranch = null;
241      conditionalBranch.Successor = null;
242      #endregion
243    }
244
245    [StorableHook(HookType.AfterDeserialization)]
246    private void AfterDeserialization() {
247      // BackwardsCompatibility3.3
248      #region Backwards compatible code, remove with 3.4
249      if (!Parameters.ContainsKey("ReevaluateElites")) {
250        Parameters.Add(new ValueLookupParameter<BoolValue>("ReevaluateElites", "Flag to determine if elite individuals should be reevaluated (i.e., if stochastic fitness functions are used.)"));
251      }
252      #endregion
253    }
254
255    public override IOperation Apply() {
256      if (CrossoverParameter.ActualValue == null)
257        return null;
258      return base.Apply();
259    }
260  }
261}
Note: See TracBrowser for help on using the repository browser.