Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Permutation/MaximalPreservativeCrossover.cs @ 111

Last change on this file since 111 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 MaximalPreservativeCrossover : 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[] numberCopied = new bool[length];
38      int breakPoint1, breakPoint2, subsegmentLength, index;
39
40      if (length >= 20) {  // length of subsegment must be >= 10 and <= length / 2
41        breakPoint1 = random.Next(length - 9);
42        subsegmentLength = random.Next(10, Math.Min((int)(length / 2), length - breakPoint1) + 1);
43        breakPoint2 = breakPoint1 + subsegmentLength - 1;
44      } else {
45        breakPoint1 = random.Next(length - 1);
46        breakPoint2 = random.Next(breakPoint1 + 1, length);
47      }
48
49      index = 0;
50      for (int i = breakPoint1; i <= breakPoint2; i++) {  // copy part of first permutation
51        result[index] = parent1[i];
52        numberCopied[result[index]] = true;
53        index++;
54      }
55
56      for (int i = 0; i < parent2.Length; i++) {  // copy remaining part of second permutation
57        if (!numberCopied[parent2[i]]) {
58          result[index] = parent2[i];
59          index++;
60        }
61      }
62      return result;
63    }
64
65    protected override int[] Cross(IScope scope, IRandom random, int[] parent1, int[] parent2) {
66      return Apply(random, parent1, parent2);
67    }
68  }
69}
Note: See TracBrowser for help on using the repository browser.