| 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 |
|
|---|
| 22 | using HeuristicLab.Analysis;
|
|---|
| 23 | using HeuristicLab.Core;
|
|---|
| 24 | using HeuristicLab.Data;
|
|---|
| 25 | using HeuristicLab.Operators;
|
|---|
| 26 | using HeuristicLab.Optimization.Operators;
|
|---|
| 27 | using HeuristicLab.Parameters;
|
|---|
| 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
|---|
| 29 | using HeuristicLab.Selection;
|
|---|
| 30 |
|
|---|
| 31 | namespace 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 | Placeholder selector = new Placeholder();
|
|---|
| 118 | SequentialSubScopesProcessor sequentialSubScopesProcessor1 = new SequentialSubScopesProcessor();
|
|---|
| 119 | ChildrenCreator childrenCreator = new ChildrenCreator();
|
|---|
| 120 | UniformSequentialSubScopesProcessor uniformSequentialSubScopesProcessor = new UniformSequentialSubScopesProcessor();
|
|---|
| 121 | Placeholder crossover = new Placeholder();
|
|---|
| 122 | StochasticBranch stochasticBranch = new StochasticBranch();
|
|---|
| 123 | Placeholder mutator = new Placeholder();
|
|---|
| 124 | Placeholder evaluator = new Placeholder();
|
|---|
| 125 | SubScopesRemover subScopesRemover = new SubScopesRemover();
|
|---|
| 126 | SequentialSubScopesProcessor sequentialSubScopesProcessor2 = new SequentialSubScopesProcessor();
|
|---|
| 127 | BestSelector bestSelector = new BestSelector();
|
|---|
| 128 | RightReducer rightReducer = new RightReducer();
|
|---|
| 129 | MergingReducer mergingReducer = new MergingReducer();
|
|---|
| 130 | IntCounter intCounter = new IntCounter();
|
|---|
| 131 | Comparator comparator = new Comparator();
|
|---|
| 132 | BestQualityMemorizer bestQualityMemorizer3 = new BestQualityMemorizer();
|
|---|
| 133 | BestQualityMemorizer bestQualityMemorizer4 = new BestQualityMemorizer();
|
|---|
| 134 | BestAverageWorstQualityCalculator bestAverageWorstQualityCalculator2 = new BestAverageWorstQualityCalculator();
|
|---|
| 135 | DataTableValuesCollector dataTableValuesCollector2 = new DataTableValuesCollector();
|
|---|
| 136 | QualityDifferenceCalculator qualityDifferenceCalculator2 = new QualityDifferenceCalculator();
|
|---|
| 137 | ConditionalBranch conditionalBranch = new ConditionalBranch();
|
|---|
| 138 |
|
|---|
| 139 | variableCreator.CollectedValues.Add(new ValueParameter<IntValue>("Generations", new IntValue(0)));
|
|---|
| 140 |
|
|---|
| 141 | bestQualityMemorizer1.BestQualityParameter.ActualName = "BestQuality";
|
|---|
| 142 | bestQualityMemorizer1.MaximizationParameter.ActualName = "Maximization";
|
|---|
| 143 | bestQualityMemorizer1.QualityParameter.ActualName = "Quality";
|
|---|
| 144 |
|
|---|
| 145 | bestQualityMemorizer2.BestQualityParameter.ActualName = "BestKnownQuality";
|
|---|
| 146 | bestQualityMemorizer2.MaximizationParameter.ActualName = "Maximization";
|
|---|
| 147 | bestQualityMemorizer2.QualityParameter.ActualName = "Quality";
|
|---|
| 148 |
|
|---|
| 149 | bestAverageWorstQualityCalculator1.AverageQualityParameter.ActualName = "CurrentAverageQuality";
|
|---|
| 150 | bestAverageWorstQualityCalculator1.BestQualityParameter.ActualName = "CurrentBestQuality";
|
|---|
| 151 | bestAverageWorstQualityCalculator1.MaximizationParameter.ActualName = "Maximization";
|
|---|
| 152 | bestAverageWorstQualityCalculator1.QualityParameter.ActualName = "Quality";
|
|---|
| 153 | bestAverageWorstQualityCalculator1.WorstQualityParameter.ActualName = "CurrentWorstQuality";
|
|---|
| 154 |
|
|---|
| 155 | dataTableValuesCollector1.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Best Quality", null, "CurrentBestQuality"));
|
|---|
| 156 | dataTableValuesCollector1.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Average Quality", null, "CurrentAverageQuality"));
|
|---|
| 157 | dataTableValuesCollector1.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Worst Quality", null, "CurrentWorstQuality"));
|
|---|
| 158 | dataTableValuesCollector1.CollectedValues.Add(new LookupParameter<DoubleValue>("Best Quality", null, "BestQuality"));
|
|---|
| 159 | dataTableValuesCollector1.CollectedValues.Add(new LookupParameter<DoubleValue>("Best Known Quality", null, "BestKnownQuality"));
|
|---|
| 160 | dataTableValuesCollector1.DataTableParameter.ActualName = "Qualities";
|
|---|
| 161 |
|
|---|
| 162 | qualityDifferenceCalculator1.AbsoluteDifferenceParameter.ActualName = "AbsoluteDifferenceBestKnownToBest";
|
|---|
| 163 | qualityDifferenceCalculator1.FirstQualityParameter.ActualName = "BestKnownQuality";
|
|---|
| 164 | qualityDifferenceCalculator1.RelativeDifferenceParameter.ActualName = "RelativeDifferenceBestKnownToBest";
|
|---|
| 165 | qualityDifferenceCalculator1.SecondQualityParameter.ActualName = "BestQuality";
|
|---|
| 166 |
|
|---|
| 167 | resultsCollector.CollectedValues.Add(new LookupParameter<IntValue>("Generations"));
|
|---|
| 168 | resultsCollector.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Best Quality", null, "CurrentBestQuality"));
|
|---|
| 169 | resultsCollector.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Average Quality", null, "CurrentAverageQuality"));
|
|---|
| 170 | resultsCollector.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Worst Quality", null, "CurrentWorstQuality"));
|
|---|
| 171 | resultsCollector.CollectedValues.Add(new LookupParameter<DoubleValue>("Best Quality", null, "BestQuality"));
|
|---|
| 172 | resultsCollector.CollectedValues.Add(new LookupParameter<DoubleValue>("Best Known Quality", null, "BestKnownQuality"));
|
|---|
| 173 | resultsCollector.CollectedValues.Add(new LookupParameter<DoubleValue>("Absolute Difference of Best Known Quality to Best Quality", null, "AbsoluteDifferenceBestKnownToBest"));
|
|---|
| 174 | resultsCollector.CollectedValues.Add(new LookupParameter<DoubleValue>("Relative Difference of Best Known Quality to Best Quality", null, "RelativeDifferenceBestKnownToBest"));
|
|---|
| 175 | resultsCollector.CollectedValues.Add(new LookupParameter<DataTable>("Qualities"));
|
|---|
| 176 | resultsCollector.ResultsParameter.ActualName = "Results";
|
|---|
| 177 |
|
|---|
| 178 | selector.Name = "Selector";
|
|---|
| 179 | selector.OperatorParameter.ActualName = "Selector";
|
|---|
| 180 |
|
|---|
| 181 | childrenCreator.ParentsPerChild = new IntValue(2);
|
|---|
| 182 |
|
|---|
| 183 | crossover.Name = "Crossover";
|
|---|
| 184 | crossover.OperatorParameter.ActualName = "Crossover";
|
|---|
| 185 |
|
|---|
| 186 | stochasticBranch.ProbabilityParameter.ActualName = "MutationProbability";
|
|---|
| 187 | stochasticBranch.RandomParameter.ActualName = "Random";
|
|---|
| 188 |
|
|---|
| 189 | mutator.Name = "Mutator";
|
|---|
| 190 | mutator.OperatorParameter.ActualName = "Mutator";
|
|---|
| 191 |
|
|---|
| 192 | evaluator.Name = "Evaluator";
|
|---|
| 193 | evaluator.OperatorParameter.ActualName = "Evaluator";
|
|---|
| 194 |
|
|---|
| 195 | subScopesRemover.RemoveAllSubScopes = true;
|
|---|
| 196 |
|
|---|
| 197 | bestSelector.CopySelected = new BoolValue(false);
|
|---|
| 198 | bestSelector.MaximizationParameter.ActualName = "Maximization";
|
|---|
| 199 | bestSelector.NumberOfSelectedSubScopesParameter.ActualName = "Elites";
|
|---|
| 200 | bestSelector.QualityParameter.ActualName = "Quality";
|
|---|
| 201 |
|
|---|
| 202 | intCounter.Increment = new IntValue(1);
|
|---|
| 203 | intCounter.ValueParameter.ActualName = "Generations";
|
|---|
| 204 |
|
|---|
| 205 | comparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
|
|---|
| 206 | comparator.LeftSideParameter.ActualName = "Generations";
|
|---|
| 207 | comparator.ResultParameter.ActualName = "Terminate";
|
|---|
| 208 | comparator.RightSideParameter.ActualName = "MaximumGenerations";
|
|---|
| 209 |
|
|---|
| 210 | bestQualityMemorizer3.BestQualityParameter.ActualName = "BestQuality";
|
|---|
| 211 | bestQualityMemorizer3.MaximizationParameter.ActualName = "Maximization";
|
|---|
| 212 | bestQualityMemorizer3.QualityParameter.ActualName = "Quality";
|
|---|
| 213 |
|
|---|
| 214 | bestQualityMemorizer4.BestQualityParameter.ActualName = "BestKnownQuality";
|
|---|
| 215 | bestQualityMemorizer4.MaximizationParameter.ActualName = "Maximization";
|
|---|
| 216 | bestQualityMemorizer4.QualityParameter.ActualName = "Quality";
|
|---|
| 217 |
|
|---|
| 218 | bestAverageWorstQualityCalculator2.AverageQualityParameter.ActualName = "CurrentAverageQuality";
|
|---|
| 219 | bestAverageWorstQualityCalculator2.BestQualityParameter.ActualName = "CurrentBestQuality";
|
|---|
| 220 | bestAverageWorstQualityCalculator2.MaximizationParameter.ActualName = "Maximization";
|
|---|
| 221 | bestAverageWorstQualityCalculator2.QualityParameter.ActualName = "Quality";
|
|---|
| 222 | bestAverageWorstQualityCalculator2.WorstQualityParameter.ActualName = "CurrentWorstQuality";
|
|---|
| 223 |
|
|---|
| 224 | dataTableValuesCollector2.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Best Quality", null, "CurrentBestQuality"));
|
|---|
| 225 | dataTableValuesCollector2.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Average Quality", null, "CurrentAverageQuality"));
|
|---|
| 226 | dataTableValuesCollector2.CollectedValues.Add(new LookupParameter<DoubleValue>("Current Worst Quality", null, "CurrentWorstQuality"));
|
|---|
| 227 | dataTableValuesCollector2.CollectedValues.Add(new LookupParameter<DoubleValue>("Best Quality", null, "BestQuality"));
|
|---|
| 228 | dataTableValuesCollector2.CollectedValues.Add(new LookupParameter<DoubleValue>("Best Known Quality", null, "BestKnownQuality"));
|
|---|
| 229 | dataTableValuesCollector2.DataTableParameter.ActualName = "Qualities";
|
|---|
| 230 |
|
|---|
| 231 | qualityDifferenceCalculator2.AbsoluteDifferenceParameter.ActualName = "AbsoluteDifferenceBestKnownToBest";
|
|---|
| 232 | qualityDifferenceCalculator2.FirstQualityParameter.ActualName = "BestKnownQuality";
|
|---|
| 233 | qualityDifferenceCalculator2.RelativeDifferenceParameter.ActualName = "RelativeDifferenceBestKnownToBest";
|
|---|
| 234 | qualityDifferenceCalculator2.SecondQualityParameter.ActualName = "BestQuality";
|
|---|
| 235 |
|
|---|
| 236 | conditionalBranch.ConditionParameter.ActualName = "Terminate";
|
|---|
| 237 | #endregion
|
|---|
| 238 |
|
|---|
| 239 | #region Create operator graph
|
|---|
| 240 | OperatorGraph.InitialOperator = variableCreator;
|
|---|
| 241 | variableCreator.Successor = bestQualityMemorizer1;
|
|---|
| 242 | bestQualityMemorizer1.Successor = bestQualityMemorizer2;
|
|---|
| 243 | bestQualityMemorizer2.Successor = bestAverageWorstQualityCalculator1;
|
|---|
| 244 | bestAverageWorstQualityCalculator1.Successor = dataTableValuesCollector1;
|
|---|
| 245 | dataTableValuesCollector1.Successor = qualityDifferenceCalculator1;
|
|---|
| 246 | qualityDifferenceCalculator1.Successor = resultsCollector;
|
|---|
| 247 | resultsCollector.Successor = selector;
|
|---|
| 248 | selector.Successor = sequentialSubScopesProcessor1;
|
|---|
| 249 | sequentialSubScopesProcessor1.Operators.Add(new EmptyOperator());
|
|---|
| 250 | sequentialSubScopesProcessor1.Operators.Add(childrenCreator);
|
|---|
| 251 | sequentialSubScopesProcessor1.Successor = sequentialSubScopesProcessor2;
|
|---|
| 252 | childrenCreator.Successor = uniformSequentialSubScopesProcessor;
|
|---|
| 253 | uniformSequentialSubScopesProcessor.Operator = crossover;
|
|---|
| 254 | uniformSequentialSubScopesProcessor.Successor = null;
|
|---|
| 255 | crossover.Successor = stochasticBranch;
|
|---|
| 256 | stochasticBranch.FirstBranch = mutator;
|
|---|
| 257 | stochasticBranch.SecondBranch = null;
|
|---|
| 258 | stochasticBranch.Successor = evaluator;
|
|---|
| 259 | mutator.Successor = null;
|
|---|
| 260 | evaluator.Successor = subScopesRemover;
|
|---|
| 261 | subScopesRemover.Successor = null;
|
|---|
| 262 | sequentialSubScopesProcessor2.Operators.Add(bestSelector);
|
|---|
| 263 | sequentialSubScopesProcessor2.Operators.Add(new EmptyOperator());
|
|---|
| 264 | sequentialSubScopesProcessor2.Successor = mergingReducer;
|
|---|
| 265 | bestSelector.Successor = rightReducer;
|
|---|
| 266 | rightReducer.Successor = null;
|
|---|
| 267 | mergingReducer.Successor = intCounter;
|
|---|
| 268 | intCounter.Successor = comparator;
|
|---|
| 269 | comparator.Successor = bestQualityMemorizer3;
|
|---|
| 270 | bestQualityMemorizer3.Successor = bestQualityMemorizer4;
|
|---|
| 271 | bestQualityMemorizer4.Successor = bestAverageWorstQualityCalculator2;
|
|---|
| 272 | bestAverageWorstQualityCalculator2.Successor = dataTableValuesCollector2;
|
|---|
| 273 | dataTableValuesCollector2.Successor = qualityDifferenceCalculator2;
|
|---|
| 274 | qualityDifferenceCalculator2.Successor = conditionalBranch;
|
|---|
| 275 | conditionalBranch.FalseBranch = selector;
|
|---|
| 276 | conditionalBranch.TrueBranch = null;
|
|---|
| 277 | conditionalBranch.Successor = null;
|
|---|
| 278 | #endregion
|
|---|
| 279 | }
|
|---|
| 280 | }
|
|---|
| 281 | }
|
|---|
