Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Encodings.RealVectorEncoding/3.3/Manipulators/UniformOnePositionManipulator.cs @ 3187

Last change on this file since 3187 was 3182, checked in by abeham, 15 years ago

Updated real vector to check bounds after each crossover and manipulation #890

File size: 3.2 KB
Line 
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
22using System;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Parameters;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Encodings.RealVectorEncoding {
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_i, Maximum_i) in dimension i. 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    /// Changes randomly a single position in the given real <paramref name="vector"/>.
40    /// </summary>
41    /// <param name="random">A random number generator.</param>
42    /// <param name="vector">The real vector to manipulate.</param>
43    /// <param name="bounds">The lower and upper bound (1st and 2nd column) of the positions in the vector. If there are less rows than dimensions, the rows are cycled.</param>
44    public static void Apply(IRandom random, RealVector vector, DoubleMatrix bounds) {
45      int index = random.Next(vector.Length);
46      double min = bounds[index % bounds.Rows, 0];
47      double max = bounds[index % bounds.Rows, 1];
48      vector[index] = min + random.NextDouble() * (max - min);
49    }
50
51    /// <summary>
52    /// Checks if the bounds parameters is available and forwards the call to <see cref="Apply(IRandom, RealVector, DoubleMatrix)"/>.
53    /// </summary>
54    /// <param name="random">The random number generator to use.</param>
55    /// <param name="realVector">The real vector to manipulate.</param>
56    protected override void Manipulate(IRandom random, RealVector realVector) {
57      if (BoundsParameter.ActualValue == null) throw new InvalidOperationException("MichalewiczNonUniformOnePositionManipulator: Parameter " + BoundsParameter.ActualName + " could not be found.");
58      Apply(random, realVector, BoundsParameter.ActualValue);
59    }
60  }
61}
Note: See TracBrowser for help on using the repository browser.