1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2011 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 HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
26 |
|
---|
27 | namespace HeuristicLab.Optimization.Operators {
|
---|
28 | /// <summary>
|
---|
29 | /// Modifies the value by exponential fall (steep fall initially, slow fall to the end) or rise (slow rise initially, fast rise to the end).
|
---|
30 | /// </summary>
|
---|
31 | [Item("ExponentialDiscreteDoubleValueModifier", "Modifies the value by exponential fall (steep fall initially, slow fall to the end) or rise (slow rise initially, fast rise to the end).")]
|
---|
32 | [StorableClass]
|
---|
33 | public class ExponentialDiscreteDoubleValueModifier : DiscreteDoubleValueModifier {
|
---|
34 | [StorableConstructor]
|
---|
35 | protected ExponentialDiscreteDoubleValueModifier(bool deserializing) : base(deserializing) { }
|
---|
36 | protected ExponentialDiscreteDoubleValueModifier(ExponentialDiscreteDoubleValueModifier original, Cloner cloner) : base(original, cloner) { }
|
---|
37 | public ExponentialDiscreteDoubleValueModifier() : base() { }
|
---|
38 |
|
---|
39 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
40 | return new ExponentialDiscreteDoubleValueModifier(this, cloner);
|
---|
41 | }
|
---|
42 |
|
---|
43 | /// <summary>
|
---|
44 | /// Calculates a new value based on exponential decay or growth.
|
---|
45 | /// </summary>
|
---|
46 | /// <exception cref="ArgumentException">Thrown when endValue or startValue or both are 0.</exception>
|
---|
47 | /// <param name="value">The last value.</param>
|
---|
48 | /// <param name="startValue">The start value.</param>
|
---|
49 | /// <param name="endValue">The end value.</param>
|
---|
50 | /// <param name="index">The current index.</param>
|
---|
51 | /// <param name="startIndex">The start index.</param>
|
---|
52 | /// <param name="endIndex">The end index.</param>
|
---|
53 | /// <returns>The new value.</returns>
|
---|
54 | protected override double Modify(double value, double startValue, double endValue, int index, int startIndex, int endIndex) {
|
---|
55 | if (endValue <= 0 || startValue <= 0) throw new ArgumentException("ExponentialDiscreteDoubleValueModifier: startValue and endValue must be greater than 0.");
|
---|
56 | double b = Math.Pow(endValue / startValue, 1.0 / (endIndex - startIndex));
|
---|
57 | return startValue * Math.Pow(b, index - startIndex);
|
---|
58 | }
|
---|
59 | }
|
---|
60 | }
|
---|