source: trunk/sources/HeuristicLab.Problems.TestFunctions/3.3/Evaluators/RandomEvaluator.cs @ 12012

Last change on this file since 12012 was 12012, checked in by ascheibe, 5 years ago

#2212 merged r12008, r12009, r12010 back into trunk

File size: 3.3 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 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.Encodings.RealVectorEncoding;
26using HeuristicLab.Optimization;
27using HeuristicLab.Parameters;
28using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
29
30namespace HeuristicLab.Problems.TestFunctions {
31  /// <summary>
32  /// A function that returns a random variable in [0;1) independent of the inputs.
33  /// </summary
34  [Item("RandomEvaluator", "Returns a random value in [0;1) that is independent of the inputs.")]
35  [StorableClass]
36  public class RandomEvaluator : SingleObjectiveTestFunctionProblemEvaluator, IStochasticOperator {
37    public override string FunctionName { get { return "Random"; } }
38    /// <summary>
39    /// It does not really matter.
40    /// </summary>
41    public override bool Maximization {
42      get { return false; }
43    }
44    /// <summary>
45    /// The minimum value that can be "found" is 0.
46    /// </summary>
47    public override double BestKnownQuality {
48      get { return 0; }
49    }
50    /// <summary>
51    /// Gets the lower and upper bound of the function.
52    /// </summary>
53    public override DoubleMatrix Bounds {
54      get { return new DoubleMatrix(new double[,] { { -100, 100 } }); }
55    }
56    /// <summary>
57    /// Gets the minimum problem size (1).
58    /// </summary>
59    public override int MinimumProblemSize {
60      get { return 1; }
61    }
62    /// <summary>
63    /// Gets the (theoretical) maximum problem size (2^31 - 1).
64    /// </summary>
65    public override int MaximumProblemSize {
66      get { return int.MaxValue; }
67    }
68
69    public ILookupParameter<IRandom> RandomParameter {
70      get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
71    }
72
73    [StorableConstructor]
74    protected RandomEvaluator(bool deserializing) : base(deserializing) { }
75    protected RandomEvaluator(RandomEvaluator original, Cloner cloner) : base(original, cloner) { }
76    public RandomEvaluator()
77      : base() {
78      Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator to use."));
79    }
80
81    public override IDeepCloneable Clone(Cloner cloner) {
82      return new RandomEvaluator(this, cloner);
83    }
84
85    public override RealVector GetBestKnownSolution(int dimension) {
86      return new RealVector(dimension);
87    }
88
89    public override double Evaluate(RealVector point) {
90      return ExecutionContext == null ? new System.Random().NextDouble() : RandomParameter.ActualValue.NextDouble();
91    }
92  }
93}
Note: See TracBrowser for help on using the repository browser.