File size: 2,146 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 |
/// ------------------------------------------------------
/// 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/
/// ------------------------------------------------------
namespace SwarmOps.Problems
{
/// <summary>
/// Helper-methods for Penalized benchmark problems.
/// </summary>
public abstract class Penalized : Benchmark
{
#region Constructors.
/// <summary>
/// Construct the object.
/// </summary>
/// <param name="dimensionality">Dimensionality of the problem.</param>
/// <param name="lowerBound">Lower boundary for entire search-space.</param>
/// <param name="upperBound">Upper boundary for entire search-space.</param>
/// <param name="lowerInit">Lower boundary for initialization.</param>
/// <param name="upperInit">Upper boundary for initialization.</param>
/// <param name="maxIterations">Max optimization iterations to perform.</param>
public Penalized(
int dimensionality,
double lowerBound,
double upperBound,
double lowerInit,
double upperInit,
int maxIterations)
: base(dimensionality, lowerBound, upperBound, lowerInit, upperInit, maxIterations)
{
}
#endregion
#region Penalize helper methods.
/// <summary>
/// Helper-method for Penalized benchmark problems.
/// </summary>
protected double U(double x, double a, double k, double m)
{
double value;
if (x < -a)
{
value = k * System.Math.Pow(-x - a, m);
}
else if (x > a)
{
value = k * System.Math.Pow(x - a, m);
}
else
{
value = 0;
}
return value;
}
#endregion
}
}
|