source: branches/2839_HiveProjectManagement/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/InversionManipulator.cs @ 16057

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

#2839:

File size: 3.3 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.PermutationEncoding {
27  /// <summary>
28  /// An operator which inverts a randomly chosen part of a permutation.
29  /// </summary>
30  /// <remarks>
31  /// It is implemented as described in Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg.<br />
32  /// </remarks>
33  [Item("InversionManipulator", "An operator which inverts a randomly chosen part of a permutation. It is implemented as described in Eiben, A.E. and Smith, J.E. 2003. Introduction to Evolutionary Computation. Natural Computing Series, Springer-Verlag Berlin Heidelberg.")]
34  [StorableClass]
35  public class InversionManipulator : PermutationManipulator {
36    [StorableConstructor]
37    protected InversionManipulator(bool deserializing) : base(deserializing) { }
38    protected InversionManipulator(InversionManipulator original, Cloner cloner) : base(original, cloner) { }
39    public InversionManipulator() : base() { }
40
41    public override IDeepCloneable Clone(Cloner cloner) {
42      return new InversionManipulator(this, cloner);
43    }
44
45    /// <summary>
46    /// Inverts a randomly chosen part of a permutation.
47    /// </summary>
48    /// <param name="random">A random number generator.</param>
49    /// <param name="permutation">The permutation to manipulate.</param>
50    public static void Apply(IRandom random, Permutation permutation) {
51      int breakPoint1, breakPoint2;
52
53      breakPoint1 = random.Next(permutation.Length - 1);
54      do {
55        breakPoint2 = random.Next(permutation.Length - 1);
56      } while (breakPoint2 == breakPoint1);
57      if (breakPoint2 < breakPoint1) { int h = breakPoint1; breakPoint1 = breakPoint2; breakPoint2 = h; }
58      Apply(permutation, breakPoint1, breakPoint2);
59    }
60
61    public static void Apply(Permutation permutation, int breakPoint1, int breakPoint2) {
62      permutation.Reverse(breakPoint1, breakPoint2 - breakPoint1 + 1);
63    }
64
65    /// <summary>
66    /// Inverts a randomly chosen part of a permutation.
67    /// </summary>
68    /// <param name="random">A random number generator.</param>
69    /// <param name="permutation">The permutation to manipulate.</param>
70    protected override void Manipulate(IRandom random, Permutation permutation) {
71      Apply(random, permutation);
72    }
73  }
74}
Note: See TracBrowser for help on using the repository browser.