Free cookie consent management tool by TermsFeed Policy Generator

source: branches/3.0/sources/HeuristicLab.Permutation/OrderCrossover.cs @ 8360

Last change on this file since 8360 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;
26using HeuristicLab.Data;
27
28namespace HeuristicLab.Permutation {
29  public class OrderCrossover : 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[] result = new int[parent1.Length];
36      bool[] copied = new bool[result.Length];
37
38      int breakPoint1 = random.Next(result.Length - 1);
39      int breakPoint2 = random.Next(breakPoint1 + 1, result.Length);
40
41      for (int i = breakPoint1; i <= breakPoint2; i++) {  // copy part of first permutation
42        result[i] = parent1[i];
43        copied[parent1[i]] = true;
44      }
45
46      int index = 0;
47      for (int i = 0; i < parent2.Length; i++) {  // copy remaining part of second permutation
48        if (index == breakPoint1) {  // skip already copied part
49          index = breakPoint2 + 1;
50        }
51        if (!copied[parent2[i]]) {
52          result[index] = parent2[i];
53          index++;
54        }
55      }
56      return result;
57    }
58
59    protected override int[] Cross(IScope scope, IRandom random, int[] parent1, int[] parent2) {
60      return Apply(random, parent1, parent2);
61    }
62  }
63}
Note: See TracBrowser for help on using the repository browser.