[3032] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16710] | 3 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3032] | 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;
|
---|
[4722] | 23 | using HeuristicLab.Common;
|
---|
[3032] | 24 | using HeuristicLab.Core;
|
---|
[16710] | 25 | using HEAL.Attic;
|
---|
[3032] | 26 |
|
---|
[3053] | 27 | namespace HeuristicLab.Encodings.IntegerVectorEncoding {
|
---|
[3032] | 28 | /// <summary>
|
---|
| 29 | /// Single point crossover for integer vectors.
|
---|
| 30 | /// </summary>
|
---|
| 31 | /// <remarks>
|
---|
| 32 | /// It is implemented as described in Michalewicz, Z. 1999. Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised and Extended Edition, Spring-Verlag Berlin Heidelberg.
|
---|
| 33 | /// </remarks>
|
---|
| 34 | [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.")]
|
---|
[16710] | 35 | [StorableType("0B985803-CC2D-466B-B5F2-9A1F7C415735")]
|
---|
[3059] | 36 | public class SinglePointCrossover : IntegerVectorCrossover {
|
---|
[4722] | 37 | [StorableConstructor]
|
---|
[16710] | 38 | protected SinglePointCrossover(StorableConstructorFlag _) : base(_) { }
|
---|
[4722] | 39 | protected SinglePointCrossover(SinglePointCrossover original, Cloner cloner) : base(original, cloner) { }
|
---|
| 40 | public SinglePointCrossover() : base() { }
|
---|
| 41 |
|
---|
| 42 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 43 | return new SinglePointCrossover(this, cloner);
|
---|
| 44 | }
|
---|
| 45 |
|
---|
[3032] | 46 | /// <summary>
|
---|
| 47 | /// Performs a single point crossover at a randomly chosen position of the two
|
---|
| 48 | /// given parent integer vectors.
|
---|
| 49 | /// </summary>
|
---|
| 50 | /// <param name="random">A random number generator.</param>
|
---|
| 51 | /// <param name="parent1">The first parent for crossover.</param>
|
---|
| 52 | /// <param name="parent2">The second parent for crossover.</param>
|
---|
| 53 | /// <returns>The newly created integer vector, resulting from the single point crossover.</returns>
|
---|
[3059] | 54 | public static IntegerVector Apply(IRandom random, IntegerVector parent1, IntegerVector parent2) {
|
---|
[3032] | 55 | if (parent1.Length != parent2.Length)
|
---|
[8019] | 56 | throw new ArgumentException("SinglePointCrossover: The parents are of different length.");
|
---|
[3032] | 57 |
|
---|
| 58 | int length = parent1.Length;
|
---|
| 59 | int[] result = new int[length];
|
---|
| 60 | int breakPoint = random.Next(1, length);
|
---|
| 61 |
|
---|
| 62 | for (int i = 0; i < breakPoint; i++)
|
---|
| 63 | result[i] = parent1[i];
|
---|
| 64 | for (int i = breakPoint; i < length; i++)
|
---|
| 65 | result[i] = parent2[i];
|
---|
| 66 |
|
---|
[3059] | 67 | return new IntegerVector(result);
|
---|
[3032] | 68 | }
|
---|
| 69 |
|
---|
| 70 | /// <summary>
|
---|
| 71 | /// Performs a single point crossover at a randomly chosen position of two
|
---|
| 72 | /// given parent integer vectors.
|
---|
| 73 | /// </summary>
|
---|
| 74 | /// <exception cref="ArgumentException">Thrown if there are not exactly two parents.</exception>
|
---|
| 75 | /// <param name="random">A random number generator.</param>
|
---|
| 76 | /// <param name="parents">An array containing the two integer vectors that should be crossed.</param>
|
---|
| 77 | /// <returns>The newly created integer vector, resulting from the single point crossover.</returns>
|
---|
[3059] | 78 | protected override IntegerVector Cross(IRandom random, ItemArray<IntegerVector> parents) {
|
---|
[3032] | 79 | if (parents.Length != 2) throw new ArgumentException("ERROR in SinglePointCrossover: The number of parents is not equal to 2");
|
---|
| 80 | return Apply(random, parents[0], parents[1]);
|
---|
| 81 | }
|
---|
| 82 | }
|
---|
| 83 | }
|
---|