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 | /// Single point crossover for real vectors.
|
---|
30 | /// </summary>
|
---|
31 | public class SinglePointCrossover : RealVectorCrossoverBase {
|
---|
32 | /// <inheritdoc select="summary"/>
|
---|
33 | public override string Description {
|
---|
34 | get { return "Single point crossover for real vectors."; }
|
---|
35 | }
|
---|
36 |
|
---|
37 | /// <summary>
|
---|
38 | /// Performs a single point crossover at a randomly chosen position of the two
|
---|
39 | /// given parent real vectors.
|
---|
40 | /// </summary>
|
---|
41 | /// <param name="random">A random number generator.</param>
|
---|
42 | /// <param name="parent1">The first parent for crossover.</param>
|
---|
43 | /// <param name="parent2">The second parent for crossover.</param>
|
---|
44 | /// <returns>The newly created real vector, resulting from the single point crossover.</returns>
|
---|
45 | public static double[] Apply(IRandom random, double[] parent1, double[] parent2) {
|
---|
46 | int length = parent1.Length;
|
---|
47 | double[] result = new double[length];
|
---|
48 | int breakPoint = random.Next(1, length);
|
---|
49 |
|
---|
50 | for (int i = 0; i < breakPoint; i++)
|
---|
51 | result[i] = parent1[i];
|
---|
52 | for (int i = breakPoint; i < length; i++)
|
---|
53 | result[i] = parent2[i];
|
---|
54 |
|
---|
55 | return result;
|
---|
56 | }
|
---|
57 |
|
---|
58 | /// <summary>
|
---|
59 | /// Performs a single point crossover operation for two given parent real vectors.
|
---|
60 | /// </summary>
|
---|
61 | /// <exception cref="InvalidOperationException">Thrown if there are not exactly two parents.</exception>
|
---|
62 | /// <param name="scope">The current scope.</param>
|
---|
63 | /// <param name="random">A random number generator.</param>
|
---|
64 | /// <param name="parents">An array containing the two real vectors that should be crossed.</param>
|
---|
65 | /// <returns>The newly created real vector, resulting from the crossover operation.</returns>
|
---|
66 | protected override double[] Cross(IScope scope, IRandom random, double[][] parents) {
|
---|
67 | if (parents.Length != 2) throw new InvalidOperationException("ERROR in SinglePointCrossover: The number of parents is not equal to 2");
|
---|
68 | return Apply(random, parents[0], parents[1]);
|
---|
69 | }
|
---|
70 | }
|
---|
71 | }
|
---|