[2900] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[2936] | 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 |
|
---|
| 22 | using System;
|
---|
| 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
[2936] | 25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[2900] | 26 |
|
---|
| 27 | namespace HeuristicLab.Encodings.RealVector {
|
---|
| 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 {
|
---|
[2900] | 37 | /// <summary>
|
---|
| 38 | /// Performs a local crossover on the two given parent vectors.
|
---|
| 39 | /// </summary>
|
---|
[2936] | 40 | /// <exception cref="ArgumentException">Thrown when two parents are not of the same length.</exception>
|
---|
[2900] | 41 | /// <param name="random">The random number generator.</param>
|
---|
| 42 | /// <param name="parent1">The first parent for the crossover operation.</param>
|
---|
| 43 | /// <param name="parent2">The second parent for the crossover operation.</param>
|
---|
| 44 | /// <returns>The newly created real vector, resulting from the local crossover.</returns>
|
---|
[2936] | 45 | public static DoubleArrayData Apply(IRandom random, DoubleArrayData parent1, DoubleArrayData parent2) {
|
---|
| 46 | if (parent1.Length != parent2.Length)
|
---|
[2964] | 47 | throw new ArgumentException("LocalCrossover: the two parents are not of the same length");
|
---|
[2936] | 48 |
|
---|
[2900] | 49 | double factor;
|
---|
| 50 | int length = parent1.Length;
|
---|
| 51 | double[] result = new double[length];
|
---|
| 52 |
|
---|
| 53 | for (int i = 0; i < length; i++) {
|
---|
| 54 | factor = random.NextDouble();
|
---|
| 55 | result[i] = (factor * parent1[i]) + ((1 - factor) * parent2[i]);
|
---|
| 56 | }
|
---|
[2936] | 57 | return new DoubleArrayData(result);
|
---|
[2900] | 58 | }
|
---|
| 59 |
|
---|
| 60 | /// <summary>
|
---|
| 61 | /// Performs a local crossover operation for two given parent real vectors.
|
---|
| 62 | /// </summary>
|
---|
[2936] | 63 | /// <exception cref="ArgumentException">Thrown if there are not exactly two parents.</exception>
|
---|
[2900] | 64 | /// <param name="random">A random number generator.</param>
|
---|
| 65 | /// <param name="parents">An array containing the two real vectors that should be crossed.</param>
|
---|
| 66 | /// <returns>The newly created real vector, resulting from the crossover operation.</returns>
|
---|
[2936] | 67 | protected override DoubleArrayData Cross(IRandom random, ItemArray<DoubleArrayData> parents) {
|
---|
[2964] | 68 | if (parents.Length != 2) throw new ArgumentException("LocalCrossover: The number of parents is not equal to 2");
|
---|
[2900] | 69 | return Apply(random, parents[0], parents[1]);
|
---|
| 70 | }
|
---|
| 71 | }
|
---|
| 72 | }
|
---|