Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Encodings.RealVectorEncoding/3.3/Crossovers/LocalCrossover.cs @ 6409

Last change on this file since 6409 was 5445, checked in by swagner, 14 years ago

Updated year of copyrights (#1406)

File size: 4.0 KB
RevLine 
[2900]1#region License Information
2/* HeuristicLab
[5445]3 * Copyright (C) 2002-2011 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;
[4722]23using HeuristicLab.Common;
[2900]24using HeuristicLab.Core;
[2936]25using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
[2900]26
[3053]27namespace HeuristicLab.Encodings.RealVectorEncoding {
[2900]28  /// <summary>
[2964]29  /// The local crossover for real vectors is similar to the <see cref="UniformAllPositionsArithmeticCrossover"/>, but where the factor alpha is chosen randomly in the interval [0;1) for each position.
[2900]30  /// </summary>
[2936]31  /// <remarks>
32  /// It is implemented as described in Dumitrescu, D. et al. (2000), Evolutionary computation, CRC Press, Boca Raton, FL, p. 194.
33  /// </remarks>
[2964]34  [Item("LocalCrossover", @"The local crossover is similar to the arithmetic all positions crossover, but uses a random alpha for each position x = alpha * p1 + (1-alpha) * p2. It is implemented as described in Dumitrescu, D. et al. (2000), Evolutionary computation, CRC Press, Boca Raton, FL., p. 194.")]
[3017]35  [StorableClass]
[2936]36  public class LocalCrossover : RealVectorCrossover {
[4722]37    [StorableConstructor]
38    protected LocalCrossover(bool deserializing) : base(deserializing) { }
39    protected LocalCrossover(LocalCrossover original, Cloner cloner) : base(original, cloner) { }
40    public LocalCrossover() : base() { }
41
42    public override IDeepCloneable Clone(Cloner cloner) {
43      return new LocalCrossover(this, cloner);
44    }
45   
[2900]46    /// <summary>
47    /// Performs a local crossover on the two given parent vectors.
48    /// </summary>
[2936]49    /// <exception cref="ArgumentException">Thrown when two parents are not of the same length.</exception>
[2900]50    /// <param name="random">The random number generator.</param>
51    /// <param name="parent1">The first parent for the crossover operation.</param>
52    /// <param name="parent2">The second parent for the crossover operation.</param>
53    /// <returns>The newly created real vector, resulting from the local crossover.</returns>
[3060]54    public static RealVector Apply(IRandom random, RealVector parent1, RealVector parent2) {
[2936]55      if (parent1.Length != parent2.Length)
[2964]56        throw new ArgumentException("LocalCrossover: the two parents are not of the same length");
[4068]57
[2900]58      double factor;
59      int length = parent1.Length;
60      double[] result = new double[length];
61
62      for (int i = 0; i < length; i++) {
63        factor = random.NextDouble();
64        result[i] = (factor * parent1[i]) + ((1 - factor) * parent2[i]);
65      }
[3060]66      return new RealVector(result);
[2900]67    }
68
69    /// <summary>
70    /// Performs a local crossover operation for two given parent real vectors.
71    /// </summary>
[2936]72    /// <exception cref="ArgumentException">Thrown if there are not exactly two parents.</exception>
[2900]73    /// <param name="random">A random number generator.</param>
74    /// <param name="parents">An array containing the two real vectors that should be crossed.</param>
75    /// <returns>The newly created real vector, resulting from the crossover operation.</returns>
[3060]76    protected override RealVector Cross(IRandom random, ItemArray<RealVector> parents) {
[2964]77      if (parents.Length != 2) throw new ArgumentException("LocalCrossover: The number of parents is not equal to 2");
[2900]78      return Apply(random, parents[0], parents[1]);
79    }
80  }
81}
Note: See TracBrowser for help on using the repository browser.