Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.TestFunctions/GriewangkEvaluator.cs @ 51

Last change on this file since 51 was 2, checked in by swagner, 17 years ago

Added HeuristicLab 3.0 sources from former SVN repository at revision 52

File size: 1.7 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2008 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 System.Collections.Generic;
24using System.Text;
25using HeuristicLab.Core;
26using HeuristicLab.Data;
27using HeuristicLab.Operators;
28
29namespace HeuristicLab.TestFunctions {
30  public class GriewangkEvaluator : TestFunctionEvaluatorBase {
31    public override string Description {
32      get { return
33@"Griewangk Function
34
35Domain:  [-600.0 , 600.0]^n
36Optimum: 0.0 at (0, 0, ..., 0)";
37          }
38    }
39
40    protected override double EvaluateFunction(double[] point) {
41      double result = 0;
42      double val = 0;
43
44      for (int i = 0; i < point.Length; i++)
45        result += point[i] * point[i];
46      result = result / 4000;
47
48      val = Math.Cos(point[0]);
49      for (int i = 1; i < point.Length; i++)
50        val *= Math.Cos(point[i] / Math.Sqrt(i + 1));
51
52      result = result - val + 1;
53      return (result);
54    }
55  }
56}
Note: See TracBrowser for help on using the repository browser.