[2] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[2794] | 3 | * Copyright (C) 2002-2010 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 |
|
---|
| 22 | using HeuristicLab.Core;
|
---|
[2794] | 23 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[2] | 24 |
|
---|
[3053] | 25 | namespace HeuristicLab.Encodings.PermutationEncoding {
|
---|
[850] | 26 | /// <summary>
|
---|
[2794] | 27 | /// An operator which inverts a randomly chosen part of a permutation.
|
---|
[850] | 28 | /// </summary>
|
---|
[2854] | 29 | /// <remarks>
|
---|
| 30 | /// 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 />
|
---|
| 31 | /// </remarks>
|
---|
[2871] | 32 | [Item("InversionManipulator", "An operator which inverts a randomly chosen part of a permutation. 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.")]
|
---|
[3017] | 33 | [StorableClass]
|
---|
[2794] | 34 | public class InversionManipulator : PermutationManipulator {
|
---|
[850] | 35 | /// <summary>
|
---|
[2794] | 36 | /// Inverts a randomly chosen part of a permutation.
|
---|
[850] | 37 | /// </summary>
|
---|
[2794] | 38 | /// <param name="random">A random number generator.</param>
|
---|
| 39 | /// <param name="permutation">The permutation to manipulate.</param>
|
---|
[2830] | 40 | public static void Apply(IRandom random, Permutation permutation) {
|
---|
[2] | 41 | int breakPoint1, breakPoint2;
|
---|
| 42 |
|
---|
[2830] | 43 | breakPoint1 = random.Next(permutation.Length - 1);
|
---|
[2] | 44 | do {
|
---|
[2830] | 45 | breakPoint2 = random.Next(permutation.Length - 1);
|
---|
[2] | 46 | } while (breakPoint2 == breakPoint1);
|
---|
| 47 | if (breakPoint2 < breakPoint1) { int h = breakPoint1; breakPoint1 = breakPoint2; breakPoint2 = h; }
|
---|
[2997] | 48 | Apply(permutation, breakPoint1, breakPoint2);
|
---|
| 49 | }
|
---|
[2] | 50 |
|
---|
[2997] | 51 | public static void Apply(Permutation permutation, int breakPoint1, int breakPoint2) {
|
---|
[2830] | 52 | for (int i = 0; i <= (breakPoint2 - breakPoint1) / 2; i++) { // invert permutation between breakpoints
|
---|
| 53 | int temp = permutation[breakPoint1 + i];
|
---|
| 54 | permutation[breakPoint1 + i] = permutation[breakPoint2 - i];
|
---|
| 55 | permutation[breakPoint2 - i] = temp;
|
---|
[2] | 56 | }
|
---|
| 57 | }
|
---|
| 58 |
|
---|
[850] | 59 | /// <summary>
|
---|
[2794] | 60 | /// Inverts a randomly chosen part of a permutation.
|
---|
[850] | 61 | /// </summary>
|
---|
[2794] | 62 | /// <param name="random">A random number generator.</param>
|
---|
| 63 | /// <param name="permutation">The permutation to manipulate.</param>
|
---|
[2830] | 64 | protected override void Manipulate(IRandom random, Permutation permutation) {
|
---|
| 65 | Apply(random, permutation);
|
---|
[2] | 66 | }
|
---|
| 67 | }
|
---|
| 68 | }
|
---|