Free cookie consent management tool by TermsFeed Policy Generator

source: branches/VNS/HeuristicLab.Algorithms.LocalSearch/3.3/LocalSearchMainLoop.cs @ 5715

Last change on this file since 5715 was 5622, checked in by svonolfe, 14 years ago

Worked on VNS (#1425)
File size: 12.5 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2011 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 HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
29using HeuristicLab.Selection;
30
31namespace HeuristicLab.Algorithms.LocalSearch {
32  /// <summary>
33  /// An operator which represents a local search.
34  /// </summary>
35  [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).")]
36  [StorableClass]
37  public sealed class LocalSearchMainLoop : 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 LookupParameter<DoubleValue> QualityParameter {
46      get { return (LookupParameter<DoubleValue>)Parameters["Quality"]; }
47    }
48    public ValueLookupParameter<DoubleValue> BestKnownQualityParameter {
49      get { return (ValueLookupParameter<DoubleValue>)Parameters["BestKnownQuality"]; }
50    }
51    public LookupParameter<DoubleValue> MoveQualityParameter {
52      get { return (LookupParameter<DoubleValue>)Parameters["MoveQuality"]; }
53    }
54    public ValueLookupParameter<IntValue> MaximumIterationsParameter {
55      get { return (ValueLookupParameter<IntValue>)Parameters["MaximumIterations"]; }
56    }
57    public ValueLookupParameter<VariableCollection> ResultsParameter {
58      get { return (ValueLookupParameter<VariableCollection>)Parameters["Results"]; }
59    }
60    public ValueLookupParameter<IOperator> MoveGeneratorParameter {
61      get { return (ValueLookupParameter<IOperator>)Parameters["MoveGenerator"]; }
62    }
63    public ValueLookupParameter<IOperator> MoveEvaluatorParameter {
64      get { return (ValueLookupParameter<IOperator>)Parameters["MoveEvaluator"]; }
65    }
66    public ValueLookupParameter<IOperator> MoveMakerParameter {
67      get { return (ValueLookupParameter<IOperator>)Parameters["MoveMaker"]; }
68    }
69    public ValueLookupParameter<IOperator> AnalyzerParameter {
70      get { return (ValueLookupParameter<IOperator>)Parameters["Analyzer"]; }
71    }
72    public LookupParameter<IntValue> EvaluatedMovesParameter {
73      get { return (LookupParameter<IntValue>)Parameters["EvaluatedMoves"]; }
74    }
75    #endregion
76
77    [StorableConstructor]
78    private LocalSearchMainLoop(bool deserializing) : base(deserializing) { }
79    public LocalSearchMainLoop()
80      : base() {
81      Initialize(false);
82    }
83    public LocalSearchMainLoop(BoolValue nested)
84      : base() {
85      Initialize(nested.Value);
86    }
87    private LocalSearchMainLoop(LocalSearchMainLoop original, Cloner cloner)
88      : base(original, cloner) {
89    }
90    public override IDeepCloneable Clone(Cloner cloner) {
91      return new LocalSearchMainLoop(this, cloner);
92    }
93
94    private void Initialize(bool nested) {
95      #region Create parameters
96      Parameters.Add(new ValueLookupParameter<IRandom>("Random", "A pseudo random number generator."));
97      Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
98      Parameters.Add(new LookupParameter<DoubleValue>("Quality", "The value which represents the quality of a solution."));
99      Parameters.Add(new ValueLookupParameter<DoubleValue>("BestKnownQuality", "The best known quality value found so far."));
100      Parameters.Add(new LookupParameter<DoubleValue>("MoveQuality", "The value which represents the quality of a move."));
101      Parameters.Add(new ValueLookupParameter<IntValue>("MaximumIterations", "The maximum number of generations which should be processed."));
102      Parameters.Add(new ValueLookupParameter<VariableCollection>("Results", "The variable collection where results should be stored."));
103
104      Parameters.Add(new ValueLookupParameter<IOperator>("MoveGenerator", "The operator that generates the moves."));
105      Parameters.Add(new ValueLookupParameter<IOperator>("MoveMaker", "The operator that performs a move and updates the quality."));
106      Parameters.Add(new ValueLookupParameter<IOperator>("MoveEvaluator", "The operator that evaluates a move."));
107
108      Parameters.Add(new ValueLookupParameter<IOperator>("Analyzer", "The operator used to analyze the solution and moves."));
109      Parameters.Add(new LookupParameter<IntValue>("EvaluatedMoves", "The number of evaluated moves."));
110      #endregion
111
112      #region Create operators
113      VariableCreator variableCreator = new VariableCreator();
114      SubScopesProcessor subScopesProcessor0 = new SubScopesProcessor();
115      Assigner bestQualityInitializer = new Assigner();
116      Placeholder analyzer1 = new Placeholder();
117      ResultsCollector resultsCollector1 = new ResultsCollector();
118      SubScopesProcessor mainProcessor = new SubScopesProcessor();
119      Placeholder moveGenerator = new Placeholder();
120      UniformSubScopesProcessor moveEvaluationProcessor = new UniformSubScopesProcessor();
121      Placeholder moveEvaluator = new Placeholder();
122      SubScopesCounter subScopesCounter = new SubScopesCounter();
123      BestSelector bestSelector = new BestSelector();
124      SubScopesProcessor moveMakingProcessor = new SubScopesProcessor();
125      UniformSubScopesProcessor selectedMoveMakingProcessor = new UniformSubScopesProcessor();
126      QualityComparator qualityComparator = new QualityComparator();
127      ConditionalBranch improvesQualityBranch = new ConditionalBranch();
128      Placeholder moveMaker = new Placeholder();
129      Assigner bestQualityUpdater = new Assigner();
130      MergingReducer mergingReducer = new MergingReducer();
131      Placeholder analyzer2 = new Placeholder();
132      SubScopesRemover subScopesRemover = new SubScopesRemover();
133      IntCounter iterationsCounter = new IntCounter();
134      Comparator iterationsComparator = new Comparator();
135      ConditionalBranch iterationsTermination = new ConditionalBranch();
136
137      variableCreator.CollectedValues.Add(new ValueParameter<IntValue>("Iterations", new IntValue(0))); // Class LocalSearch expects this to be called Iterations
138      if (!nested) {
139        variableCreator.CollectedValues.Add(new ValueParameter<DoubleValue>("BestQuality", new DoubleValue(0)));
140      }
141
142      bestQualityInitializer.Name = "Initialize BestQuality";
143      bestQualityInitializer.LeftSideParameter.ActualName = "BestQuality";
144      bestQualityInitializer.RightSideParameter.ActualName = QualityParameter.Name;
145
146      analyzer1.Name = "Analyzer (placeholder)";
147      analyzer1.OperatorParameter.ActualName = AnalyzerParameter.Name;
148
149      resultsCollector1.CopyValue = new BoolValue(false);
150      resultsCollector1.CollectedValues.Add(new LookupParameter<IntValue>("Iterations"));
151      if (!nested) {
152        resultsCollector1.CollectedValues.Add(new LookupParameter<DoubleValue>("Best Quality", null, "BestQuality"));
153      }
154      resultsCollector1.ResultsParameter.ActualName = ResultsParameter.Name;
155
156      moveGenerator.Name = "MoveGenerator (placeholder)";
157      moveGenerator.OperatorParameter.ActualName = MoveGeneratorParameter.Name;
158
159      moveEvaluationProcessor.Parallel = new BoolValue(true);
160
161      moveEvaluator.Name = "MoveEvaluator (placeholder)";
162      moveEvaluator.OperatorParameter.ActualName = MoveEvaluatorParameter.Name;
163
164      subScopesCounter.Name = "Increment EvaluatedMoves";
165      subScopesCounter.ValueParameter.ActualName = EvaluatedMovesParameter.Name;
166
167      bestSelector.CopySelected = new BoolValue(false);
168      bestSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
169      bestSelector.NumberOfSelectedSubScopesParameter.Value = new IntValue(1);
170      bestSelector.QualityParameter.ActualName = MoveQualityParameter.Name;
171
172      qualityComparator.LeftSideParameter.ActualName = MoveQualityParameter.Name;
173      qualityComparator.RightSideParameter.ActualName = QualityParameter.Name;
174      qualityComparator.ResultParameter.ActualName = "IsBetter";
175
176      improvesQualityBranch.ConditionParameter.ActualName = "IsBetter";
177
178      moveMaker.Name = "MoveMaker (placeholder)";
179      moveMaker.OperatorParameter.ActualName = MoveMakerParameter.Name;
180
181      bestQualityUpdater.Name = "Update BestQuality";
182      bestQualityUpdater.LeftSideParameter.ActualName = "BestQuality";
183      bestQualityUpdater.RightSideParameter.ActualName = QualityParameter.Name;
184
185      analyzer2.Name = "Analyzer (placeholder)";
186      analyzer2.OperatorParameter.ActualName = AnalyzerParameter.Name;
187
188      subScopesRemover.RemoveAllSubScopes = true;
189
190      iterationsCounter.Name = "Iterations Counter";
191      iterationsCounter.Increment = new IntValue(1);
192      iterationsCounter.ValueParameter.ActualName = "Iterations";
193
194      iterationsComparator.Name = "Iterations >= MaximumIterations";
195      iterationsComparator.Comparison = new Comparison(ComparisonType.GreaterOrEqual);
196      iterationsComparator.LeftSideParameter.ActualName = "Iterations";
197      iterationsComparator.RightSideParameter.ActualName = MaximumIterationsParameter.Name;
198      iterationsComparator.ResultParameter.ActualName = "Terminate";
199
200      iterationsTermination.Name = "Iterations Termination Condition";
201      iterationsTermination.ConditionParameter.ActualName = "Terminate";
202      #endregion
203
204      #region Create operator graph
205      OperatorGraph.InitialOperator = variableCreator;
206      variableCreator.Successor = subScopesProcessor0;
207      if (!nested) {
208        subScopesProcessor0.Operators.Add(bestQualityInitializer);
209      } else {
210        subScopesProcessor0.Operators.Add(analyzer1);
211      }
212      subScopesProcessor0.Successor = resultsCollector1;
213      bestQualityInitializer.Successor = analyzer1;
214      analyzer1.Successor = null;
215      resultsCollector1.Successor = mainProcessor;
216      mainProcessor.Operators.Add(moveGenerator);
217      mainProcessor.Successor = iterationsCounter;
218      moveGenerator.Successor = moveEvaluationProcessor;
219      moveEvaluationProcessor.Operator = moveEvaluator;
220      moveEvaluationProcessor.Successor = subScopesCounter;
221      moveEvaluator.Successor = null;
222      subScopesCounter.Successor = bestSelector;
223      bestSelector.Successor = moveMakingProcessor;
224      moveMakingProcessor.Operators.Add(new EmptyOperator());
225      moveMakingProcessor.Operators.Add(selectedMoveMakingProcessor);
226      moveMakingProcessor.Successor = mergingReducer;
227      selectedMoveMakingProcessor.Operator = qualityComparator;
228      qualityComparator.Successor = improvesQualityBranch;
229      improvesQualityBranch.TrueBranch = moveMaker;
230      improvesQualityBranch.FalseBranch = null;
231      improvesQualityBranch.Successor = null;
232      if (!nested) {
233        moveMaker.Successor = bestQualityUpdater;
234      } else {
235        moveMaker.Successor = null;
236      }
237      bestQualityUpdater.Successor = null;
238      mergingReducer.Successor = analyzer2;
239      analyzer2.Successor = subScopesRemover;
240      subScopesRemover.Successor = null;
241      iterationsCounter.Successor = iterationsComparator;
242      iterationsComparator.Successor = iterationsTermination;
243      iterationsTermination.TrueBranch = null;
244      iterationsTermination.FalseBranch = mainProcessor;
245      #endregion
246    }
247
248    public override IOperation Apply() {
249      if (MoveGeneratorParameter.ActualValue == null || MoveEvaluatorParameter.ActualValue == null || MoveMakerParameter.ActualValue == null)
250        return null;
251      return base.Apply();
252    }
253  }
254}
Note: See TracBrowser for help on using the repository browser.