Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/HeuristicLab.Problems.TestFunctions/3.3/Evaluators/ZakharovEvaluator.cs @ 17456

Last change on this file since 17456 was 17180, checked in by swagner, 5 years ago

#2875: Removed years in copyrights

File size: 4.3 KB
RevLine 
[3150]1#region License Information
2/* HeuristicLab
[17180]3 * Copyright (C) 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
[4722]22using HeuristicLab.Common;
[3154]23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Encodings.RealVectorEncoding;
[16565]26using HEAL.Attic;
[3150]27
[3170]28namespace HeuristicLab.Problems.TestFunctions {
[3150]29  /// <summary>
[3318]30  /// The Zakharov function is implemented as described in Hedar, A. & Fukushima, M. 2004. Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization. Optimization Methods and Software 19, pp. 291-308, Taylor & Francis.
[3150]31  /// </summary>
[3318]32  [Item("ZakharovEvaluator", "Evaluates the Zakharov function on a given point. The optimum of this function is 0 at the origin. It is implemented as described in Hedar, A. & Fukushima, M. 2004. Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization. Optimization Methods and Software 19, pp. 291-308, Taylor & Francis.")]
[16565]33  [StorableType("AB90340D-E5D0-4397-A5C3-8C7590F1727A")]
[3170]34  public class ZakharovEvaluator : SingleObjectiveTestFunctionProblemEvaluator {
[9980]35    public override string FunctionName { get { return "Zakharov"; } }
[3154]36    /// <summary>
[3318]37    /// Returns false as the Zakharov function is a minimization problem.
[3154]38    /// </summary>
39    public override bool Maximization {
40      get { return false; }
[3150]41    }
[3154]42    /// <summary>
43    /// Gets the optimum function value (0).
44    /// </summary>
45    public override double BestKnownQuality {
46      get { return 0; }
47    }
48    /// <summary>
49    /// Gets the lower and upper bound of the function.
50    /// </summary>
51    public override DoubleMatrix Bounds {
52      get { return new DoubleMatrix(new double[,] { { -5, 10 } }); }
53    }
54    /// <summary>
55    /// Gets the minimum problem size (1).
56    /// </summary>
57    public override int MinimumProblemSize {
58      get { return 1; }
59    }
60    /// <summary>
61    /// Gets the (theoretical) maximum problem size (2^31 - 1).
62    /// </summary>
63    public override int MaximumProblemSize {
64      get { return int.MaxValue; }
65    }
[3150]66
[3781]67    public override RealVector GetBestKnownSolution(int dimension) {
68      return new RealVector(dimension);
69    }
70
[4722]71    [StorableConstructor]
[16565]72    protected ZakharovEvaluator(StorableConstructorFlag _) : base(_) { }
[4722]73    protected ZakharovEvaluator(ZakharovEvaluator original, Cloner cloner) : base(original, cloner) { }
74    public ZakharovEvaluator() : base() { }
75
76    public override IDeepCloneable Clone(Cloner cloner) {
77      return new ZakharovEvaluator(this, cloner);
78    }
79
[3150]80    /// <summary>
81    /// Evaluates the test function for a specific <paramref name="point"/>.
82    /// </summary>
83    /// <param name="point">N-dimensional point for which the test function should be evaluated.</param>
84    /// <returns>The result value of the Zakharov function at the given point.</returns>
[3154]85    public static double Apply(RealVector point) {
[3150]86      int length = point.Length;
87      double s1 = 0;
88      double s2 = 0;
89
90      for (int i = 0; i < length; i++) {
[3318]91        s1 += point[i] * point[i];
92        s2 += 0.5 * i * point[i];
[3150]93      }
[3318]94      return s1 + (s2 * s2) + (s2 * s2 * s2 * s2);
[3150]95    }
96
97    /// <summary>
98    /// Evaluates the test function for a specific <paramref name="point"/>.
99    /// </summary>
100    /// <remarks>Calls <see cref="Apply"/>.</remarks>
101    /// <param name="point">N-dimensional point for which the test function should be evaluated.</param>
102    /// <returns>The result value of the Zakharov function at the given point.</returns>
[9407]103    public override double Evaluate(RealVector point) {
[3150]104      return Apply(point);
105    }
106  }
107}
Note: See TracBrowser for help on using the repository browser.