1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2010 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 System.Collections.Generic;
|
---|
24 | using System.Text;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Data;
|
---|
27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Encodings.IntVector {
|
---|
30 | /// <summary>
|
---|
31 | /// Discrete crossover for integer vectors.
|
---|
32 | /// </summary>
|
---|
33 | ///
|
---|
34 | /// 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 | /// </remarks>
|
---|
36 | [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.")]
|
---|
37 | [StorableClass]
|
---|
38 | public class DiscreteCrossover : IntVectorCrossover {
|
---|
39 | /// <summary>
|
---|
40 | /// Performs a discrete crossover operation of the two given parents.
|
---|
41 | /// </summary>
|
---|
42 | /// <exception cref="ArgumentException">Thrown when the vectors of the parents are of different length.</exception>
|
---|
43 | /// <param name="random">A random number generator.</param>
|
---|
44 | /// <param name="parent1">The first parent for the crossover operation.</param>
|
---|
45 | /// <param name="parent2">The second parent for the crossover operation.</param>
|
---|
46 | /// <returns>The newly created integer vector, resulting from the crossover operation.</returns>
|
---|
47 | public static IntArray Apply(IRandom random, IntArray parent1, IntArray parent2) {
|
---|
48 | if(parent1.Length != parent2.Length)
|
---|
49 | throw new ArgumentException("DiscreteCrossover: The parents are of different length.");
|
---|
50 |
|
---|
51 | int length = parent1.Length;
|
---|
52 | int[] result = new int[length];
|
---|
53 |
|
---|
54 | for (int i = 0; i < length; i++) {
|
---|
55 | if (random.NextDouble() < 0.5)
|
---|
56 | result[i] = parent1[i];
|
---|
57 | else
|
---|
58 | result[i] = parent2[i];
|
---|
59 | }
|
---|
60 | return new IntArray(result);
|
---|
61 | }
|
---|
62 |
|
---|
63 | /// <summary>
|
---|
64 | /// Performs a discrete crossover operation for two given parent integer vectors.
|
---|
65 | /// </summary>
|
---|
66 | /// <exception cref="ArgumentException">Thrown if there are not exactly two parents.</exception>
|
---|
67 | /// <param name="random">A random number generator.</param>
|
---|
68 | /// <param name="parents">An array containing the two integer vectors that should be crossed.</param>
|
---|
69 | /// <returns>The newly created integer vector, resulting from the crossover operation.</returns>
|
---|
70 | protected override IntArray Cross(IRandom random, ItemArray<IntArray> parents) {
|
---|
71 | if (parents.Length != 2) throw new ArgumentException("ERROR in DiscreteCrossover: The number of parents is not equal to 2");
|
---|
72 | return Apply(random, parents[0], parents[1]);
|
---|
73 | }
|
---|
74 | }
|
---|
75 | }
|
---|