#region License Information /* HeuristicLab * Copyright (C) 2002-2008 Heuristic and Evolutionary Algorithms Laboratory (HEAL) * * This file is part of HeuristicLab. * * HeuristicLab is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * HeuristicLab is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with HeuristicLab. If not, see . */ #endregion using System; using System.Collections.Generic; using System.Text; using HeuristicLab.Core; using HeuristicLab.Data; namespace HeuristicLab.Permutation { public class CyclicCrossover : PermutationCrossoverBase { public override string Description { get { return @"TODO\r\nOperator description still missing ..."; } } public static int[] Apply(IRandom random, int[] parent1, int[] parent2) { int length = parent1.Length; int[] result = new int[length]; bool[] indexCopied = new bool[length]; int j, number; j = random.Next(length); // get number to start cycle while (!indexCopied[j]) { // copy whole cycle to new permutation result[j] = parent1[j]; number = parent2[j]; indexCopied[j] = true; j = 0; while ((j < length) && (parent1[j] != number)) { // search copied number in second permutation j++; } } for (int i = 0; i < length; i++) { // copy rest of secound permutation to new permutation if (!indexCopied[i]) { result[i] = parent2[i]; } } return result; } protected override int[] Cross(IScope scope, IRandom random, int[] parent1, int[] parent2) { return Apply(random, parent1, parent2); } } }