| 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.Core;
|
|---|
| 23 | using HeuristicLab.Data;
|
|---|
| 24 | using HeuristicLab.Operators;
|
|---|
| 25 | using HeuristicLab.Optimization;
|
|---|
| 26 | using HeuristicLab.Parameters;
|
|---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
|---|
| 28 |
|
|---|
| 29 | namespace HeuristicLab.Encodings.RealVectorEncoding {
|
|---|
| 30 | [Item("AdditiveMoveGenerator", "Base class for all additive move generators.")]
|
|---|
| 31 | [StorableClass]
|
|---|
| 32 | public abstract class AdditiveMoveGenerator : SingleSuccessorOperator, IAdditiveRealVectorMoveOperator, IMoveGenerator, IStochasticOperator {
|
|---|
| 33 | public override bool CanChangeName {
|
|---|
| 34 | get { return false; }
|
|---|
| 35 | }
|
|---|
| 36 | public ILookupParameter<IRandom> RandomParameter {
|
|---|
| 37 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
|---|
| 38 | }
|
|---|
| 39 | public ILookupParameter<RealVector> RealVectorParameter {
|
|---|
| 40 | get { return (ILookupParameter<RealVector>)Parameters["RealVector"]; }
|
|---|
| 41 | }
|
|---|
| 42 | public ILookupParameter<AdditiveMove> AdditiveMoveParameter {
|
|---|
| 43 | get { return (LookupParameter<AdditiveMove>)Parameters["AdditiveMove"]; }
|
|---|
| 44 | }
|
|---|
| 45 | protected ScopeParameter CurrentScopeParameter {
|
|---|
| 46 | get { return (ScopeParameter)Parameters["CurrentScope"]; }
|
|---|
| 47 | }
|
|---|
| 48 | public IValueLookupParameter<DoubleMatrix> BoundsParameter {
|
|---|
| 49 | get { return (IValueLookupParameter<DoubleMatrix>)Parameters["Bounds"]; }
|
|---|
| 50 | }
|
|---|
| 51 |
|
|---|
| 52 | public AdditiveMoveGenerator()
|
|---|
| 53 | : base() {
|
|---|
| 54 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
|
|---|
| 55 | Parameters.Add(new LookupParameter<RealVector>("RealVector", "The real vector for which moves should be generated."));
|
|---|
| 56 | Parameters.Add(new LookupParameter<AdditiveMove>("AdditiveMove", "The moves that should be generated in subscopes."));
|
|---|
| 57 | Parameters.Add(new ScopeParameter("CurrentScope", "The current scope where the moves should be added as subscopes."));
|
|---|
| 58 | 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."));
|
|---|
| 59 | }
|
|---|
| 60 |
|
|---|
| 61 | public override IOperation Apply() {
|
|---|
| 62 | RealVector vector = RealVectorParameter.ActualValue;
|
|---|
| 63 | AdditiveMove[] moves = GenerateMoves(RandomParameter.ActualValue, vector);
|
|---|
| 64 | DoubleMatrix bounds = BoundsParameter.ActualValue;
|
|---|
| 65 | if (bounds != null) {
|
|---|
| 66 | for (int i = 0; i < moves.Length; i++) {
|
|---|
| 67 | AdditiveMove move = moves[i];
|
|---|
| 68 | if (vector[move.Dimension] + move.MoveDistance < bounds[move.Dimension % bounds.Rows, 0])
|
|---|
| 69 | vector[move.Dimension] = bounds[move.Dimension % bounds.Rows, 0];
|
|---|
| 70 | else if (vector[move.Dimension] + move.MoveDistance > bounds[move.Dimension % bounds.Rows, 1])
|
|---|
| 71 | vector[move.Dimension] = bounds[move.Dimension % bounds.Rows, 1];
|
|---|
| 72 | }
|
|---|
| 73 | }
|
|---|
| 74 | Scope[] moveScopes = new Scope[moves.Length];
|
|---|
| 75 | for (int i = 0; i < moveScopes.Length; i++) {
|
|---|
| 76 | moveScopes[i] = new Scope(i.ToString());
|
|---|
| 77 | moveScopes[i].Variables.Add(new Variable(AdditiveMoveParameter.ActualName, moves[i]));
|
|---|
| 78 | }
|
|---|
| 79 | CurrentScopeParameter.ActualValue.SubScopes.AddRange(moveScopes);
|
|---|
| 80 | return base.Apply();
|
|---|
| 81 | }
|
|---|
| 82 |
|
|---|
| 83 | protected abstract AdditiveMove[] GenerateMoves(IRandom random, RealVector realVector);
|
|---|
| 84 | }
|
|---|
| 85 | }
|
|---|
