Free cookie consent management tool by TermsFeed Policy Generator

source: branches/3.0/sources/HeuristicLab.Permutation/OrderBasedCrossover.cs @ 4945

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

Added HeuristicLab 3.0 sources from former SVN repository at revision 52

File size: 2.8 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 OrderBasedCrossover : 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      int[] selectedNumbers = new int[random.Next(length + 1)];
38      bool[] numberSelected = new bool[length];
39      int index, selectedIndex, currentIndex;
40
41      for (int i = 0; i < selectedNumbers.Length; i++) {  // select numbers for array
42        index = 0;
43        while (numberSelected[parent1[index]]) {  // find first valid index
44          index++;
45        }
46
47        selectedIndex = random.Next(length - i);
48        currentIndex = 0;
49        while ((index < parent1.Length) && (currentIndex != selectedIndex)) {  // find selected number
50          index++;
51          if (!numberSelected[parent1[index]]) {
52            currentIndex++;
53          }
54        }
55        numberSelected[parent1[index]] = true;
56      }
57
58      index = 0;
59      for (int i = 0; i < parent1.Length; i++) {  // copy selected numbers in array
60        if (numberSelected[parent1[i]]) {
61          selectedNumbers[index] = parent1[i];
62          index++;
63        }
64      }
65
66      index = 0;
67      for (int i = 0; i < result.Length; i++) {  // copy rest of second permutation and selected numbers in order of first permutation
68        if (numberSelected[parent2[i]]) {
69          result[i] = selectedNumbers[index];
70          index++;
71        } else {
72          result[i] = parent2[i];
73        }
74      }
75      return result;
76    }
77
78    protected override int[] Cross(IScope scope, IRandom random, int[] parent1, int[] parent2) {
79      return Apply(random, parent1, parent2);
80    }
81  }
82}
Note: See TracBrowser for help on using the repository browser.