Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Permutation/Swap3Manipulator.cs @ 381

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

Added HeuristicLab 3.0 sources from former SVN repository at revision 52

File size: 2.2 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 Swap3Manipulator : 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 index1, index2, index3, temp;
36
37      index1 = random.Next(result.Length);
38      index2 = random.Next(result.Length);
39      index3 = random.Next(result.Length);
40
41      if (random.NextDouble() < 0.5) {
42        // swap edges 1 and 2
43        temp = result[index1];
44        result[index1] = result[index2];
45        result[index2] = temp;
46        // swap edges 2 and 3
47        temp = result[index2];
48        result[index2] = result[index3];
49        result[index3] = temp;
50      } else {
51        // swap edges 1 and 3
52        temp = result[index1];
53        result[index1] = result[index3];
54        result[index3] = temp;
55        // swap edges 2 and 3
56        temp = result[index2];
57        result[index2] = result[index3];
58        result[index3] = temp;
59      }
60      return result;
61    }
62
63    protected override int[] Manipulate(IScope scope, IRandom random, int[] permutation) {
64      return Apply(random, permutation);
65    }
66  }
67}
Note: See TracBrowser for help on using the repository browser.