1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
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.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
26 |
|
---|
27 | namespace HeuristicLab.Encodings.IntegerVectorEncoding {
|
---|
28 | /// <summary>
|
---|
29 | /// Discrete crossover for integer vectors.
|
---|
30 | /// </summary>
|
---|
31 | ///
|
---|
32 | /// It is implemented as described in Gwiazda, T.D. 2006. Genetic algorithms reference Volume I Crossover for single-objective numerical optimization problems, p.17.
|
---|
33 | /// </remarks>
|
---|
34 | [Item("DiscreteCrossover", "Discrete crossover for integer vectors. It is implemented as described in Gwiazda, T.D. 2006. Genetic algorithms reference Volume I Crossover for single-objective numerical optimization problems, p.17.")]
|
---|
35 | [StorableType("23781F8B-1DE6-48D8-9207-EAA1767C261A")]
|
---|
36 | public class DiscreteCrossover : IntegerVectorCrossover {
|
---|
37 | [StorableConstructor]
|
---|
38 | protected DiscreteCrossover(bool deserializing) : base(deserializing) { }
|
---|
39 | protected DiscreteCrossover(DiscreteCrossover original, Cloner cloner) : base(original, cloner) { }
|
---|
40 | public DiscreteCrossover() : base() { }
|
---|
41 |
|
---|
42 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
43 | return new DiscreteCrossover(this, cloner);
|
---|
44 | }
|
---|
45 |
|
---|
46 | /// <summary>
|
---|
47 | /// Performs a discrete crossover operation of any number of given parents.
|
---|
48 | /// </summary>
|
---|
49 | /// <exception cref="ArgumentException">Thrown when the vectors of the parents are of different length or when there are less than 2 parents.</exception>
|
---|
50 | /// <param name="random">A random number generator.</param>
|
---|
51 | /// <param name="parents">The list of parents for the crossover operation.</param>
|
---|
52 | /// <returns>The newly created integer vector, resulting from the crossover operation.</returns>
|
---|
53 | public static IntegerVector Apply(IRandom random, ItemArray<IntegerVector> parents) {
|
---|
54 | if (parents.Length < 2) throw new ArgumentException("DiscreteCrossover: There are less than two parents to cross.");
|
---|
55 | int length = parents[0].Length;
|
---|
56 |
|
---|
57 | for (int i = 0; i < parents.Length; i++) {
|
---|
58 | if (parents[i].Length != length)
|
---|
59 | throw new ArgumentException("DiscreteCrossover: The parents' vectors are of different length.", "parents");
|
---|
60 | }
|
---|
61 |
|
---|
62 | var result = new IntegerVector(length);
|
---|
63 | for (int i = 0; i < length; i++) {
|
---|
64 | result[i] = parents[random.Next(parents.Length)][i];
|
---|
65 | }
|
---|
66 |
|
---|
67 | return result;
|
---|
68 | }
|
---|
69 |
|
---|
70 | /// <summary>
|
---|
71 | /// Performs a discrete crossover operation for any number of given parent integer vectors.
|
---|
72 | /// </summary>
|
---|
73 | /// <param name="random">A random number generator.</param>
|
---|
74 | /// <param name="parents">An array containing integer vectors that should be crossed.</param>
|
---|
75 | /// <returns>The newly created integer vector, resulting from the crossover operation.</returns>
|
---|
76 | protected override IntegerVector Cross(IRandom random, ItemArray<IntegerVector> parents) {
|
---|
77 | return Apply(random, parents);
|
---|
78 | }
|
---|
79 | }
|
---|
80 | }
|
---|