Free cookie consent management tool by TermsFeed Policy Generator

source: branches/ALPS/HeuristicLab.Algorithms.ALPS/3.3/AlpsGeneticAlgorithmMainLoop.cs @ 12186

Last change on this file since 12186 was 12186, checked in by pfleck, 8 years ago

#2269 Added the possibility for a plus-selection replacement scheme.

File size: 14.5 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 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 System.Linq;
23using HeuristicLab.Algorithms.GeneticAlgorithm;
24using HeuristicLab.Common;
25using HeuristicLab.Core;
26using HeuristicLab.Data;
27using HeuristicLab.Operators;
28using HeuristicLab.Optimization;
29using HeuristicLab.Optimization.Operators;
30using HeuristicLab.Parameters;
31using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
32using HeuristicLab.Selection;
33
34namespace HeuristicLab.Algorithms.ALPS {
35
36  [Item("AlpsGeneticAlgorithmMainLoop", "An ALPS genetic algorithm main loop operator.")]
37  [StorableClass]
38  public sealed class AlpsGeneticAlgorithmMainLoop : AlgorithmOperator {
39    #region Parameter Properties
40    public ValueLookupParameter<BoolValue> MaximizationParameter {
41      get { return (ValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
42    }
43    public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
44      get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
45    }
46    public ILookupParameter<IntValue> MaximumGenerationsParameter {
47      get { return (ILookupParameter<IntValue>)Parameters["MaximumGenerations"]; }
48    }
49    public ILookupParameter<IOperator> AnalyzerParameter {
50      get { return (ILookupParameter<IOperator>)Parameters["Analyzer"]; }
51    }
52    public ILookupParameter<IOperator> LayerAnalyzerParameter {
53      get { return (ILookupParameter<IOperator>)Parameters["LayerAnalyzer"]; }
54    }
55    #endregion
56
57    public GeneticAlgorithmMainLoop MainOperator {
58      get { return OperatorGraph.Iterate().OfType<GeneticAlgorithmMainLoop>().First(); }
59    }
60    public EldersEmigrator EldersEmigrator {
61      get { return OperatorGraph.Iterate().OfType<EldersEmigrator>().First(); }
62    }
63    public LayerUpdator LayerUpdator {
64      get { return OperatorGraph.Iterate().OfType<LayerUpdator>().First(); }
65    }
66
67    [StorableConstructor]
68    private AlpsGeneticAlgorithmMainLoop(bool deserializing)
69      : base(deserializing) { }
70    private AlpsGeneticAlgorithmMainLoop(AlpsGeneticAlgorithmMainLoop original, Cloner cloner)
71      : base(original, cloner) { }
72    public override IDeepCloneable Clone(Cloner cloner) {
73      return new AlpsGeneticAlgorithmMainLoop(this, cloner);
74    }
75    public AlpsGeneticAlgorithmMainLoop()
76      : base() {
77      Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
78      Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The value which represents the quality of a solution."));
79      Parameters.Add(new LookupParameter<IntValue>("MaximumGenerations", "The maximum number of generations that the algorithm should process."));
80      Parameters.Add(new LookupParameter<IOperator>("Analyzer", "The operator used to the analyze all individuals."));
81      Parameters.Add(new LookupParameter<IOperator>("LayerAnalyzer", "The operator used to analyze each layer."));
82
83      var variableCreator = new VariableCreator() { Name = "Initialize" };
84      var initLayerAnalyzerProcessor = new SubScopesProcessor();
85      var layerVariableCreator = new VariableCreator() { Name = "Initialize Layer" };
86      var initLayerAnalyzerPlaceholder = new Placeholder() { Name = "LayerAnalyzer (Placeholder)" };
87      var initAnalyzerPlaceholder = new Placeholder() { Name = "Analyzer (Placeholder)" };
88      var resultsCollector = new ResultsCollector();
89      var matingPoolPreProcessor = new UniformSubScopesProcessor() { Name = "MatingPoolPreProcessor" };
90      var matingPoolPreSorter = new SubScopesSorter() { Name = "MatingPoolPreSorter" };
91      var matingPoolCreator = new MatingPoolCreator() { Name = "Create Mating Pools" };
92      var matingPoolProcessor = new LayerUniformSubScopesProcessor();
93      var initializeLayer = new Assigner() { Name = "Reset LayerEvaluatedSolutions" };
94      var mainOperator = CreatePreparedGeneticAlgorithmMainLoop();
95      var layerAnalyzerPlaceholder = new Placeholder() { Name = "LayerAnalyzer (Placeholder)" };
96      var generationsIcrementor = new IntCounter() { Name = "Increment Generations" };
97      var evaluatedSolutionsReducer = new DataReducer() { Name = "Increment EvaluatedSolutions" };
98      var eldersEmigrator = new EldersEmigrator() { Name = "Emigrate Elders" };
99      var layerUpdator = new LayerUpdator(mainOperator) { Name = "Update Layers" };
100      var analyzerPlaceholder = new Placeholder() { Name = "Analyzer (Placeholder)" };
101      var generationsComparator = new Comparator() { Name = "Generations >= MaximumGenerations" };
102      var terminateBranch = new ConditionalBranch() { Name = "Terminate?" };
103
104      OperatorGraph.InitialOperator = variableCreator;
105
106      variableCreator.CollectedValues.Add(new ValueParameter<IntValue>("Generations", new IntValue(0)));
107      variableCreator.CollectedValues.Add(new ValueParameter<IntValue>("GenerationsSinceLastRefresh", new IntValue(0)));
108      variableCreator.CollectedValues.Add(new ValueParameter<IntValue>("OpenLayers", new IntValue(1)));
109      variableCreator.Successor = initLayerAnalyzerProcessor;
110
111      initLayerAnalyzerProcessor.Operators.Add(layerVariableCreator);
112      initLayerAnalyzerProcessor.Successor = initAnalyzerPlaceholder;
113
114      layerVariableCreator.CollectedValues.Add(new ValueParameter<IntValue>("LayerEvaluatedSolutions"));
115      layerVariableCreator.CollectedValues.Add(new ValueParameter<ResultCollection>("LayerResults"));
116      layerVariableCreator.Successor = initLayerAnalyzerPlaceholder;
117
118      initLayerAnalyzerPlaceholder.OperatorParameter.ActualName = LayerAnalyzerParameter.Name;
119      initLayerAnalyzerPlaceholder.Successor = null;
120
121      initAnalyzerPlaceholder.OperatorParameter.ActualName = AnalyzerParameter.Name;
122      initAnalyzerPlaceholder.Successor = resultsCollector;
123
124      resultsCollector.CollectedValues.Add(new LookupParameter<IntValue>("Generations"));
125      resultsCollector.CollectedValues.Add(new ScopeTreeLookupParameter<ResultCollection>("LayerResults", "Result set for each layer", "LayerResults"));
126      resultsCollector.CollectedValues.Add(new LookupParameter<IntValue>("OpenLayers"));
127      resultsCollector.CopyValue = new BoolValue(false);
128      resultsCollector.Successor = matingPoolPreProcessor;
129
130      matingPoolPreProcessor.Operator = matingPoolPreSorter;
131      matingPoolPreProcessor.Successor = matingPoolCreator;
132
133      matingPoolPreSorter.ValueParameter.ActualName = QualityParameter.Name;
134      matingPoolPreSorter.DescendingParameter.ActualName = MaximizationParameter.Name;
135
136      matingPoolCreator.Successor = matingPoolProcessor;
137
138      matingPoolProcessor.Parallel.Value = true;
139      matingPoolProcessor.Operator = initializeLayer;
140      matingPoolProcessor.Successor = generationsIcrementor;
141
142      initializeLayer.LeftSideParameter.ActualName = "LayerEvaluatedSolutions";
143      initializeLayer.RightSideParameter.Value = new IntValue(0);
144      initializeLayer.Successor = mainOperator;
145
146      generationsIcrementor.ValueParameter.ActualName = "Generations";
147      generationsIcrementor.Increment = new IntValue(1);
148      generationsIcrementor.Successor = evaluatedSolutionsReducer;
149
150      evaluatedSolutionsReducer.ParameterToReduce.ActualName = "LayerEvaluatedSolutions";
151      evaluatedSolutionsReducer.TargetParameter.ActualName = "EvaluatedSolutions";
152      evaluatedSolutionsReducer.ReductionOperation.Value = new ReductionOperation(ReductionOperations.Sum);
153      evaluatedSolutionsReducer.TargetOperation.Value = new ReductionOperation(ReductionOperations.Sum);
154      evaluatedSolutionsReducer.Successor = eldersEmigrator;
155
156      mainOperator.Successor = layerAnalyzerPlaceholder;
157
158      layerAnalyzerPlaceholder.OperatorParameter.ActualName = LayerAnalyzerParameter.Name;
159      layerAnalyzerPlaceholder.Successor = null;
160
161      eldersEmigrator.Successor = layerUpdator;
162
163      layerUpdator.Successor = analyzerPlaceholder;
164
165      analyzerPlaceholder.OperatorParameter.ActualName = AnalyzerParameter.Name;
166      analyzerPlaceholder.Successor = generationsComparator;
167
168      generationsComparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
169      generationsComparator.LeftSideParameter.ActualName = "Generations";
170      generationsComparator.RightSideParameter.ActualName = MaximumGenerationsParameter.Name;
171      generationsComparator.ResultParameter.ActualName = "TerminateGenerations";
172      generationsComparator.Successor = terminateBranch;
173
174      terminateBranch.ConditionParameter.ActualName = "TerminateGenerations";
175      terminateBranch.FalseBranch = matingPoolPreProcessor;
176    }
177
178    private GeneticAlgorithmMainLoop CreatePreparedGeneticAlgorithmMainLoop() {
179      var mainLoop = new GeneticAlgorithmMainLoop();
180
181      var selector = mainLoop.OperatorGraph.Iterate().OfType<Placeholder>().First(o => o.OperatorParameter.ActualName == "Selector");
182      var crossover = mainLoop.OperatorGraph.Iterate().OfType<Placeholder>().First(o => o.OperatorParameter.ActualName == "Crossover");
183      var subScopesCounter = mainLoop.OperatorGraph.Iterate().OfType<SubScopesCounter>().First();
184      var elitesMerger = mainLoop.OperatorGraph.Iterate().OfType<MergingReducer>().First();
185
186      // Operator starts with calculating number of selected scopes base on plus/comma-selection replacement scheme
187      var numberOfSubScopesBranch = new ConditionalBranch() { Name = "PlusSelection?" };
188      var numberOfSelectedSubScopesPlusCalculator = new ExpressionCalculator() { Name = "NumberOfSelectedSubScopes = PopulationSize * 2" };
189      var numberOfSelectedSubScopesCalculator = new ExpressionCalculator() { Name = "NumberOfSelectedSubScopes = (PopulationSize - Elites) * 2" };
190      var replacementBranch = new ConditionalBranch() { Name = "PlusSelection?" };
191
192      mainLoop.OperatorGraph.InitialOperator = numberOfSubScopesBranch;
193
194      numberOfSubScopesBranch.ConditionParameter.ActualName = "PlusSelection";
195      numberOfSubScopesBranch.TrueBranch = numberOfSelectedSubScopesPlusCalculator;
196      numberOfSubScopesBranch.FalseBranch = numberOfSelectedSubScopesCalculator;
197      numberOfSubScopesBranch.Successor = selector;
198
199      numberOfSelectedSubScopesPlusCalculator.CollectedValues.Add(new LookupParameter<IntValue>("PopulationSize"));
200      numberOfSelectedSubScopesPlusCalculator.ExpressionResultParameter.ActualName = "NumberOfSelectedSubScopes";
201      numberOfSelectedSubScopesPlusCalculator.ExpressionParameter.Value = new StringValue("PopulationSize 2 * toint");
202
203      numberOfSelectedSubScopesCalculator.CollectedValues.Add(new LookupParameter<IntValue>("PopulationSize"));
204      numberOfSelectedSubScopesCalculator.CollectedValues.Add(new LookupParameter<IntValue>("Elites"));
205      numberOfSelectedSubScopesCalculator.ExpressionResultParameter.ActualName = "NumberOfSelectedSubScopes";
206      numberOfSelectedSubScopesCalculator.ExpressionParameter.Value = new StringValue("PopulationSize Elites - 2 * toint");
207
208      // Use Elitism or Plus-Selection as replacement strategy
209      var selectedProcessor = (SubScopesProcessor)selector.Successor;
210      var elitismReplacement = selectedProcessor.Successor;
211      selectedProcessor.Successor = replacementBranch;
212      replacementBranch.ConditionParameter.ActualName = "PlusSelection";
213      replacementBranch.FalseBranch = elitismReplacement;
214
215      // Plus selection replacement
216      var replacementMergingReducer = new MergingReducer();
217      var replacementBestSelector = new BestSelector();
218      var replacementRightReducer = new RightReducer();
219      replacementBranch.TrueBranch = replacementMergingReducer;
220
221      replacementMergingReducer.Successor = replacementBestSelector;
222
223      replacementBestSelector.NumberOfSelectedSubScopesParameter.ActualName = "PopulationSize";
224      replacementBestSelector.CopySelected = new BoolValue(false);
225      replacementBestSelector.Successor = replacementRightReducer;
226
227      replacementRightReducer.Successor = null;
228
229      // Increment ages of all individuals after replacement
230      var incrementAgeProcessor = new UniformSubScopesProcessor();
231      var ageIncrementor = new IntCounter() { Name = "Increment Age" };
232      replacementBranch.Successor = incrementAgeProcessor;
233      incrementAgeProcessor.Operator = ageIncrementor;
234      incrementAgeProcessor.Successor = null;
235      ageIncrementor.ValueParameter.ActualName = "Age";
236      ageIncrementor.Increment = new IntValue(1);
237      //ageIncrementor.Successor = null;
238
239      // Insert AgeCalculator between crossover and its successor
240      var crossoverSuccessor = crossover.Successor;
241      var ageCalculator = new DataReducer() { Name = "Calculate Age" };
242      crossover.Successor = ageCalculator;
243
244      ageCalculator.ParameterToReduce.ActualName = "Age";
245      ageCalculator.TargetParameter.ActualName = "Age";
246      ageCalculator.ReductionOperation.Value = null;
247      ageCalculator.ReductionOperation.ActualName = "AgeInheritance";
248      ageCalculator.TargetOperation.Value = new ReductionOperation(ReductionOperations.Assign);
249      ageCalculator.Successor = crossoverSuccessor;
250
251      // When counting the evaluated solutions, write in LayerEvaluatedSolutions
252      subScopesCounter.ValueParameter.ActualName = "LayerEvaluatedSolutions";
253      subScopesCounter.AccumulateParameter.Value = new BoolValue(false);
254
255      // Instead of generational loop after merging of elites, stop
256      elitesMerger.Successor = null;
257
258      // Parameterize
259      foreach (var stochasticOperator in mainLoop.OperatorGraph.Iterate().OfType<IStochasticOperator>())
260        stochasticOperator.RandomParameter.ActualName = "LocalRandom";
261      foreach (var stochasticBranch in mainLoop.OperatorGraph.Iterate().OfType<StochasticBranch>())
262        stochasticBranch.RandomParameter.ActualName = "LocalRandom";
263
264      return mainLoop;
265    }
266  }
267}
Note: See TracBrowser for help on using the repository browser.