Free cookie consent management tool by TermsFeed Policy Generator

source: stable/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/Swap2Manipulator.cs @ 11826

Last change on this file since 11826 was 11170, checked in by ascheibe, 10 years ago

#2115 updated copyright year in stable branch

File size: 3.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2014 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  /// Manipulates a permutation array by swapping to randomly chosen elements.
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.
32  /// </remarks>
33  [Item("Swap2Manipulator", "An operator which manipulates a permutation array by swapping to randomly chosen elements. 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 Swap2Manipulator : PermutationManipulator {
36    [StorableConstructor]
37    protected Swap2Manipulator(bool deserializing) : base(deserializing) { }
38    protected Swap2Manipulator(Swap2Manipulator original, Cloner cloner) : base(original, cloner) { }
39    public Swap2Manipulator() : base() { }
40
41    public override IDeepCloneable Clone(Cloner cloner) {
42      return new Swap2Manipulator(this, cloner);
43    }
44
45    /// <summary>
46    /// Swaps two randomly chosen elements in the given <paramref name="permutation"/> permutation.
47    /// </summary>
48    /// <param name="random">The random number generator.</param>
49    /// <param name="permutation">The permutation to manipulate.</param>
50    public static void Apply(IRandom random, Permutation permutation) {
51      int index1, index2;
52
53      index1 = random.Next(permutation.Length);
54      index2 = random.Next(permutation.Length);
55
56      Apply(permutation, index1, index2);
57    }
58
59    public static void Apply(Permutation permutation, int index1, int index2) {
60      int temp = permutation[index1];
61      permutation[index1] = permutation[index2];
62      permutation[index2] = temp;
63    }
64
65    /// <summary>
66    /// Swaps two randomly chosen elements in the given <paramref name="permutation"/> array.
67    /// </summary>
68    /// <remarks>Calls <see cref="Apply"/>.</remarks>
69    /// <param name="random">A random number generator.</param>
70    /// <param name="permutation">The permutation to manipulate.</param>
71    protected override void Manipulate(IRandom random, Permutation permutation) {
72      Apply(random, permutation);
73    }
74  }
75}
Note: See TracBrowser for help on using the repository browser.