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 |
|
---|
28 | namespace HeuristicLab.Encodings.RealVector {
|
---|
29 | /// <summary>
|
---|
30 | /// Uniformly distributed change of a single position in a real vector.
|
---|
31 | /// </summary>
|
---|
32 | /// <remarks>
|
---|
33 | /// It is implemented as described in Michalewicz, Z. 1999. Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised and Extended Edition, Spring-Verlag Berlin Heidelberg.
|
---|
34 | /// </remarks>
|
---|
35 | [Item("UniformOnePositionManipulator", "Changes a single position in the vector by sampling uniformly from the interval [Minimum, Maximum). It is implemented as described in Michalewicz, Z. 1999. Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised and Extended Edition, Spring-Verlag Berlin Heidelberg.")]
|
---|
36 | [StorableClass]
|
---|
37 | public class UniformOnePositionManipulator : RealVectorManipulator {
|
---|
38 | /// <summary>
|
---|
39 | /// The lower bound of the values in the real vector.
|
---|
40 | /// </summary>
|
---|
41 | public ValueLookupParameter<DoubleData> MinimumParameter {
|
---|
42 | get { return (ValueLookupParameter<DoubleData>)Parameters["Minimum"]; }
|
---|
43 | }
|
---|
44 | /// <summary>
|
---|
45 | /// The upper bound of the values in the real vector.
|
---|
46 | /// </summary>
|
---|
47 | public ValueLookupParameter<DoubleData> MaximumParameter {
|
---|
48 | get { return (ValueLookupParameter<DoubleData>)Parameters["Maximum"]; }
|
---|
49 | }
|
---|
50 |
|
---|
51 | /// <summary>
|
---|
52 | /// Initializes a new instance of <see cref="UniformOnePositionManipulator"/> with two parameters
|
---|
53 | /// (<c>Minimum</c> and <c>Maximum</c>).
|
---|
54 | /// </summary>
|
---|
55 | public UniformOnePositionManipulator() {
|
---|
56 | Parameters.Add(new ValueLookupParameter<DoubleData>("Minimum", "Minimum of the sampling range for the vector element (included)"));
|
---|
57 | Parameters.Add(new ValueLookupParameter<DoubleData>("Maximum", "Maximum of the sampling range for the vector element (excluded)"));
|
---|
58 | }
|
---|
59 |
|
---|
60 | /// <summary>
|
---|
61 | /// Changes randomly a single position in the given real <paramref name="vector"/>.
|
---|
62 | /// </summary>
|
---|
63 | /// <param name="random">A random number generator.</param>
|
---|
64 | /// <param name="vector">The real vector to manipulate.</param>
|
---|
65 | /// <param name="min">The minimum value of the sampling range for
|
---|
66 | /// the vector element to change (inclusive).</param>
|
---|
67 | /// <param name="max">The maximum value of the sampling range for
|
---|
68 | /// the vector element to change (exclusive).</param>
|
---|
69 | public static void Apply(IRandom random, DoubleArrayData vector, DoubleData min, DoubleData max) {
|
---|
70 | int index = random.Next(vector.Length);
|
---|
71 | vector[index] = min.Value + random.NextDouble() * (max.Value - min.Value);
|
---|
72 | }
|
---|
73 |
|
---|
74 | /// <summary>
|
---|
75 | /// Checks if the minimum and maximum parameters are available and forwards the call to <see cref="Apply(IRandom, DoubleArrayData, DoubleData, DoubleData)"/>.
|
---|
76 | /// </summary>
|
---|
77 | /// <param name="random">The random number generator to use.</param>
|
---|
78 | /// <param name="realVector">The real vector to manipulate.</param>
|
---|
79 | protected override void Manipulate(IRandom random, DoubleArrayData realVector) {
|
---|
80 | if (MinimumParameter.ActualValue == null) throw new InvalidOperationException("UniformOnePositionManipulator: Parameter " + MinimumParameter.ActualName + " could not be found.");
|
---|
81 | if (MaximumParameter.ActualValue == null) throw new InvalidOperationException("UniformOnePositionManipulator: Parameter " + MaximumParameter.ActualName + " could not be found.");
|
---|
82 | Apply(random, realVector, MinimumParameter.ActualValue, MaximumParameter.ActualValue);
|
---|
83 | }
|
---|
84 | }
|
---|
85 | }
|
---|