Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Encodings.RealVectorEncoding/3.3/Crossovers/SinglePointCrossover.cs @ 3629

Last change on this file since 3629 was 3376, checked in by swagner, 15 years ago

Moved interfaces and classes for deep cloning from HeuristicLab.Core to HeuristicLab.Common (#975).

File size: 4.2 KB
RevLine 
[2900]1#region License Information
2/* HeuristicLab
[2913]3 * Copyright (C) 2002-2010 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[2900]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;
[3376]23using HeuristicLab.Common;
[2900]24using HeuristicLab.Core;
[2913]25using HeuristicLab.Data;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
[2900]27
[3053]28namespace HeuristicLab.Encodings.RealVectorEncoding {
[2900]29  /// <summary>
[2913]30  /// Single point crossover for real vectors. The implementation is similar to the single point crossover for binary vectors.
31  /// After a breakpoint is randomly chosen in the interval [1,N-1) with N = length of the vector, the first part is copied from parent1 the other part copied from parent2.
32  /// The interval is chosen such that at least one position is taken from a different parent.
[2900]33  /// </summary>
[2913]34  /// <remarks>
35  /// It is implemented as described in Michalewicz, Z. 1999. Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised and Extended Edition, Spring-Verlag Berlin Heidelberg.
36  /// </remarks>
37  [Item("SinglePointCrossover", "Breaks both parent chromosomes at a randomly chosen point and assembles a child by taking one part of the first parent and the other part of the second pard. It is implemented as described in Michalewicz, Z. 1999. Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised and Extended Edition, Spring-Verlag Berlin Heidelberg.")]
[3017]38  [StorableClass]
[2913]39  public class SinglePointCrossover : RealVectorCrossover {
[2900]40    /// <summary>
[2913]41    /// Performs the single point crossover for real vectors. The implementation is similar to the single point crossover for binary vectors.
42    /// After a breakpoint is randomly chosen in the interval [1,N-1) with N = length of the vector, the first part is copied from parent1 the other part copied from parent2.
[2900]43    /// </summary>
[2913]44    /// <exception cref="ArgumentException">Thrown when the length of the vector is not the same in both parents.</exception>
[2900]45    /// <param name="random">A random number generator.</param>
46    /// <param name="parent1">The first parent for crossover.</param>
47    /// <param name="parent2">The second parent for crossover.</param>
48    /// <returns>The newly created real vector, resulting from the single point crossover.</returns>
[3060]49    public static RealVector Apply(IRandom random, RealVector parent1, RealVector parent2) {
[2913]50      if (parent1.Length != parent2.Length) throw new ArgumentException("SinglePointCrossover: Parents are of unequal length");
[2900]51      int length = parent1.Length;
[3060]52      RealVector result = new RealVector(length);
[2913]53      int breakPoint = random.Next(1, length - 1);
[2900]54
55      for (int i = 0; i < breakPoint; i++)
56        result[i] = parent1[i];
57      for (int i = breakPoint; i < length; i++)
58        result[i] = parent2[i];
59
60      return result;
61    }
62
63    /// <summary>
[3060]64    /// Checks number of parents and forwards the call to <see cref="Apply(IRandom, RealVector, RealVector)"/>.
[2936]65    /// </summary>
66    /// <exception cref="ArgumentException">Thrown when the parents' vectors are of unequal length or when <paramref name="contiguity"/> is smaller than 0.</exception>
[2913]67    /// <param name="random">The pseudo random number generator to use.</param>
68    /// <param name="parents">The list of parents.</param>
69    /// <returns>A new real vector.</returns>
[3060]70    protected override RealVector Cross(IRandom random, ItemArray<RealVector> parents) {
[2936]71      if (parents.Length != 2) throw new ArgumentException("SinglePointCrossover: The number of parents is not equal to 2");
[2900]72      return Apply(random, parents[0], parents[1]);
73    }
74  }
75}
Note: See TracBrowser for help on using the repository browser.