1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2008 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 |
|
---|
27 | namespace HeuristicLab.RealVector {
|
---|
28 | /// <summary>
|
---|
29 | /// Discrete crossover for real vectors: For each position in the new vector an allele
|
---|
30 | /// of one of the parents is randomly selected.
|
---|
31 | /// </summary>
|
---|
32 | public class DiscreteCrossover : RealVectorCrossoverBase {
|
---|
33 | /// <inheritdoc select="summary"/>
|
---|
34 | public override string Description {
|
---|
35 | get { return @"Discrete crossover for real vectors: creates a new offspring by combining the alleles in the parents such that each allele is randomly selected from one parent."; }
|
---|
36 | }
|
---|
37 |
|
---|
38 | /// <summary>
|
---|
39 | /// Performs a discrete crossover operation on multiple given parents.
|
---|
40 | /// </summary>
|
---|
41 | /// <param name="random">A random number generator.</param>
|
---|
42 | /// <param name="parents">An array containing the parents that should be crossed.</param>
|
---|
43 | /// <returns>The newly created real vector, resulting from the crossover operation.</returns>
|
---|
44 | public static double[] Apply(IRandom random, double[][] parents) {
|
---|
45 | int length = parents[0].Length;
|
---|
46 | double[] result = new double[length];
|
---|
47 | for (int i = 0; i < length; i++) {
|
---|
48 | result[i] = parents[random.Next(parents.Length)][i];
|
---|
49 | }
|
---|
50 | return result;
|
---|
51 | }
|
---|
52 |
|
---|
53 | /// <summary>
|
---|
54 | /// Performs a discrete crossover operation for multiple given parent real vectors.
|
---|
55 | /// </summary>
|
---|
56 | /// <exception cref="InvalidOperationException">Thrown if there are less than two parents.</exception>
|
---|
57 | /// <param name="scope">The current scope.</param>
|
---|
58 | /// <param name="random">A random number generator.</param>
|
---|
59 | /// <param name="parents">An array containing the real vectors that should be crossed.</param>
|
---|
60 | /// <returns>The newly created real vector, resulting from the crossover operation.</returns>
|
---|
61 | protected override double[] Cross(IScope scope, IRandom random, double[][] parents) {
|
---|
62 | if (parents.Length < 2) throw new InvalidOperationException("ERROR in DiscreteCrossover: The number of parents is less than 2");
|
---|
63 | return Apply(random, parents);
|
---|
64 | }
|
---|
65 | }
|
---|
66 | }
|
---|