Free cookie consent management tool by TermsFeed Policy Generator

source: branches/3.0/sources/HeuristicLab.Permutation/PartiallyMatchedCrossover.cs @ 13077

Last change on this file since 13077 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;
26using HeuristicLab.Data;
27
28namespace HeuristicLab.Permutation {
29  public class PartiallyMatchedCrossover : PermutationCrossoverBase {
30    public override string Description {
31      get { return @"TODO\r\nOperator description still missing ..."; }
32    }
33
34    public static int[] Apply(IRandom random, int[] parent1, int[] parent2) {
35      int length = parent1.Length;
36      int[] result = new int[length];
37      bool[] numbersCopied = new bool[length];
38
39      int breakPoint1 = random.Next(length - 1);
40      int breakPoint2 = random.Next(breakPoint1 + 1, length);
41
42      for (int j = breakPoint1; j <= breakPoint2; j++) {  // copy part of first permutation
43        result[j] = parent1[j];
44        numbersCopied[result[j]] = true;
45      }
46
47      int index = breakPoint1;
48      int i = (breakPoint1 == 0 ? (breakPoint2 + 1) : 0);
49      while (i < length) {  // copy rest from second permutation
50        if (!numbersCopied[parent2[i]]) {  // copy directly
51          result[i] = parent2[i];
52        } else {  // copy from area between breakpoints
53          while (numbersCopied[parent2[index]]) {  // find next valid index
54            index++;
55          }
56          result[i] = parent2[index];
57          index++;
58        }
59
60        i++;
61        if (i == breakPoint1) {  // skip area between breakpoints
62          i = breakPoint2 + 1;
63        }
64      }
65      return result;
66    }
67
68    protected override int[] Cross(IScope scope, IRandom random, int[] parent1, int[] parent2) {
69      return Apply(random, parent1, parent2);
70    }
71  }
72}
Note: See TracBrowser for help on using the repository browser.