[3781] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17226] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3781] | 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 |
|
---|
[4068] | 22 | using HeuristicLab.Encodings.RealVectorEncoding;
|
---|
[3781] | 23 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
| 24 |
|
---|
[9764] | 25 | namespace HeuristicLab.Problems.TestFunctions.Tests {
|
---|
[4068] | 26 | /// <summary>
|
---|
| 27 | ///This is a test class for LevyEvaluatorTest and is intended
|
---|
| 28 | ///to contain all LevyEvaluatorTest Unit Tests
|
---|
| 29 | ///</summary>
|
---|
[3781] | 30 | [TestClass()]
|
---|
| 31 | public class LevyEvaluatorTest {
|
---|
| 32 | /// <summary>
|
---|
| 33 | ///A test for EvaluateFunction
|
---|
| 34 | ///</summary>
|
---|
[9775] | 35 | [TestMethod]
|
---|
[9782] | 36 | [TestCategory("Problems.TestFunctions")]
|
---|
| 37 | [TestProperty("Time", "short")]
|
---|
[3781] | 38 | public void LevyEvaluateFunctionTest() {
|
---|
[13408] | 39 | var target = new Levy();
|
---|
[3781] | 40 | RealVector point = null;
|
---|
| 41 | double expected = target.BestKnownQuality;
|
---|
| 42 | double actual;
|
---|
| 43 | for (int dimension = target.MinimumProblemSize; dimension <= System.Math.Min(10, target.MaximumProblemSize); dimension++) {
|
---|
| 44 | point = target.GetBestKnownSolution(dimension);
|
---|
[9410] | 45 | actual = target.Evaluate(point);
|
---|
[3781] | 46 | Assert.AreEqual(expected, actual);
|
---|
| 47 | }
|
---|
| 48 | }
|
---|
| 49 | }
|
---|
| 50 | }
|
---|