[2920] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2010 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.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Parameters;
|
---|
| 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 27 |
|
---|
[3053] | 28 | namespace HeuristicLab.Encodings.RealVectorEncoding {
|
---|
[2920] | 29 | /// <summary>
|
---|
| 30 | /// Performs the polynomial manipulation on all positions in the real vector.
|
---|
| 31 | /// </summary>
|
---|
| 32 | /// <remarks>
|
---|
| 33 | /// The polynomial manipulation is implemented as described in Deb, K. & Goyal, M. A. 1996. Combined Genetic Adaptive Search (GeneAS) for Engineering Design Computer Science and Informatics, 26, pp. 30-45.
|
---|
| 34 | /// It is performed on all positions of a real vector.
|
---|
| 35 | /// </remarks>
|
---|
| 36 | [Item("PolynomialAllPositionManipulator", "The polynomial manipulation is implemented as described in Deb, K. & Goyal, M. A. 1996. Combined Genetic Adaptive Search (GeneAS) for Engineering Design Computer Science and Informatics, 26, pp. 30-45. In this operator it is performed on all positions of the real vector.")]
|
---|
[3017] | 37 | [StorableClass]
|
---|
[2920] | 38 | public class PolynomialAllPositionManipulator : RealVectorManipulator {
|
---|
| 39 | /// <summary>
|
---|
| 40 | /// The contiguity parameter specifies the shape of the probability density function that controls the mutation. Setting it to 0 is similar to a uniform distribution over the entire manipulation range (specified by <see cref="MaximumManipulationParameter"/>.
|
---|
| 41 | /// A higher value will shape the density function such that values closer to 0 (little manipulation) are more likely than values closer to 1 or -1 (maximum manipulation).
|
---|
| 42 | /// </summary>
|
---|
[3048] | 43 | public ValueLookupParameter<DoubleValue> ContiguityParameter {
|
---|
| 44 | get { return (ValueLookupParameter<DoubleValue>)Parameters["Contiguity"]; }
|
---|
[2920] | 45 | }
|
---|
| 46 | /// <summary>
|
---|
| 47 | /// The maximum manipulation parameter specifies the range of the manipulation. The value specified here is the highest value the mutation will ever add to the current value.
|
---|
| 48 | /// </summary>
|
---|
| 49 | /// <remarks>
|
---|
| 50 | /// The manipulated value is not restricted by the (possibly) specified lower and upper bounds. Use the <see cref="BoundsChecker"/> to correct the values after performing the mutation.
|
---|
| 51 | /// </remarks>
|
---|
[3048] | 52 | public ValueLookupParameter<DoubleValue> MaximumManipulationParameter {
|
---|
| 53 | get { return (ValueLookupParameter<DoubleValue>)Parameters["MaximumManipulation"]; }
|
---|
[2920] | 54 | }
|
---|
| 55 |
|
---|
| 56 | /// <summary>
|
---|
| 57 | /// Initializes a new instance of <see cref="PolynomialAllPositionManipulator"/> with two parameters
|
---|
| 58 | /// (<c>Contiguity</c> and <c>MaximumManipulation</c>).
|
---|
| 59 | /// </summary>
|
---|
| 60 | public PolynomialAllPositionManipulator()
|
---|
| 61 | : base() {
|
---|
[3048] | 62 | Parameters.Add(new ValueLookupParameter<DoubleValue>("Contiguity", "Specifies whether the manipulation should produce far stretching (small value) or close (large value) manipulations with higher probability. Valid values must be greater or equal to 0.", new DoubleValue(2)));
|
---|
| 63 | Parameters.Add(new ValueLookupParameter<DoubleValue>("MaximumManipulation", "Specifies the maximum value that should be added or subtracted by the manipulation. If this value is set to 0 no mutation will be performed.", new DoubleValue(1)));
|
---|
[2920] | 64 | }
|
---|
| 65 |
|
---|
| 66 | /// <summary>
|
---|
| 67 | /// Performs the polynomial mutation on a single position in the real vector.
|
---|
| 68 | /// </summary>
|
---|
| 69 | /// <param name="random">The random number generator to use.</param>
|
---|
| 70 | /// <param name="vector">The vector that should be manipulated.</param>
|
---|
| 71 | /// <param name="contiguity">A parameter describing the shape of the probability density function which influences the strength of the manipulation.</param>
|
---|
| 72 | /// <param name="maxManipulation">The maximum strength of the manipulation.</param>
|
---|
[3048] | 73 | public static void Apply(IRandom random, DoubleArray vector, DoubleValue contiguity, DoubleValue maxManipulation) {
|
---|
[2920] | 74 | if (contiguity.Value < 0) throw new ArgumentException("PolynomialAllPositionManipulator: Contiguity value is smaller than 0", "contiguity");
|
---|
| 75 | double u, delta = 0;
|
---|
| 76 |
|
---|
| 77 | for (int index = 0; index < vector.Length; index++) {
|
---|
| 78 | u = random.NextDouble();
|
---|
| 79 | if (u < 0.5) {
|
---|
| 80 | delta = Math.Pow(2 * u, 1.0 / (contiguity.Value + 1)) - 1.0;
|
---|
| 81 | } else if (u > 0.5) {
|
---|
| 82 | delta = 1.0 - Math.Pow(2.0 - 2.0 * u, 1.0 / contiguity.Value + 1);
|
---|
| 83 | } else if (u == 0.5) delta = 0;
|
---|
| 84 |
|
---|
| 85 | vector[index] += delta * maxManipulation.Value;
|
---|
| 86 | }
|
---|
| 87 | }
|
---|
| 88 |
|
---|
| 89 | /// <summary>
|
---|
[3048] | 90 | /// Checks the availability of the parameters and forwards the call to <see cref="Apply(IRandom, DoubleArray, DoubleValue, DoubleValue)"/>.
|
---|
[2920] | 91 | /// </summary>
|
---|
| 92 | /// <param name="random">The random number generator to use.</param>
|
---|
| 93 | /// <param name="realVector">The vector of real values to manipulate.</param>
|
---|
[3048] | 94 | protected override void Manipulate(IRandom random, DoubleArray realVector) {
|
---|
[2920] | 95 | if (ContiguityParameter.ActualValue == null) throw new InvalidOperationException("PolynomialAllPositionManipulator: Parameter " + ContiguityParameter.ActualName + " could not be found.");
|
---|
| 96 | if (MaximumManipulationParameter.ActualValue == null) throw new InvalidOperationException("PolynomialAllPositionManipulator: Parameter " + MaximumManipulationParameter.ActualName + " could not be found.");
|
---|
| 97 | Apply(random, realVector, ContiguityParameter.ActualValue, MaximumManipulationParameter.ActualValue);
|
---|
| 98 | }
|
---|
| 99 | }
|
---|
| 100 | }
|
---|