Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.TestFunctions/3.3/Evaluators/BealeEvaluator.cs @ 3170

Last change on this file since 3170 was 3170, checked in by abeham, 15 years ago

Changed name of test functions problem as discussed with swagner #934
the commit, it fails me, help me prof. smith with my adhoc solution

File size: 3.3 KB
Line 
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
22using System;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Encodings.RealVectorEncoding;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Problems.TestFunctions {
29  /// <summary>
30  /// Beale Function<br/>
31  /// Domain:  [-4.5 , 4.5]^2<br/>
32  /// Optimum: 0.0 at (3.0, 0.5)
33  /// </summary>
34  [Item("BealeEvaluator", "Evaluates the Beale function on a given point. The optimum of this function is 0 at (3,0.5).")]
35  [StorableClass]
36  public class BealeEvaluator : SingleObjectiveTestFunctionProblemEvaluator {
37    /// <summary>
38    /// Returns false as the Beale function is a minimization problem.
39    /// </summary>
40    public override bool Maximization {
41      get { return false; }
42    }
43    /// <summary>
44    /// Gets the optimum function value (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[,] { { -4.5, 4.5 } }); }
54    }
55    /// <summary>
56    /// Gets the minimum problem size (2).
57    /// </summary>
58    public override int MinimumProblemSize {
59      get { return 2; }
60    }
61    /// <summary>
62    /// Gets the maximum problem size (2).
63    /// </summary>
64    public override int MaximumProblemSize {
65      get { return 2; }
66    }
67
68    /// <summary>
69    /// Evaluates the test function for a specific <paramref name="point"/>.
70    /// </summary>
71    /// <param name="point">N-dimensional point for which the test function should be evaluated.</param>
72    /// <returns>The result value of the Beale function at the given point.</returns>
73    public static double Apply(RealVector point) {
74      return Math.Pow(1.5 - point[0] * (1 - point[1]), 2) + Math.Pow(2.25 - point[0] * (1 - (point[1] * point[1])), 2) + Math.Pow((2.625 - point[0] * (1 - (point[1] * point[1] * point[1]))), 2);
75    }
76
77    /// <summary>
78    /// Evaluates the test function for a specific <paramref name="point"/>.
79    /// </summary>
80    /// <remarks>Calls <see cref="Apply"/>.</remarks>
81    /// <param name="point">N-dimensional point for which the test function should be evaluated.</param>
82    /// <returns>The result value of the Beale function at the given point.</returns>
83    protected override double EvaluateFunction(RealVector point) {
84      return Apply(point);
85    }
86  }
87}
Note: See TracBrowser for help on using the repository browser.