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 HeuristicLab.Core;
|
---|
23 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
24 |
|
---|
25 | namespace HeuristicLab.Encodings.Permutation {
|
---|
26 | /// <summary>
|
---|
27 | /// Manipulates a permutation array by moving randomly one element to another position in the array.
|
---|
28 | /// </summary>
|
---|
29 | /// <remarks>
|
---|
30 | /// It is implemented as described in Fogel, D.B. (1988). An Evolutionary Approach to the Traveling Salesman Problem, Biological Cybernetics, 60, pp. 139-144.
|
---|
31 | /// </remarks>
|
---|
32 | [Item("InsertionManipulator", "An operator which moves randomly one element to another position in the permutation. It is implemented as described in Fogel, D.B. (1988). An Evolutionary Approach to the Traveling Salesman Problem, Biological Cybernetics, 60, pp. 139-144.")]
|
---|
33 | [EmptyStorableClass]
|
---|
34 | [Creatable("Test")]
|
---|
35 | public class InsertionManipulator : PermutationManipulator {
|
---|
36 | /// <summary>
|
---|
37 | /// Moves an randomly chosen element in the specified <paramref name="permutation"/> array
|
---|
38 | /// to another randomly generated position.
|
---|
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 | Permutation original = (Permutation)permutation.Clone();
|
---|
44 | int cutIndex, insertIndex, number;
|
---|
45 |
|
---|
46 | cutIndex = random.Next(original.Length);
|
---|
47 | insertIndex = random.Next(original.Length);
|
---|
48 | number = original[cutIndex];
|
---|
49 |
|
---|
50 | int i = 0; // index in new permutation
|
---|
51 | int j = 0; // index in old permutation
|
---|
52 | while (i < original.Length) {
|
---|
53 | if (j == cutIndex) {
|
---|
54 | j++;
|
---|
55 | }
|
---|
56 | if (i == insertIndex) {
|
---|
57 | permutation[i] = number;
|
---|
58 | i++;
|
---|
59 | }
|
---|
60 | if ((i < original.Length) && (j < original.Length)) {
|
---|
61 | permutation[i] = original[j];
|
---|
62 | i++;
|
---|
63 | j++;
|
---|
64 | }
|
---|
65 | }
|
---|
66 | }
|
---|
67 |
|
---|
68 | /// <summary>
|
---|
69 | /// Moves an randomly chosen element in the specified <paramref name="permutation"/> array
|
---|
70 | /// to another randomly generated position.
|
---|
71 | /// </summary>
|
---|
72 | /// <remarks>Calls <see cref="Apply"/>.</remarks>
|
---|
73 | /// <param name="random">A random number generator.</param>
|
---|
74 | /// <param name="permutation">The permutation to manipulate.</param>
|
---|
75 | protected override void Manipulate(IRandom random, Permutation permutation) {
|
---|
76 | Apply(random, permutation);
|
---|
77 | }
|
---|
78 | }
|
---|
79 | }
|
---|