Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Permutation/3.3/Swap2Manipulator.cs @ 2880

Last change on this file since 2880 was 2871, checked in by abeham, 15 years ago

readded references to operator descriptions and updated documentation
added OrderCrossover2 to implement the behavior described in our book (this was the behavior of the former OrderCrossover)
added CyclicCrossover2 to implement the behavior described in our book (this was the behavior of the former CyclicCrossover)
implemented unit tests for the new variants
#889

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