Free cookie consent management tool by TermsFeed Policy Generator

source: branches/GpPluginsRefactoringBranch/HeuristicLab.Permutation/AbsolutePositionTopologicalCrossover.cs @ 644

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

Added HeuristicLab 3.0 sources from former SVN repository at revision 52

File size: 2.0 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 AbsolutePositionTopologicalCrossover : 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 index;
39
40      index = 0;
41      for (int i = 0; i < length; i++) {  // copy numbers from both parent permutations
42        if (!numberCopied[parent1[i]]) {
43          result[index] = parent1[i];
44          numberCopied[parent1[i]] = true;
45          index++;
46        }
47        if (!numberCopied[parent2[i]]) {
48          result[index] = parent2[i];
49          numberCopied[parent2[i]] = true;
50          index++;
51        }
52      }
53      return result;
54    }
55
56    protected override int[] Cross(IScope scope, IRandom random, int[] parent1, int[] parent2) {
57      return Apply(random, parent1, parent2);
58    }
59  }
60}
Note: See TracBrowser for help on using the repository browser.