Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Encodings.PermutationEncoding/3.3/Manipulators/Swap2Manipulator.cs @ 3160

Last change on this file since 3160 was 3160, checked in by swagner, 14 years ago

Removed Creatable test attribute (#935).

File size: 2.7 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 HeuristicLab.Core;
23using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
24
25namespace HeuristicLab.Encodings.PermutationEncoding {
26  /// <summary>
27  /// Manipulates a permutation array by swapping to randomly chosen elements.
28  /// </summary>
29  ///   /// <remarks>
30  /// 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.
31  /// </remarks>
32  [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.")]
33  [StorableClass]
34  public class Swap2Manipulator : PermutationManipulator {
35    /// <summary>
36    /// Swaps two randomly chosen elements in the given <paramref name="permutation"/> permutation.
37    /// </summary>
38    /// <param name="random">The random number generator.</param>
39    /// <param name="permutation">The permutation to manipulate.</param>
40    public static void Apply(IRandom random, Permutation permutation) {
41      int index1, index2, temp;
42
43      index1 = random.Next(permutation.Length);
44      index2 = random.Next(permutation.Length);
45
46      temp = permutation[index1];
47      permutation[index1] = permutation[index2];
48      permutation[index2] = temp;
49    }
50
51    /// <summary>
52    /// Swaps two randomly chosen elements in the given <paramref name="permutation"/> array.
53    /// </summary>
54    /// <remarks>Calls <see cref="Apply"/>.</remarks>
55    /// <param name="random">A random number generator.</param>
56    /// <param name="permutation">The permutation to manipulate.</param>
57    protected override void Manipulate(IRandom random, Permutation permutation) {
58      Apply(random, permutation);
59    }
60  }
61}
Note: See TracBrowser for help on using the repository browser.