Free cookie consent management tool by TermsFeed Policy Generator

source: branches/CloningRefactoring/HeuristicLab.Encodings.RealVectorEncoding/3.3/Moves/AdditiveMoveGenerator.cs @ 4672

Last change on this file since 4672 was 4672, checked in by abeham, 13 years ago

#922

  • Refactored HeuristicLab.Encodings.RealVectorEncoding
File size: 4.4 KB
Line 
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
22using HeuristicLab.Core;
23using HeuristicLab.Data;
24using HeuristicLab.Operators;
25using HeuristicLab.Optimization;
26using HeuristicLab.Parameters;
27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
28using HeuristicLab.Common;
29
30namespace HeuristicLab.Encodings.RealVectorEncoding {
31  [Item("AdditiveMoveGenerator", "Base class for all additive move generators.")]
32  [StorableClass]
33  public abstract class AdditiveMoveGenerator : SingleSuccessorOperator, IAdditiveRealVectorMoveOperator, IMoveGenerator, IStochasticOperator {
34    public override bool CanChangeName {
35      get { return false; }
36    }
37    public ILookupParameter<IRandom> RandomParameter {
38      get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
39    }
40    public ILookupParameter<RealVector> RealVectorParameter {
41      get { return (ILookupParameter<RealVector>)Parameters["RealVector"]; }
42    }
43    public ILookupParameter<AdditiveMove> AdditiveMoveParameter {
44      get { return (LookupParameter<AdditiveMove>)Parameters["AdditiveMove"]; }
45    }
46    protected ScopeParameter CurrentScopeParameter {
47      get { return (ScopeParameter)Parameters["CurrentScope"]; }
48    }
49    public IValueLookupParameter<DoubleMatrix> BoundsParameter {
50      get { return (IValueLookupParameter<DoubleMatrix>)Parameters["Bounds"]; }
51    }
52
53    [StorableConstructor]
54    protected AdditiveMoveGenerator(bool deserializing) : base(deserializing) { }
55    protected AdditiveMoveGenerator(AdditiveMoveGenerator original, Cloner cloner) : base(original, cloner) { }
56    public AdditiveMoveGenerator()
57      : base() {
58      Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
59      Parameters.Add(new LookupParameter<RealVector>("RealVector", "The real vector for which moves should be generated."));
60      Parameters.Add(new LookupParameter<AdditiveMove>("AdditiveMove", "The moves that should be generated in subscopes."));
61      Parameters.Add(new ScopeParameter("CurrentScope", "The current scope where the moves should be added as subscopes."));
62      Parameters.Add(new ValueLookupParameter<DoubleMatrix>("Bounds", "A 2 column matrix specifying the lower and upper bound for each dimension. If there are less rows than dimension the bounds vector is cycled."));
63    }
64
65    public override IDeepCloneable Clone(Cloner cloner) {
66      return new AdditiveMoveGenerator(this, cloner);
67    }
68
69    public override IOperation Apply() {
70      RealVector vector = RealVectorParameter.ActualValue;
71      AdditiveMove[] moves = GenerateMoves(RandomParameter.ActualValue, vector);
72      DoubleMatrix bounds = BoundsParameter.ActualValue;
73      if (bounds != null) {
74        for (int i = 0; i < moves.Length; i++) {
75          AdditiveMove move = moves[i];
76          if (vector[move.Dimension] + move.MoveDistance < bounds[move.Dimension % bounds.Rows, 0])
77            vector[move.Dimension] = bounds[move.Dimension % bounds.Rows, 0];
78          else if (vector[move.Dimension] + move.MoveDistance > bounds[move.Dimension % bounds.Rows, 1])
79            vector[move.Dimension] = bounds[move.Dimension % bounds.Rows, 1];
80        }
81      }
82      Scope[] moveScopes = new Scope[moves.Length];
83      for (int i = 0; i < moveScopes.Length; i++) {
84        moveScopes[i] = new Scope(i.ToString());
85        moveScopes[i].Variables.Add(new Variable(AdditiveMoveParameter.ActualName, moves[i]));
86      }
87      CurrentScopeParameter.ActualValue.SubScopes.AddRange(moveScopes);
88      return base.Apply();
89    }
90
91    protected abstract AdditiveMove[] GenerateMoves(IRandom random, RealVector realVector);
92  }
93}
Note: See TracBrowser for help on using the repository browser.