Free cookie consent management tool by TermsFeed Policy Generator

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

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

Moved interfaces and classes for deep cloning from HeuristicLab.Core to HeuristicLab.Common (#975).

File size: 2.8 KB
RevLine 
[2]1#region License Information
2/* HeuristicLab
[2854]3 * Copyright (C) 2002-2010 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[2]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
[3376]22using HeuristicLab.Common;
[2]23using HeuristicLab.Core;
[2854]24using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
[2]25
[3053]26namespace HeuristicLab.Encodings.PermutationEncoding {
[850]27  /// <summary>
28  /// Manipulates a permutation array by swapping to randomly chosen elements.
29  /// </summary>
[2854]30  ///   /// <remarks>
[2871]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.
[2854]32  /// </remarks>
[2871]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.")]
[3017]34  [StorableClass]
[2854]35  public class Swap2Manipulator : PermutationManipulator {
[850]36    /// <summary>
[2854]37    /// Swaps two randomly chosen elements in the given <paramref name="permutation"/> permutation.
[850]38    /// </summary>
39    /// <param name="random">The random number generator.</param>
[2854]40    /// <param name="permutation">The permutation to manipulate.</param>
41    public static void Apply(IRandom random, Permutation permutation) {
[2]42      int index1, index2, temp;
43
[2854]44      index1 = random.Next(permutation.Length);
45      index2 = random.Next(permutation.Length);
[2]46
[2854]47      temp = permutation[index1];
48      permutation[index1] = permutation[index2];
49      permutation[index2] = temp;
[2]50    }
51
[850]52    /// <summary>
53    /// Swaps two randomly chosen elements in the given <paramref name="permutation"/> array.
54    /// </summary>
55    /// <remarks>Calls <see cref="Apply"/>.</remarks>
[2854]56    /// <param name="random">A random number generator.</param>
57    /// <param name="permutation">The permutation to manipulate.</param>
58    protected override void Manipulate(IRandom random, Permutation permutation) {
59      Apply(random, permutation);
[2]60    }
61  }
62}
Note: See TracBrowser for help on using the repository browser.