[3150] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[3154] | 3 | * Copyright (C) 2002-2010 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3150] | 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 System;
|
---|
[3376] | 23 | using HeuristicLab.Common;
|
---|
[3154] | 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Data;
|
---|
| 26 | using HeuristicLab.Encodings.RealVectorEncoding;
|
---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[3150] | 28 |
|
---|
[3170] | 29 | namespace HeuristicLab.Problems.TestFunctions {
|
---|
[3150] | 30 | /// <summary>
|
---|
[3315] | 31 | /// The Beale function is defined for 2 dimensions with an optimum of 0 at (3, 0.5).
|
---|
| 32 | /// It is implemented as described in Moré, J.J., Garbow, B., and Hillstrom, K. 1981. Testing unconstrained optimization software. ACM Transactions on Mathematical Software 7, pp. 136-140, ACM.
|
---|
[3150] | 33 | /// </summary>
|
---|
[3315] | 34 | [Item("BealeEvaluator", "Evaluates the Beale function on a given point. The optimum of this function is 0 at (3,0.5). It is implemented as described in Moré, J.J., Garbow, B., and Hillstrom, K. 1981. Testing unconstrained optimization software. ACM Transactions on Mathematical Software 7, pp. 136-140, ACM.")]
|
---|
[3154] | 35 | [StorableClass]
|
---|
[3170] | 36 | public class BealeEvaluator : SingleObjectiveTestFunctionProblemEvaluator {
|
---|
[3154] | 37 | /// <summary>
|
---|
| 38 | /// Returns false as the Beale function is a minimization problem.
|
---|
| 39 | /// </summary>
|
---|
| 40 | public override bool Maximization {
|
---|
| 41 | get { return false; }
|
---|
[3150] | 42 | }
|
---|
[3154] | 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 | }
|
---|
[3150] | 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>
|
---|
[3154] | 73 | public static double Apply(RealVector point) {
|
---|
[3315] | 74 | double x1 = point[0], x2 = point[1];
|
---|
| 75 | double f1 = 1.5 - x1 * (1 - x2);
|
---|
| 76 | double f2 = 2.25 - x1 * (1 - x2 * x2);
|
---|
| 77 | double f3 = 2.625 - x1 * (1 - x2 * x2 * x2);
|
---|
| 78 | return (f1 * f1) + (f2 * f2) + (f3 * f3);
|
---|
[3150] | 79 | }
|
---|
| 80 |
|
---|
| 81 | /// <summary>
|
---|
| 82 | /// Evaluates the test function for a specific <paramref name="point"/>.
|
---|
| 83 | /// </summary>
|
---|
| 84 | /// <remarks>Calls <see cref="Apply"/>.</remarks>
|
---|
| 85 | /// <param name="point">N-dimensional point for which the test function should be evaluated.</param>
|
---|
| 86 | /// <returns>The result value of the Beale function at the given point.</returns>
|
---|
[3154] | 87 | protected override double EvaluateFunction(RealVector point) {
|
---|
[3150] | 88 | return Apply(point);
|
---|
| 89 | }
|
---|
| 90 | }
|
---|
| 91 | }
|
---|