Free cookie consent management tool by TermsFeed Policy Generator

source: stable/HeuristicLab.Problems.TestFunctions/3.3/Evaluators/RandomEvaluator.cs @ 9503

Last change on this file since 9503 was 9456, checked in by swagner, 11 years ago

Updated copyright year and added some missing license headers (#1889)

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