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 |
|
---|
22 | using System;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using System.Text;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Data;
|
---|
27 | using HeuristicLab.Operators;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.TestFunctions {
|
---|
30 | public class AckleyEvaluator : TestFunctionEvaluatorBase {
|
---|
31 | public override string Description {
|
---|
32 | get { return
|
---|
33 | @"Ackley Function
|
---|
34 |
|
---|
35 | Domain: [-32.768 , 32.768]^n
|
---|
36 | Optimum: 0.0 at (0, 0, ..., 0)";
|
---|
37 | }
|
---|
38 | }
|
---|
39 |
|
---|
40 | protected override double EvaluateFunction(double[] point) {
|
---|
41 | double result = 20 + Math.E;
|
---|
42 | double val;
|
---|
43 |
|
---|
44 | val = 0;
|
---|
45 | for (int i = 0; i < point.Length; i++)
|
---|
46 | val += point[i] * point[i];
|
---|
47 | val *= 1.0 / point.Length;
|
---|
48 | val = Math.Sqrt(val);
|
---|
49 | val *= -0.2;
|
---|
50 | result -= 20 * Math.Exp(val);
|
---|
51 |
|
---|
52 | val = 0;
|
---|
53 | for (int i = 0; i < point.Length; i++)
|
---|
54 | val += Math.Cos(2 * Math.PI * point[i]);
|
---|
55 | val *= 1.0 / point.Length;
|
---|
56 | result -= Math.Exp(val);
|
---|
57 | return (result);
|
---|
58 | }
|
---|
59 | }
|
---|
60 | }
|
---|