[3078] | 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;
|
---|
[3376] | 23 | using HeuristicLab.Common;
|
---|
[3078] | 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Data;
|
---|
| 26 | using HeuristicLab.Operators;
|
---|
| 27 | using HeuristicLab.Optimization.Operators;
|
---|
| 28 | using HeuristicLab.Parameters;
|
---|
| 29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 30 | using HeuristicLab.Selection;
|
---|
| 31 |
|
---|
[3103] | 32 | namespace HeuristicLab.Algorithms.LocalSearch {
|
---|
[3078] | 33 | /// <summary>
|
---|
[3103] | 34 | /// An operator which represents a local search.
|
---|
[3078] | 35 | /// </summary>
|
---|
[3103] | 36 | [Item("LocalSearchMainLoop", "An operator which represents the main loop of a best improvement local search (if only a single move is generated in each iteration it is a first improvement local search).")]
|
---|
[3078] | 37 | [StorableClass]
|
---|
[3145] | 38 | public sealed class LocalSearchMainLoop : AlgorithmOperator {
|
---|
[3078] | 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 LookupParameter<DoubleValue> QualityParameter {
|
---|
| 47 | get { return (LookupParameter<DoubleValue>)Parameters["Quality"]; }
|
---|
| 48 | }
|
---|
[3134] | 49 | public ValueLookupParameter<DoubleValue> BestKnownQualityParameter {
|
---|
| 50 | get { return (ValueLookupParameter<DoubleValue>)Parameters["BestKnownQuality"]; }
|
---|
| 51 | }
|
---|
[3078] | 52 | public LookupParameter<DoubleValue> MoveQualityParameter {
|
---|
| 53 | get { return (LookupParameter<DoubleValue>)Parameters["MoveQuality"]; }
|
---|
| 54 | }
|
---|
| 55 | public ValueLookupParameter<IntValue> MaximumIterationsParameter {
|
---|
| 56 | get { return (ValueLookupParameter<IntValue>)Parameters["MaximumIterations"]; }
|
---|
| 57 | }
|
---|
| 58 | public ValueLookupParameter<VariableCollection> ResultsParameter {
|
---|
| 59 | get { return (ValueLookupParameter<VariableCollection>)Parameters["Results"]; }
|
---|
| 60 | }
|
---|
| 61 | public ValueLookupParameter<IOperator> MoveGeneratorParameter {
|
---|
| 62 | get { return (ValueLookupParameter<IOperator>)Parameters["MoveGenerator"]; }
|
---|
| 63 | }
|
---|
| 64 | public ValueLookupParameter<IOperator> MoveEvaluatorParameter {
|
---|
| 65 | get { return (ValueLookupParameter<IOperator>)Parameters["MoveEvaluator"]; }
|
---|
| 66 | }
|
---|
| 67 | public ValueLookupParameter<IOperator> MoveMakerParameter {
|
---|
| 68 | get { return (ValueLookupParameter<IOperator>)Parameters["MoveMaker"]; }
|
---|
| 69 | }
|
---|
[3621] | 70 | public ValueLookupParameter<IOperator> MoveAnalyzerParameter {
|
---|
| 71 | get { return (ValueLookupParameter<IOperator>)Parameters["MoveAnalyzer"]; }
|
---|
[3134] | 72 | }
|
---|
[3621] | 73 | public ValueLookupParameter<IOperator> AnalyzerParameter {
|
---|
| 74 | get { return (ValueLookupParameter<IOperator>)Parameters["Analyzer"]; }
|
---|
[3134] | 75 | }
|
---|
[3078] | 76 |
|
---|
| 77 | private ScopeParameter CurrentScopeParameter {
|
---|
| 78 | get { return (ScopeParameter)Parameters["CurrentScope"]; }
|
---|
| 79 | }
|
---|
| 80 | public IScope CurrentScope {
|
---|
| 81 | get { return CurrentScopeParameter.ActualValue; }
|
---|
| 82 | }
|
---|
| 83 | #endregion
|
---|
| 84 |
|
---|
[3145] | 85 | [StorableConstructor]
|
---|
| 86 | private LocalSearchMainLoop(bool deserializing) : base() { }
|
---|
[3103] | 87 | public LocalSearchMainLoop()
|
---|
[3078] | 88 | : base() {
|
---|
[3145] | 89 | Initialize();
|
---|
| 90 | }
|
---|
| 91 |
|
---|
| 92 | private void Initialize() {
|
---|
[3078] | 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 LookupParameter<DoubleValue>("Quality", "The value which represents the quality of a solution."));
|
---|
[3134] | 97 | Parameters.Add(new ValueLookupParameter<DoubleValue>("BestKnownQuality", "The best known quality value found so far."));
|
---|
[3078] | 98 | Parameters.Add(new LookupParameter<DoubleValue>("MoveQuality", "The value which represents the quality of a move."));
|
---|
| 99 | Parameters.Add(new ValueLookupParameter<IntValue>("MaximumIterations", "The maximum number of generations which should be processed."));
|
---|
| 100 | Parameters.Add(new ValueLookupParameter<VariableCollection>("Results", "The variable collection where results should be stored."));
|
---|
| 101 |
|
---|
| 102 | Parameters.Add(new ValueLookupParameter<IOperator>("MoveGenerator", "The operator that generates the moves."));
|
---|
| 103 | Parameters.Add(new ValueLookupParameter<IOperator>("MoveMaker", "The operator that performs a move and updates the quality."));
|
---|
| 104 | Parameters.Add(new ValueLookupParameter<IOperator>("MoveEvaluator", "The operator that evaluates a move."));
|
---|
[3134] | 105 |
|
---|
[3621] | 106 | Parameters.Add(new ValueLookupParameter<IOperator>("MoveAnalyzer", "The operator used to analyze the moves in each iteration."));
|
---|
| 107 | Parameters.Add(new ValueLookupParameter<IOperator>("Analyzer", "The operator used to analyze each iteration."));
|
---|
[3078] | 108 | Parameters.Add(new ScopeParameter("CurrentScope", "The current scope which represents a population of solutions on which the TS should be applied."));
|
---|
| 109 | #endregion
|
---|
| 110 |
|
---|
| 111 | #region Create operators
|
---|
| 112 | VariableCreator variableCreator = new VariableCreator();
|
---|
[3621] | 113 | ResultsCollector resultsCollector1 = new ResultsCollector();
|
---|
| 114 | UniformSubScopesProcessor uniformSubScopesProcessor0 = new UniformSubScopesProcessor();
|
---|
| 115 | Placeholder analyzer1 = new Placeholder();
|
---|
[3193] | 116 | UniformSubScopesProcessor mainProcessor = new UniformSubScopesProcessor();
|
---|
[3078] | 117 | Placeholder moveGenerator = new Placeholder();
|
---|
[3193] | 118 | UniformSubScopesProcessor moveEvaluationProcessor = new UniformSubScopesProcessor();
|
---|
[3078] | 119 | Placeholder moveEvaluator = new Placeholder();
|
---|
[3621] | 120 | Placeholder moveAnalyzer = new Placeholder();
|
---|
[3096] | 121 | BestSelector bestSelector = new BestSelector();
|
---|
[3078] | 122 | RightReducer rightReducer = new RightReducer();
|
---|
[3193] | 123 | UniformSubScopesProcessor moveMakingProcessor = new UniformSubScopesProcessor();
|
---|
[3078] | 124 | QualityComparator qualityComparator = new QualityComparator();
|
---|
| 125 | ConditionalBranch improvesQualityBranch = new ConditionalBranch();
|
---|
| 126 | Placeholder moveMaker = new Placeholder();
|
---|
| 127 | SubScopesRemover subScopesRemover = new SubScopesRemover();
|
---|
| 128 | IntCounter iterationsCounter = new IntCounter();
|
---|
| 129 | Comparator iterationsComparator = new Comparator();
|
---|
[3621] | 130 | ResultsCollector resultsCollector2 = new ResultsCollector();
|
---|
| 131 | UniformSubScopesProcessor uniformSubScopesProcessor1 = new UniformSubScopesProcessor();
|
---|
| 132 | Placeholder analyzer2 = new Placeholder();
|
---|
[3078] | 133 | ConditionalBranch iterationsTermination = new ConditionalBranch();
|
---|
| 134 |
|
---|
| 135 | variableCreator.CollectedValues.Add(new ValueParameter<IntValue>("Iterations", new IntValue(0)));
|
---|
| 136 |
|
---|
[3621] | 137 | resultsCollector1.CollectedValues.Add(new LookupParameter<IntValue>("Iterations"));
|
---|
| 138 | resultsCollector1.ResultsParameter.ActualName = ResultsParameter.Name;
|
---|
[3078] | 139 |
|
---|
[3621] | 140 | analyzer1.Name = "Analyzer (placeholder)";
|
---|
| 141 | analyzer1.OperatorParameter.ActualName = AnalyzerParameter.Name;
|
---|
[3134] | 142 |
|
---|
[3193] | 143 | mainProcessor.Name = "Solution processor (UniformSubScopesProcessor)";
|
---|
[3134] | 144 |
|
---|
[3078] | 145 | moveGenerator.Name = "MoveGenerator (placeholder)";
|
---|
[3143] | 146 | moveGenerator.OperatorParameter.ActualName = MoveGeneratorParameter.Name;
|
---|
[3078] | 147 |
|
---|
| 148 | moveEvaluator.Name = "MoveEvaluator (placeholder)";
|
---|
[3143] | 149 | moveEvaluator.OperatorParameter.ActualName = MoveEvaluatorParameter.Name;
|
---|
[3078] | 150 |
|
---|
[3621] | 151 | moveAnalyzer.Name = "MoveAnalyzer (placeholder)";
|
---|
| 152 | moveAnalyzer.OperatorParameter.ActualName = MoveAnalyzerParameter.Name;
|
---|
| 153 |
|
---|
[3096] | 154 | bestSelector.CopySelected = new BoolValue(false);
|
---|
[3143] | 155 | bestSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
|
---|
[3096] | 156 | bestSelector.NumberOfSelectedSubScopesParameter.Value = new IntValue(1);
|
---|
[3143] | 157 | bestSelector.QualityParameter.ActualName = MoveQualityParameter.Name;
|
---|
[3078] | 158 |
|
---|
[3193] | 159 | moveMakingProcessor.Name = "MoveMaking processor (UniformSubScopesProcessor)";
|
---|
[3078] | 160 |
|
---|
[3143] | 161 | qualityComparator.LeftSideParameter.ActualName = MoveQualityParameter.Name;
|
---|
| 162 | qualityComparator.RightSideParameter.ActualName = QualityParameter.Name;
|
---|
[3078] | 163 | qualityComparator.ResultParameter.ActualName = "IsBetter";
|
---|
| 164 |
|
---|
| 165 | improvesQualityBranch.ConditionParameter.ActualName = "IsBetter";
|
---|
| 166 |
|
---|
| 167 | moveMaker.Name = "MoveMaker (placeholder)";
|
---|
[3143] | 168 | moveMaker.OperatorParameter.ActualName = MoveMakerParameter.Name;
|
---|
[3078] | 169 |
|
---|
| 170 | subScopesRemover.RemoveAllSubScopes = true;
|
---|
| 171 |
|
---|
| 172 | iterationsCounter.Name = "Iterations Counter";
|
---|
| 173 | iterationsCounter.Increment = new IntValue(1);
|
---|
| 174 | iterationsCounter.ValueParameter.ActualName = "Iterations";
|
---|
| 175 |
|
---|
[3143] | 176 | iterationsComparator.Name = "Iterations >= MaximumIterations";
|
---|
| 177 | iterationsComparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
|
---|
[3078] | 178 | iterationsComparator.LeftSideParameter.ActualName = "Iterations";
|
---|
[3143] | 179 | iterationsComparator.RightSideParameter.ActualName = MaximumIterationsParameter.Name;
|
---|
| 180 | iterationsComparator.ResultParameter.ActualName = "Terminate";
|
---|
[3078] | 181 |
|
---|
[3621] | 182 | resultsCollector2.CollectedValues.Add(new LookupParameter<IntValue>("Iterations"));
|
---|
| 183 | resultsCollector2.ResultsParameter.ActualName = ResultsParameter.Name;
|
---|
[3134] | 184 |
|
---|
[3621] | 185 | analyzer2.Name = "Analyzer (placeholder)";
|
---|
| 186 | analyzer2.OperatorParameter.ActualName = AnalyzerParameter.Name;
|
---|
[3134] | 187 |
|
---|
[3078] | 188 | iterationsTermination.Name = "Iterations Termination Condition";
|
---|
[3143] | 189 | iterationsTermination.ConditionParameter.ActualName = "Terminate";
|
---|
[3078] | 190 | #endregion
|
---|
| 191 |
|
---|
| 192 | #region Create operator graph
|
---|
| 193 | OperatorGraph.InitialOperator = variableCreator;
|
---|
[3621] | 194 | variableCreator.Successor = resultsCollector1;
|
---|
| 195 | resultsCollector1.Successor = uniformSubScopesProcessor0;
|
---|
| 196 | uniformSubScopesProcessor0.Operator = analyzer1;
|
---|
| 197 | uniformSubScopesProcessor0.Successor = mainProcessor;
|
---|
| 198 | analyzer1.Successor = null;
|
---|
[3134] | 199 | mainProcessor.Operator = moveGenerator;
|
---|
[3078] | 200 | mainProcessor.Successor = iterationsCounter;
|
---|
| 201 | moveGenerator.Successor = moveEvaluationProcessor;
|
---|
| 202 | moveEvaluationProcessor.Operator = moveEvaluator;
|
---|
[3621] | 203 | moveEvaluationProcessor.Successor = moveAnalyzer;
|
---|
| 204 | moveAnalyzer.Successor = bestSelector;
|
---|
[3096] | 205 | bestSelector.Successor = rightReducer;
|
---|
[3078] | 206 | rightReducer.Successor = moveMakingProcessor;
|
---|
| 207 | moveMakingProcessor.Operator = qualityComparator;
|
---|
| 208 | moveMakingProcessor.Successor = subScopesRemover;
|
---|
[3134] | 209 | subScopesRemover.Successor = null;
|
---|
[3078] | 210 | qualityComparator.Successor = improvesQualityBranch;
|
---|
| 211 | improvesQualityBranch.TrueBranch = moveMaker;
|
---|
[3134] | 212 | improvesQualityBranch.FalseBranch = null;
|
---|
| 213 | improvesQualityBranch.Successor = null;
|
---|
| 214 | moveMaker.Successor = null;
|
---|
[3078] | 215 | iterationsCounter.Successor = iterationsComparator;
|
---|
[3621] | 216 | iterationsComparator.Successor = resultsCollector2;
|
---|
| 217 | resultsCollector2.Successor = uniformSubScopesProcessor1;
|
---|
| 218 | uniformSubScopesProcessor1.Operator = analyzer2;
|
---|
| 219 | uniformSubScopesProcessor1.Successor = iterationsTermination;
|
---|
| 220 | analyzer2.Successor = null;
|
---|
[3143] | 221 | iterationsTermination.TrueBranch = null;
|
---|
| 222 | iterationsTermination.FalseBranch = mainProcessor;
|
---|
[3078] | 223 | #endregion
|
---|
| 224 | }
|
---|
| 225 | }
|
---|
| 226 | }
|
---|