Free cookie consent management tool by TermsFeed Policy Generator

source: branches/Operator Architecture Refactoring/HeuristicLab.Permutation/TranslocationInversionManipulator.cs @ 862

Last change on this file since 862 was 2, checked in by swagner, 17 years ago

Added HeuristicLab 3.0 sources from former SVN repository at revision 52

File size: 2.5 KB
Line 
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
22using System;
23using System.Collections.Generic;
24using System.Text;
25using HeuristicLab.Core;
26
27namespace HeuristicLab.Permutation {
28  public class TranslocationInversionManipulator : 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, insertPoint, insertPointLimit;
36
37      breakPoint1 = random.Next(permutation.Length - 1);
38      breakPoint2 = random.Next(breakPoint1 + 1, permutation.Length);
39      insertPointLimit = permutation.Length - breakPoint2 + breakPoint1 - 1;  // get insertion point in remaining part
40      if (insertPointLimit > 0)
41        insertPoint = random.Next(insertPointLimit);
42      else
43        insertPoint = 0;
44
45      int i = 0;  // index in new permutation
46      int j = 0;  // index in old permutation
47      while (i < permutation.Length) {
48        if (i == insertPoint) {  // copy translocated area
49          for (int k = breakPoint2; k >= breakPoint1; k--) {
50            result[i] = permutation[k];
51            i++;
52          }
53        }
54        if (j == breakPoint1) {  // skip area between breakpoints
55          j = breakPoint2 + 1;
56        }
57        if ((i < permutation.Length) && (j < permutation.Length)) {
58          result[i] = permutation[j];
59          i++;
60          j++;
61        }
62      }
63      return result;
64    }
65
66    protected override int[] Manipulate(IScope scope, IRandom random, int[] permutation) {
67      return Apply(random, permutation);
68    }
69  }
70}
Note: See TracBrowser for help on using the repository browser.