[2] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16453] | 3 | * Copyright (C) 2002-2019 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;
|
---|
[16462] | 24 | using HEAL.Fossil;
|
---|
[2] | 25 |
|
---|
[3053] | 26 | namespace 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.")]
|
---|
[16462] | 34 | [StorableType("0909F09A-B27B-4962-8A7D-B4561A37D324")]
|
---|
[2854] | 35 | public class Swap2Manipulator : PermutationManipulator {
|
---|
[4722] | 36 | [StorableConstructor]
|
---|
[16462] | 37 | protected Swap2Manipulator(StorableConstructorFlag _) : base(_) { }
|
---|
[4722] | 38 | protected Swap2Manipulator(Swap2Manipulator original, Cloner cloner) : base(original, cloner) { }
|
---|
| 39 | public Swap2Manipulator() : base() { }
|
---|
| 40 |
|
---|
| 41 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 42 | return new Swap2Manipulator(this, cloner);
|
---|
| 43 | }
|
---|
| 44 |
|
---|
[850] | 45 | /// <summary>
|
---|
[2854] | 46 | /// Swaps two randomly chosen elements in the given <paramref name="permutation"/> permutation.
|
---|
[850] | 47 | /// </summary>
|
---|
| 48 | /// <param name="random">The random number generator.</param>
|
---|
[2854] | 49 | /// <param name="permutation">The permutation to manipulate.</param>
|
---|
| 50 | public static void Apply(IRandom random, Permutation permutation) {
|
---|
[5933] | 51 | int index1, index2;
|
---|
[2] | 52 |
|
---|
[2854] | 53 | index1 = random.Next(permutation.Length);
|
---|
| 54 | index2 = random.Next(permutation.Length);
|
---|
[2] | 55 |
|
---|
[5933] | 56 | Apply(permutation, index1, index2);
|
---|
| 57 | }
|
---|
| 58 |
|
---|
| 59 | public static void Apply(Permutation permutation, int index1, int index2) {
|
---|
[14662] | 60 | permutation.Swap(index1, index2);
|
---|
[2] | 61 | }
|
---|
| 62 |
|
---|
[850] | 63 | /// <summary>
|
---|
| 64 | /// Swaps two randomly chosen elements in the given <paramref name="permutation"/> array.
|
---|
| 65 | /// </summary>
|
---|
| 66 | /// <remarks>Calls <see cref="Apply"/>.</remarks>
|
---|
[2854] | 67 | /// <param name="random">A random number generator.</param>
|
---|
| 68 | /// <param name="permutation">The permutation to manipulate.</param>
|
---|
| 69 | protected override void Manipulate(IRandom random, Permutation permutation) {
|
---|
| 70 | Apply(random, permutation);
|
---|
[2] | 71 | }
|
---|
| 72 | }
|
---|
| 73 | }
|
---|