[2] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2008 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 |
|
---|
| 27 | namespace HeuristicLab.Permutation {
|
---|
| 28 | public class ScrambleManipulator : PermutationManipulatorBase {
|
---|
| 29 | public override string Description {
|
---|
| 30 | get { return @"TODO\r\nOperator description still missing ..."; }
|
---|
| 31 | }
|
---|
| 32 |
|
---|
| 33 | public static int[] Apply(IRandom random, int[] permutation) {
|
---|
| 34 | int[] result = (int[])permutation.Clone();
|
---|
| 35 | int breakPoint1, breakPoint2;
|
---|
| 36 | int[] scrambledIndices, remainingIndices, temp;
|
---|
| 37 | int selectedIndex, index;
|
---|
| 38 |
|
---|
| 39 | breakPoint1 = random.Next(permutation.Length - 1);
|
---|
| 40 | breakPoint2 = random.Next(breakPoint1 + 1, permutation.Length);
|
---|
| 41 |
|
---|
| 42 | scrambledIndices = new int[breakPoint2 - breakPoint1 + 1];
|
---|
| 43 | remainingIndices = new int[breakPoint2 - breakPoint1 + 1];
|
---|
| 44 | for (int i = 0; i < remainingIndices.Length; i++) { // initialise indices
|
---|
| 45 | remainingIndices[i] = i;
|
---|
| 46 | }
|
---|
| 47 | for (int i = 0; i < scrambledIndices.Length; i++) { // generate permutation of indices
|
---|
| 48 | selectedIndex = random.Next(remainingIndices.Length);
|
---|
| 49 | scrambledIndices[i] = remainingIndices[selectedIndex];
|
---|
| 50 |
|
---|
| 51 | temp = remainingIndices;
|
---|
| 52 | remainingIndices = new int[temp.Length - 1];
|
---|
| 53 | index = 0;
|
---|
| 54 | for (int j = 0; j < remainingIndices.Length; j++) {
|
---|
| 55 | if (index == selectedIndex) {
|
---|
| 56 | index++;
|
---|
| 57 | }
|
---|
| 58 | remainingIndices[j] = temp[index];
|
---|
| 59 | index++;
|
---|
| 60 | }
|
---|
| 61 | }
|
---|
| 62 |
|
---|
| 63 | for (int i = 0; i <= (breakPoint2 - breakPoint1); i++) { // scramble permutation between breakpoints
|
---|
| 64 | result[breakPoint1 + i] = permutation[breakPoint1 + scrambledIndices[i]];
|
---|
| 65 | }
|
---|
| 66 | return result;
|
---|
| 67 | }
|
---|
| 68 |
|
---|
| 69 | protected override int[] Manipulate(IScope scope, IRandom random, int[] permutation) {
|
---|
| 70 | return Apply(random, permutation);
|
---|
| 71 | }
|
---|
| 72 | }
|
---|
| 73 | }
|
---|