File size: 2,004 Bytes
b1b3bae |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 |
/// ------------------------------------------------------
/// SwarmOps - Numeric and heuristic optimization for C#
/// Copyright (C) 2003-2011 Magnus Erik Hvass Pedersen.
/// Please see the file license.txt for license details.
/// SwarmOps on the internet: http://www.Hvass-Labs.org/
/// ------------------------------------------------------
using System.Diagnostics;
namespace SwarmOps.Problems
{
/// <summary>
/// Step benchmark problem.
/// </summary>
public class Step : Benchmark
{
/// <summary>
/// Construct the object.
/// </summary>
/// <param name="dimensionality">Dimensionality of the problem (e.g. 20)</param>
/// <param name="maxIterations">Max optimization iterations to perform.</param>
public Step(int dimensionality, int maxIterations)
: base(dimensionality, -100, 100, 50, 100, maxIterations)
{
}
#region Base-class overrides.
/// <summary>
/// Name of the optimization problem.
/// </summary>
public override string Name
{
get { return "Step"; }
}
/// <summary>
/// Minimum possible fitness.
/// </summary>
public override double MinFitness
{
get { return 0; }
}
/// <summary>
/// Compute and return fitness for the given parameters.
/// </summary>
/// <param name="x">Candidate solution.</param>
public override double Fitness(double[] x)
{
Debug.Assert(x != null && x.Length == Dimensionality);
double value = 0;
for (int i = 0; i < Dimensionality; i++)
{
double elm = x[i];
double roundedElm = System.Math.Truncate(elm);
value += roundedElm * roundedElm;
}
return value;
}
#endregion
}
}
|