[13368] | 1 | #region License Information
|
---|
[3032] | 2 | /* HeuristicLab
|
---|
[12012] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3032] | 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;
|
---|
[3032] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Operators;
|
---|
| 26 | using HeuristicLab.Optimization;
|
---|
| 27 | using HeuristicLab.Parameters;
|
---|
| 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 29 |
|
---|
[3053] | 30 | namespace HeuristicLab.Encodings.IntegerVectorEncoding {
|
---|
[3032] | 31 | /// <summary>
|
---|
| 32 | /// A base class for operators creating int-valued vectors.
|
---|
| 33 | /// </summary>
|
---|
[3059] | 34 | [Item("IntegerVectorCreator", "A base class for operators creating int-valued vectors.")]
|
---|
[14711] | 35 | [StorableType("DC5D2847-F6F1-482D-8924-1DDA12342311")]
|
---|
[10291] | 36 | public abstract class IntegerVectorCreator : InstrumentedOperator, IIntegerVectorCreator, IStochasticOperator {
|
---|
[3520] | 37 | public override bool CanChangeName {
|
---|
| 38 | get { return false; }
|
---|
| 39 | }
|
---|
[3032] | 40 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 41 | get { return (LookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 42 | }
|
---|
[3059] | 43 | public ILookupParameter<IntegerVector> IntegerVectorParameter {
|
---|
| 44 | get { return (ILookupParameter<IntegerVector>)Parameters["IntegerVector"]; }
|
---|
[3032] | 45 | }
|
---|
[3048] | 46 | public IValueLookupParameter<IntValue> LengthParameter {
|
---|
| 47 | get { return (IValueLookupParameter<IntValue>)Parameters["Length"]; }
|
---|
[3032] | 48 | }
|
---|
[8019] | 49 | public IValueLookupParameter<IntMatrix> BoundsParameter {
|
---|
| 50 | get { return (IValueLookupParameter<IntMatrix>)Parameters["Bounds"]; }
|
---|
[3032] | 51 | }
|
---|
| 52 |
|
---|
[4722] | 53 | [StorableConstructor]
|
---|
| 54 | protected IntegerVectorCreator(bool deserializing) : base(deserializing) { }
|
---|
| 55 | protected IntegerVectorCreator(IntegerVectorCreator original, Cloner cloner) : base(original, cloner) { }
|
---|
[3059] | 56 | protected IntegerVectorCreator()
|
---|
[3032] | 57 | : base() {
|
---|
| 58 | Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator which should be used for stochastic manipulation operators."));
|
---|
[3059] | 59 | Parameters.Add(new LookupParameter<IntegerVector>("IntegerVector", "The vector which should be manipulated."));
|
---|
[3048] | 60 | Parameters.Add(new ValueLookupParameter<IntValue>("Length", "The length of the vector."));
|
---|
[8019] | 61 | Parameters.Add(new ValueLookupParameter<IntMatrix>("Bounds", "The bounds matrix can contain one row for each dimension with three columns specifying minimum (inclusive), maximum (exclusive), and step size. If less rows are given the matrix is cycled."));
|
---|
[3032] | 62 | }
|
---|
| 63 |
|
---|
[8019] | 64 | // BackwardsCompatibility3.3
|
---|
| 65 | #region Backwards compatible code, remove with 3.4
|
---|
| 66 | [StorableHook(HookType.AfterDeserialization)]
|
---|
| 67 | private void AfterDeserialization() {
|
---|
| 68 | if (!Parameters.ContainsKey("Bounds")) {
|
---|
| 69 | var min = ((IValueLookupParameter<IntValue>)Parameters["Minimum"]).Value as IntValue;
|
---|
| 70 | var max = ((IValueLookupParameter<IntValue>)Parameters["Maximum"]).Value as IntValue;
|
---|
| 71 | Parameters.Remove("Minimum");
|
---|
| 72 | Parameters.Remove("Maximum");
|
---|
| 73 | Parameters.Add(new ValueLookupParameter<IntMatrix>("Bounds", "The bounds matrix can contain one row for each dimension with three columns specifying minimum (inclusive), maximum (exclusive), and step size. If less rows are given the matrix is cycled."));
|
---|
| 74 | if (min != null && max != null) {
|
---|
| 75 | BoundsParameter.Value = new IntMatrix(new int[,] { { min.Value, max.Value, 1 } });
|
---|
| 76 | }
|
---|
| 77 | }
|
---|
| 78 | }
|
---|
| 79 | #endregion
|
---|
| 80 |
|
---|
[10291] | 81 | public sealed override IOperation InstrumentedApply() {
|
---|
[8019] | 82 | IntegerVectorParameter.ActualValue = Create(RandomParameter.ActualValue, LengthParameter.ActualValue, BoundsParameter.ActualValue);
|
---|
[10291] | 83 | return base.InstrumentedApply();
|
---|
[3032] | 84 | }
|
---|
| 85 |
|
---|
[8019] | 86 | protected abstract IntegerVector Create(IRandom random, IntValue length, IntMatrix bounds);
|
---|
[3032] | 87 | }
|
---|
| 88 | }
|
---|