1
#region License Information
3 * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
5 * This file is part of HeuristicLab.
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.
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.
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/>.
22 using HeuristicLab
.Common
;
23 using HeuristicLab
.Core
;
26 namespace HeuristicLab
.Optimization
.Operators
{
28 /// Modifies the value by quadratic fall (slow fall initially, fast fall to the end) or rise (slow rise initally, fast rise to the end).
30 [Item("QuadraticDiscreteDoubleValueModifier", "Modifies the value by quadratic fall (slow fall initially, fast fall to the end) or rise (slow rise initally, fast rise to the end).")]
31 [StorableType("49CADD22-7074-4ADB-AA7B-36D03115FB1A")]
32 public class QuadraticDiscreteDoubleValueModifier
: DiscreteDoubleValueModifier
{
34 protected QuadraticDiscreteDoubleValueModifier(StorableConstructorFlag _
) : base(_
) { }
35 protected QuadraticDiscreteDoubleValueModifier(QuadraticDiscreteDoubleValueModifier original
, Cloner cloner
) : base(original
, cloner
) { }
36 public QuadraticDiscreteDoubleValueModifier() : base() { }
38 public override IDeepCloneable
Clone(Cloner cloner
) {
39 return new QuadraticDiscreteDoubleValueModifier(this, cloner
);
42 protected override double Modify(double value, double startValue
, double endValue
, int index
, int startIndex
, int endIndex
) {
43 return Apply(value, startValue
, endValue
, index
, startIndex
, endIndex
);
47 /// Calculates a new value based on quadratic decay or growth.
49 /// <param name="value">The previous value.</param>
50 /// <param name="startValue">The initial value.</param>
51 /// <param name="endValue">The final value.</param>
52 /// <param name="index">The current index.</param>
53 /// <param name="startIndex">The initial index.</param>
54 /// <param name="endIndex">The final index.</param>
55 /// <returns>The new value.</returns>
56 public static double Apply(double value, double startValue
, double endValue
, int index
, int startIndex
, int endIndex
) {
57 double a
= (endValue
- startValue
) / ((endIndex
- startIndex
) * (endIndex
- startIndex
));
58 return a
* (index
- startIndex
) * (index
- startIndex
) + startValue
;