[13368] | 1 | #region License Information
|
---|
[3062] | 2 | /* HeuristicLab
|
---|
[12012] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3062] | 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;
|
---|
[3062] | 24 | using HeuristicLab.Core;
|
---|
[4068] | 25 | using HeuristicLab.Data;
|
---|
[3062] | 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 27 |
|
---|
| 28 | namespace HeuristicLab.Encodings.BinaryVectorEncoding {
|
---|
| 29 | /// <summary>
|
---|
| 30 | /// Single point crossover for binary vectors.
|
---|
| 31 | /// </summary>
|
---|
| 32 | /// <remarks>
|
---|
| 33 | /// It is implemented based on the NPointCrossover
|
---|
| 34 | /// </remarks>
|
---|
| 35 | [Item("SinglePointCrossover", "Single point crossover for binary vectors. It is implemented based on the NPointCrossover.")]
|
---|
[14711] | 36 | [StorableType("E24CCE38-9B97-46D8-AD33-09305D0215F8")]
|
---|
[4722] | 37 | public sealed class SinglePointCrossover : BinaryVectorCrossover {
|
---|
| 38 |
|
---|
| 39 | [StorableConstructor]
|
---|
| 40 | private SinglePointCrossover(bool deserializing) : base(deserializing) { }
|
---|
| 41 | private SinglePointCrossover(SinglePointCrossover original, Cloner cloner) : base(original, cloner) { }
|
---|
| 42 | public SinglePointCrossover() : base() { }
|
---|
| 43 |
|
---|
| 44 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 45 | return new SinglePointCrossover(this, cloner);
|
---|
| 46 | }
|
---|
| 47 |
|
---|
[3062] | 48 | /// <summary>
|
---|
| 49 | /// Performs a single point crossover at a randomly chosen position of two
|
---|
| 50 | /// given parent binary vectors.
|
---|
| 51 | /// </summary>
|
---|
| 52 | /// <exception cref="ArgumentException">Thrown if there are not exactly two parents.</exception>
|
---|
| 53 | /// <param name="random">A random number generator.</param>
|
---|
| 54 | /// <param name="parents">An array containing the two binary vectors that should be crossed.</param>
|
---|
| 55 | /// <returns>The newly created binary vector, resulting from the single point crossover.</returns>
|
---|
| 56 | protected override BinaryVector Cross(IRandom random, ItemArray<BinaryVector> parents) {
|
---|
[3064] | 57 | if (parents.Length != 2) throw new ArgumentException("ERROR in SinglePointCrossover: The number of parents is not equal to 2");
|
---|
[3062] | 58 |
|
---|
| 59 | return NPointCrossover.Apply(random, parents[0], parents[1], new IntValue(1));
|
---|
| 60 | }
|
---|
| 61 | }
|
---|
| 62 | }
|
---|