[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 |
|
---|
[4722] | 22 | using HeuristicLab.Common;
|
---|
[2830] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Operators;
|
---|
[3021] | 26 | using HeuristicLab.Optimization.Operators;
|
---|
[2830] | 27 | using HeuristicLab.Parameters;
|
---|
[3000] | 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[2830] | 29 | using HeuristicLab.Selection;
|
---|
| 30 |
|
---|
[3196] | 31 | namespace 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 | }
|
---|
[3659] | 45 | public ScopeTreeLookupParameter<DoubleValue> QualityParameter {
|
---|
| 46 | get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Quality"]; }
|
---|
[2830] | 47 | }
|
---|
[2882] | 48 | public ValueLookupParameter<IOperator> SelectorParameter {
|
---|
| 49 | get { return (ValueLookupParameter<IOperator>)Parameters["Selector"]; }
|
---|
[2830] | 50 | }
|
---|
[2882] | 51 | public ValueLookupParameter<IOperator> CrossoverParameter {
|
---|
| 52 | get { return (ValueLookupParameter<IOperator>)Parameters["Crossover"]; }
|
---|
| 53 | }
|
---|
[3095] | 54 | public ValueLookupParameter<PercentValue> MutationProbabilityParameter {
|
---|
| 55 | get { return (ValueLookupParameter<PercentValue>)Parameters["MutationProbability"]; }
|
---|
[2830] | 56 | }
|
---|
[2882] | 57 | public ValueLookupParameter<IOperator> MutatorParameter {
|
---|
| 58 | get { return (ValueLookupParameter<IOperator>)Parameters["Mutator"]; }
|
---|
[2830] | 59 | }
|
---|
[2882] | 60 | public ValueLookupParameter<IOperator> EvaluatorParameter {
|
---|
| 61 | get { return (ValueLookupParameter<IOperator>)Parameters["Evaluator"]; }
|
---|
[2830] | 62 | }
|
---|
[3048] | 63 | public ValueLookupParameter<IntValue> ElitesParameter {
|
---|
| 64 | get { return (ValueLookupParameter<IntValue>)Parameters["Elites"]; }
|
---|
[2830] | 65 | }
|
---|
[3048] | 66 | public ValueLookupParameter<IntValue> MaximumGenerationsParameter {
|
---|
| 67 | get { return (ValueLookupParameter<IntValue>)Parameters["MaximumGenerations"]; }
|
---|
[2830] | 68 | }
|
---|
[2882] | 69 | public ValueLookupParameter<VariableCollection> ResultsParameter {
|
---|
| 70 | get { return (ValueLookupParameter<VariableCollection>)Parameters["Results"]; }
|
---|
| 71 | }
|
---|
[3616] | 72 | public ValueLookupParameter<IOperator> AnalyzerParameter {
|
---|
| 73 | get { return (ValueLookupParameter<IOperator>)Parameters["Analyzer"]; }
|
---|
[3107] | 74 | }
|
---|
[2830] | 75 | private ScopeParameter CurrentScopeParameter {
|
---|
| 76 | get { return (ScopeParameter)Parameters["CurrentScope"]; }
|
---|
| 77 | }
|
---|
| 78 |
|
---|
| 79 | public IScope CurrentScope {
|
---|
| 80 | get { return CurrentScopeParameter.ActualValue; }
|
---|
| 81 | }
|
---|
| 82 | #endregion
|
---|
| 83 |
|
---|
[3080] | 84 | [StorableConstructor]
|
---|
[4722] | 85 | private GeneticAlgorithmMainLoop(bool deserializing) : base(deserializing) { }
|
---|
| 86 | private GeneticAlgorithmMainLoop(GeneticAlgorithmMainLoop original, Cloner cloner)
|
---|
| 87 | : base(original, cloner) {
|
---|
| 88 | }
|
---|
| 89 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 90 | return new GeneticAlgorithmMainLoop(this, cloner);
|
---|
| 91 | }
|
---|
[3198] | 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."));
|
---|
[3659] | 101 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The value which represents the quality of a solution."));
|
---|
[2882] | 102 | Parameters.Add(new ValueLookupParameter<IOperator>("Selector", "The operator used to select solutions for reproduction."));
|
---|
| 103 | Parameters.Add(new ValueLookupParameter<IOperator>("Crossover", "The operator used to cross solutions."));
|
---|
[3095] | 104 | Parameters.Add(new ValueLookupParameter<PercentValue>("MutationProbability", "The probability that the mutation operator is applied on a solution."));
|
---|
[2882] | 105 | Parameters.Add(new ValueLookupParameter<IOperator>("Mutator", "The operator used to mutate solutions."));
|
---|
[5208] | 106 | 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."));
|
---|
[3048] | 107 | Parameters.Add(new ValueLookupParameter<IntValue>("Elites", "The numer of elite solutions which are kept in each generation."));
|
---|
| 108 | Parameters.Add(new ValueLookupParameter<IntValue>("MaximumGenerations", "The maximum number of generations which should be processed."));
|
---|
[2882] | 109 | Parameters.Add(new ValueLookupParameter<VariableCollection>("Results", "The variable collection where results should be stored."));
|
---|
[3616] | 110 | Parameters.Add(new ValueLookupParameter<IOperator>("Analyzer", "The operator used to analyze each generation."));
|
---|
[3198] | 111 | Parameters.Add(new ScopeParameter("CurrentScope", "The current scope which represents a population of solutions on which the genetic algorithm should be applied."));
|
---|
[2830] | 112 | #endregion
|
---|
| 113 |
|
---|
[3080] | 114 | #region Create operators
|
---|
[2908] | 115 | VariableCreator variableCreator = new VariableCreator();
|
---|
[3616] | 116 | ResultsCollector resultsCollector1 = new ResultsCollector();
|
---|
| 117 | Placeholder analyzer1 = new Placeholder();
|
---|
[2882] | 118 | Placeholder selector = new Placeholder();
|
---|
[3193] | 119 | SubScopesProcessor subScopesProcessor1 = new SubScopesProcessor();
|
---|
[2830] | 120 | ChildrenCreator childrenCreator = new ChildrenCreator();
|
---|
[5208] | 121 | UniformSubScopesProcessor uniformSubScopesProcessor1 = new UniformSubScopesProcessor();
|
---|
[2830] | 122 | Placeholder crossover = new Placeholder();
|
---|
| 123 | StochasticBranch stochasticBranch = new StochasticBranch();
|
---|
| 124 | Placeholder mutator = new Placeholder();
|
---|
[5208] | 125 | SubScopesRemover subScopesRemover = new SubScopesRemover();
|
---|
| 126 | UniformSubScopesProcessor uniformSubScopesProcessor2 = new UniformSubScopesProcessor();
|
---|
[2830] | 127 | Placeholder evaluator = new Placeholder();
|
---|
[3193] | 128 | SubScopesProcessor subScopesProcessor2 = new SubScopesProcessor();
|
---|
[3096] | 129 | BestSelector bestSelector = new BestSelector();
|
---|
[2830] | 130 | RightReducer rightReducer = new RightReducer();
|
---|
| 131 | MergingReducer mergingReducer = new MergingReducer();
|
---|
| 132 | IntCounter intCounter = new IntCounter();
|
---|
| 133 | Comparator comparator = new Comparator();
|
---|
[3616] | 134 | ResultsCollector resultsCollector2 = new ResultsCollector();
|
---|
| 135 | Placeholder analyzer2 = new Placeholder();
|
---|
[2830] | 136 | ConditionalBranch conditionalBranch = new ConditionalBranch();
|
---|
| 137 |
|
---|
[3750] | 138 | variableCreator.CollectedValues.Add(new ValueParameter<IntValue>("Generations", new IntValue(0))); // Class GeneticAlgorithm expects this to be called Generations
|
---|
[2908] | 139 |
|
---|
[3616] | 140 | resultsCollector1.CollectedValues.Add(new LookupParameter<IntValue>("Generations"));
|
---|
| 141 | resultsCollector1.ResultsParameter.ActualName = "Results";
|
---|
[3080] | 142 |
|
---|
[3616] | 143 | analyzer1.Name = "Analyzer";
|
---|
| 144 | analyzer1.OperatorParameter.ActualName = "Analyzer";
|
---|
[3095] | 145 |
|
---|
[2882] | 146 | selector.Name = "Selector";
|
---|
| 147 | selector.OperatorParameter.ActualName = "Selector";
|
---|
[2830] | 148 |
|
---|
[3048] | 149 | childrenCreator.ParentsPerChild = new IntValue(2);
|
---|
[2830] | 150 |
|
---|
[2882] | 151 | crossover.Name = "Crossover";
|
---|
| 152 | crossover.OperatorParameter.ActualName = "Crossover";
|
---|
[2830] | 153 |
|
---|
| 154 | stochasticBranch.ProbabilityParameter.ActualName = "MutationProbability";
|
---|
| 155 | stochasticBranch.RandomParameter.ActualName = "Random";
|
---|
| 156 |
|
---|
[2882] | 157 | mutator.Name = "Mutator";
|
---|
| 158 | mutator.OperatorParameter.ActualName = "Mutator";
|
---|
[2830] | 159 |
|
---|
[5208] | 160 | subScopesRemover.RemoveAllSubScopes = true;
|
---|
| 161 |
|
---|
| 162 | uniformSubScopesProcessor2.Parallel.Value = true;
|
---|
| 163 |
|
---|
[2882] | 164 | evaluator.Name = "Evaluator";
|
---|
| 165 | evaluator.OperatorParameter.ActualName = "Evaluator";
|
---|
[2830] | 166 |
|
---|
[3096] | 167 | bestSelector.CopySelected = new BoolValue(false);
|
---|
| 168 | bestSelector.MaximizationParameter.ActualName = "Maximization";
|
---|
| 169 | bestSelector.NumberOfSelectedSubScopesParameter.ActualName = "Elites";
|
---|
| 170 | bestSelector.QualityParameter.ActualName = "Quality";
|
---|
[2830] | 171 |
|
---|
[3048] | 172 | intCounter.Increment = new IntValue(1);
|
---|
[2830] | 173 | intCounter.ValueParameter.ActualName = "Generations";
|
---|
| 174 |
|
---|
[3048] | 175 | comparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
|
---|
[2830] | 176 | comparator.LeftSideParameter.ActualName = "Generations";
|
---|
| 177 | comparator.ResultParameter.ActualName = "Terminate";
|
---|
| 178 | comparator.RightSideParameter.ActualName = "MaximumGenerations";
|
---|
| 179 |
|
---|
[3616] | 180 | resultsCollector2.CollectedValues.Add(new LookupParameter<IntValue>("Generations"));
|
---|
| 181 | resultsCollector2.ResultsParameter.ActualName = "Results";
|
---|
[2891] | 182 |
|
---|
[3616] | 183 | analyzer2.Name = "Analyzer";
|
---|
| 184 | analyzer2.OperatorParameter.ActualName = "Analyzer";
|
---|
[3095] | 185 |
|
---|
[2830] | 186 | conditionalBranch.ConditionParameter.ActualName = "Terminate";
|
---|
[3080] | 187 | #endregion
|
---|
| 188 |
|
---|
| 189 | #region Create operator graph
|
---|
| 190 | OperatorGraph.InitialOperator = variableCreator;
|
---|
[3616] | 191 | variableCreator.Successor = resultsCollector1;
|
---|
| 192 | resultsCollector1.Successor = analyzer1;
|
---|
| 193 | analyzer1.Successor = selector;
|
---|
[3193] | 194 | selector.Successor = subScopesProcessor1;
|
---|
| 195 | subScopesProcessor1.Operators.Add(new EmptyOperator());
|
---|
| 196 | subScopesProcessor1.Operators.Add(childrenCreator);
|
---|
| 197 | subScopesProcessor1.Successor = subScopesProcessor2;
|
---|
[5208] | 198 | childrenCreator.Successor = uniformSubScopesProcessor1;
|
---|
| 199 | uniformSubScopesProcessor1.Operator = crossover;
|
---|
| 200 | uniformSubScopesProcessor1.Successor = uniformSubScopesProcessor2;
|
---|
[3080] | 201 | crossover.Successor = stochasticBranch;
|
---|
| 202 | stochasticBranch.FirstBranch = mutator;
|
---|
| 203 | stochasticBranch.SecondBranch = null;
|
---|
[5208] | 204 | stochasticBranch.Successor = subScopesRemover;
|
---|
[3080] | 205 | mutator.Successor = null;
|
---|
| 206 | subScopesRemover.Successor = null;
|
---|
[5208] | 207 | uniformSubScopesProcessor2.Operator = evaluator;
|
---|
| 208 | uniformSubScopesProcessor2.Successor = null;
|
---|
| 209 | evaluator.Successor = null;
|
---|
[3193] | 210 | subScopesProcessor2.Operators.Add(bestSelector);
|
---|
| 211 | subScopesProcessor2.Operators.Add(new EmptyOperator());
|
---|
| 212 | subScopesProcessor2.Successor = mergingReducer;
|
---|
[3096] | 213 | bestSelector.Successor = rightReducer;
|
---|
[3080] | 214 | rightReducer.Successor = null;
|
---|
| 215 | mergingReducer.Successor = intCounter;
|
---|
| 216 | intCounter.Successor = comparator;
|
---|
[3616] | 217 | comparator.Successor = resultsCollector2;
|
---|
| 218 | resultsCollector2.Successor = analyzer2;
|
---|
| 219 | analyzer2.Successor = conditionalBranch;
|
---|
[3096] | 220 | conditionalBranch.FalseBranch = selector;
|
---|
[2830] | 221 | conditionalBranch.TrueBranch = null;
|
---|
| 222 | conditionalBranch.Successor = null;
|
---|
| 223 | #endregion
|
---|
| 224 | }
|
---|
[3715] | 225 |
|
---|
| 226 | public override IOperation Apply() {
|
---|
| 227 | if (CrossoverParameter.ActualValue == null)
|
---|
| 228 | return null;
|
---|
| 229 | return base.Apply();
|
---|
| 230 | }
|
---|
[2830] | 231 | }
|
---|
| 232 | }
|
---|