source: branches/2839_HiveProjectManagement/HeuristicLab.Encodings.BinaryVectorEncoding/3.3/Manipulators/SinglePositionBitflipManipulator.cs @ 16057

Last change on this file since 16057 was 16057, checked in by jkarder, 16 months ago

#2839:

File size: 3.0 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2018 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 HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
25
26namespace HeuristicLab.Encodings.BinaryVectorEncoding {
27  /// <summary>
28  /// Flips exactly one bit of a binary vector.
29  /// </summary>
30  /// <remarks>
31  /// It is implemented as described in Michalewicz, Z. 1999. Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised and Extended Edition, Spring-Verlag Berlin Heidelberg.
32  /// </remarks>
33  [Item("SinglePositionBitflipManipulator", "Flips exactly one bit of a binary vector. 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  [StorableClass]
35  public sealed class SinglePositionBitflipManipulator : BinaryVectorManipulator {
36
37    [StorableConstructor]
38    private SinglePositionBitflipManipulator(bool deserializing) : base(deserializing) { }
39    private SinglePositionBitflipManipulator(SinglePositionBitflipManipulator original, Cloner cloner) : base(original, cloner) { }
40    public SinglePositionBitflipManipulator() : base() { }
41
42    public override IDeepCloneable Clone(Cloner cloner) {
43      return new SinglePositionBitflipManipulator(this, cloner);
44    }
45
46    /// <summary>
47    /// Performs the single position bitflip mutation on a binary vector.
48    /// </summary>
49    /// <param name="random">The random number generator to use.</param>
50    /// <param name="vector">The vector that should be manipulated.</param>
51    public static void Apply(IRandom random, BinaryVector vector) {
52      int position = random.Next(vector.Length);
53
54      vector[position] = !vector[position];
55    }
56
57    /// <summary>
58    /// Forwards the call to <see cref="Apply(IRandom, BinaryVector)"/>.
59    /// </summary>
60    /// <param name="random">The random number generator to use.</param>
61    /// <param name="realVector">The vector of binary values to manipulate.</param>
62    protected override void Manipulate(IRandom random, BinaryVector binaryVector) {
63      Apply(random, binaryVector);
64    }
65  }
66}
Note: See TracBrowser for help on using the repository browser.