#region License Information /* HeuristicLab * Copyright (C) 2002-2012 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 HeuristicLab.Common; using HeuristicLab.Core; using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; namespace HeuristicLab.Encodings.IntegerVectorEncoding { /// /// Single point crossover for integer vectors. /// /// /// It is implemented as described in Michalewicz, Z. 1999. Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised and Extended Edition, Spring-Verlag Berlin Heidelberg. /// [Item("SinglePointCrossover", "Single point crossover for integer vectors. It is implemented as described in Michalewicz, Z. 1999. Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised and Extended Edition, Spring-Verlag Berlin Heidelberg.")] [StorableClass] public class SinglePointCrossover : IntegerVectorCrossover { [StorableConstructor] protected SinglePointCrossover(bool deserializing) : base(deserializing) { } protected SinglePointCrossover(SinglePointCrossover original, Cloner cloner) : base(original, cloner) { } public SinglePointCrossover() : base() { } public override IDeepCloneable Clone(Cloner cloner) { return new SinglePointCrossover(this, cloner); } /// /// Performs a single point crossover at a randomly chosen position of the two /// given parent integer vectors. /// /// A random number generator. /// The first parent for crossover. /// The second parent for crossover. /// The newly created integer vector, resulting from the single point crossover. public static IntegerVector Apply(IRandom random, IntegerVector parent1, IntegerVector parent2) { if (parent1.Length != parent2.Length) throw new ArgumentException("DiscreteCrossover: The parents are of different length."); int length = parent1.Length; int[] result = new int[length]; int breakPoint = random.Next(1, length); for (int i = 0; i < breakPoint; i++) result[i] = parent1[i]; for (int i = breakPoint; i < length; i++) result[i] = parent2[i]; return new IntegerVector(result); } /// /// Performs a single point crossover at a randomly chosen position of two /// given parent integer vectors. /// /// Thrown if there are not exactly two parents. /// A random number generator. /// An array containing the two integer vectors that should be crossed. /// The newly created integer vector, resulting from the single point crossover. protected override IntegerVector Cross(IRandom random, ItemArray parents) { if (parents.Length != 2) throw new ArgumentException("ERROR in SinglePointCrossover: The number of parents is not equal to 2"); return Apply(random, parents[0], parents[1]); } } }