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 |
|
---|
22 | using System;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using System.Text;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
27 |
|
---|
28 | namespace HeuristicLab.Permutation {
|
---|
29 | /// <summary>
|
---|
30 | /// Manipulates a permutation array by swapping to randomly chosen elements.
|
---|
31 | /// </summary>
|
---|
32 | /// /// <remarks>
|
---|
33 | /// 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 />
|
---|
34 | /// </remarks>
|
---|
35 | [Item("Swap2Manipulator", "An operator which manipulates a permutation array by swapping to randomly chosen elements.")]
|
---|
36 | [EmptyStorableClass]
|
---|
37 | [Creatable("Test")]
|
---|
38 | public class Swap2Manipulator : PermutationManipulator {
|
---|
39 | /// <summary>
|
---|
40 | /// Swaps two randomly chosen elements in the given <paramref name="permutation"/> permutation.
|
---|
41 | /// </summary>
|
---|
42 | /// <param name="random">The random number generator.</param>
|
---|
43 | /// <param name="permutation">The permutation to manipulate.</param>
|
---|
44 | public static void Apply(IRandom random, Permutation permutation) {
|
---|
45 | int index1, index2, temp;
|
---|
46 |
|
---|
47 | index1 = random.Next(permutation.Length);
|
---|
48 | index2 = random.Next(permutation.Length);
|
---|
49 |
|
---|
50 | temp = permutation[index1];
|
---|
51 | permutation[index1] = permutation[index2];
|
---|
52 | permutation[index2] = temp;
|
---|
53 | }
|
---|
54 |
|
---|
55 | /// <summary>
|
---|
56 | /// Swaps two randomly chosen elements in the given <paramref name="permutation"/> array.
|
---|
57 | /// </summary>
|
---|
58 | /// <remarks>Calls <see cref="Apply"/>.</remarks>
|
---|
59 | /// <param name="random">A random number generator.</param>
|
---|
60 | /// <param name="permutation">The permutation to manipulate.</param>
|
---|
61 | protected override void Manipulate(IRandom random, Permutation permutation) {
|
---|
62 | Apply(random, permutation);
|
---|
63 | }
|
---|
64 | }
|
---|
65 | }
|
---|