[2] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[12012] | 3 | * Copyright (C) 2002-2015 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 |
|
---|
[4722] | 22 | using HeuristicLab.Common;
|
---|
[2] | 23 | using HeuristicLab.Core;
|
---|
[2854] | 24 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[2] | 25 |
|
---|
[3053] | 26 | namespace HeuristicLab.Encodings.PermutationEncoding {
|
---|
[850] | 27 | /// <summary>
|
---|
| 28 | /// Manipulates a permutation array by moving randomly one element to another position in the array.
|
---|
[2854] | 29 | /// </summary>
|
---|
| 30 | /// <remarks>
|
---|
[2871] | 31 | /// It is implemented as described in Fogel, D.B. (1988). An Evolutionary Approach to the Traveling Salesman Problem, Biological Cybernetics, 60, pp. 139-144.
|
---|
[2854] | 32 | /// </remarks>
|
---|
[3340] | 33 | [Item("InsertionManipulator", "An operator which moves randomly one element to another position in the permutation (Insertion is a special case of Translocation). It is implemented as described in Fogel, D.B. (1988). An Evolutionary Approach to the Traveling Salesman Problem, Biological Cybernetics, 60, pp. 139-144.")]
|
---|
[14711] | 34 | [StorableType("8D065EDE-FAA8-4897-9F3B-D7B173B08C99")]
|
---|
[2854] | 35 | public class InsertionManipulator : PermutationManipulator {
|
---|
[4722] | 36 | [StorableConstructor]
|
---|
| 37 | protected InsertionManipulator(bool deserializing) : base(deserializing) { }
|
---|
| 38 | protected InsertionManipulator(InsertionManipulator original, Cloner cloner) : base(original, cloner) { }
|
---|
| 39 | public InsertionManipulator() : base() { }
|
---|
| 40 |
|
---|
| 41 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 42 | return new InsertionManipulator(this, cloner);
|
---|
| 43 | }
|
---|
| 44 |
|
---|
[850] | 45 | /// <summary>
|
---|
| 46 | /// Moves an randomly chosen element in the specified <paramref name="permutation"/> array
|
---|
| 47 | /// to another randomly generated position.
|
---|
| 48 | /// </summary>
|
---|
| 49 | /// <param name="random">The random number generator.</param>
|
---|
[2854] | 50 | /// <param name="permutation">The permutation to manipulate.</param>
|
---|
| 51 | public static void Apply(IRandom random, Permutation permutation) {
|
---|
| 52 | Permutation original = (Permutation)permutation.Clone();
|
---|
[2] | 53 | int cutIndex, insertIndex, number;
|
---|
| 54 |
|
---|
[2854] | 55 | cutIndex = random.Next(original.Length);
|
---|
| 56 | insertIndex = random.Next(original.Length);
|
---|
| 57 | number = original[cutIndex];
|
---|
[2] | 58 |
|
---|
| 59 | int i = 0; // index in new permutation
|
---|
| 60 | int j = 0; // index in old permutation
|
---|
[2854] | 61 | while (i < original.Length) {
|
---|
[2] | 62 | if (j == cutIndex) {
|
---|
| 63 | j++;
|
---|
| 64 | }
|
---|
| 65 | if (i == insertIndex) {
|
---|
[2854] | 66 | permutation[i] = number;
|
---|
[2] | 67 | i++;
|
---|
| 68 | }
|
---|
[2854] | 69 | if ((i < original.Length) && (j < original.Length)) {
|
---|
| 70 | permutation[i] = original[j];
|
---|
[2] | 71 | i++;
|
---|
| 72 | j++;
|
---|
| 73 | }
|
---|
| 74 | }
|
---|
| 75 | }
|
---|
| 76 |
|
---|
[850] | 77 | /// <summary>
|
---|
| 78 | /// Moves an randomly chosen element in the specified <paramref name="permutation"/> array
|
---|
| 79 | /// to another randomly generated position.
|
---|
| 80 | /// </summary>
|
---|
| 81 | /// <remarks>Calls <see cref="Apply"/>.</remarks>
|
---|
[2854] | 82 | /// <param name="random">A random number generator.</param>
|
---|
| 83 | /// <param name="permutation">The permutation to manipulate.</param>
|
---|
| 84 | protected override void Manipulate(IRandom random, Permutation permutation) {
|
---|
| 85 | Apply(random, permutation);
|
---|
[2] | 86 | }
|
---|
| 87 | }
|
---|
| 88 | }
|
---|