1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2019 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.Common;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Data;
|
---|
25 | using HeuristicLab.Operators;
|
---|
26 | using HeuristicLab.Optimization;
|
---|
27 | using HeuristicLab.Parameters;
|
---|
28 | using HEAL.Fossil;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Encodings.IntegerVectorEncoding {
|
---|
31 | [Item("StdDevStrategyVectorCreator", "Creates the endogeneous strategy parameters.")]
|
---|
32 | [StorableType("3357CE2D-EC8C-4DD7-B51A-FA72D558EA91")]
|
---|
33 | public class StdDevStrategyVectorCreator : SingleSuccessorOperator, IStochasticOperator, IIntegerVectorStdDevStrategyParameterCreator {
|
---|
34 | public override bool CanChangeName {
|
---|
35 | get { return false; }
|
---|
36 | }
|
---|
37 | public ILookupParameter<IRandom> RandomParameter {
|
---|
38 | get { return (LookupParameter<IRandom>)Parameters["Random"]; }
|
---|
39 | }
|
---|
40 | public ILookupParameter<DoubleArray> StrategyParameterParameter {
|
---|
41 | get { return (ILookupParameter<DoubleArray>)Parameters["StrategyParameter"]; }
|
---|
42 | }
|
---|
43 | public IValueLookupParameter<IntValue> LengthParameter {
|
---|
44 | get { return (IValueLookupParameter<IntValue>)Parameters["Length"]; }
|
---|
45 | }
|
---|
46 | public IValueLookupParameter<DoubleMatrix> BoundsParameter {
|
---|
47 | get { return (IValueLookupParameter<DoubleMatrix>)Parameters["Bounds"]; }
|
---|
48 | }
|
---|
49 |
|
---|
50 | [StorableConstructor]
|
---|
51 | protected StdDevStrategyVectorCreator(StorableConstructorFlag _) : base(_) { }
|
---|
52 | protected StdDevStrategyVectorCreator(StdDevStrategyVectorCreator original, Cloner cloner) : base(original, cloner) { }
|
---|
53 | public StdDevStrategyVectorCreator()
|
---|
54 | : base() {
|
---|
55 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator to use."));
|
---|
56 | Parameters.Add(new LookupParameter<DoubleArray>("StrategyParameter", "The crossed strategy parameter."));
|
---|
57 | Parameters.Add(new ValueLookupParameter<IntValue>("Length", "The length of the vector."));
|
---|
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.", new DoubleMatrix(new double[,] { { 0, 5 } })));
|
---|
59 | }
|
---|
60 |
|
---|
61 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
62 | return new StdDevStrategyVectorCreator(this, cloner);
|
---|
63 | }
|
---|
64 |
|
---|
65 | public override IOperation Apply() {
|
---|
66 | StrategyParameterParameter.ActualValue = Randomize(RandomParameter.ActualValue, LengthParameter.ActualValue.Value, BoundsParameter.ActualValue);
|
---|
67 | return base.Apply();
|
---|
68 | }
|
---|
69 |
|
---|
70 | private DoubleArray Randomize(IRandom random, int length, DoubleMatrix bounds) {
|
---|
71 | var result = new DoubleArray(length);
|
---|
72 | for (int i = 0; i < length; i++) {
|
---|
73 | result[i] = random.NextDouble() * bounds[i % bounds.Rows, 1] - bounds[i % bounds.Rows, 0];
|
---|
74 | }
|
---|
75 | return result;
|
---|
76 | }
|
---|
77 | }
|
---|
78 | }
|
---|