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.Linq;
|
---|
25 | using System.Text;
|
---|
26 | using HeuristicLab.Common;
|
---|
27 | using HeuristicLab.Core;
|
---|
28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
29 | using HeuristicLab.Data;
|
---|
30 | using HeuristicLab.Parameters;
|
---|
31 |
|
---|
32 | namespace HeuristicLab.Encodings.BinaryVectorEncoding {
|
---|
33 | /// <summary>
|
---|
34 | /// Single point crossover for binary vectors.
|
---|
35 | /// </summary>
|
---|
36 | /// <remarks>
|
---|
37 | /// It is implemented based on the NPointCrossover
|
---|
38 | /// </remarks>
|
---|
39 | [Item("SinglePointCrossover", "Single point crossover for binary vectors. It is implemented based on the NPointCrossover.")]
|
---|
40 | [StorableClass]
|
---|
41 | public class SinglePointCrossover: BinaryVectorCrossover {
|
---|
42 | /// <summary>
|
---|
43 | /// Performs a single point crossover at a randomly chosen position of two
|
---|
44 | /// given parent binary vectors.
|
---|
45 | /// </summary>
|
---|
46 | /// <exception cref="ArgumentException">Thrown if there are not exactly two parents.</exception>
|
---|
47 | /// <param name="random">A random number generator.</param>
|
---|
48 | /// <param name="parents">An array containing the two binary vectors that should be crossed.</param>
|
---|
49 | /// <returns>The newly created binary vector, resulting from the single point crossover.</returns>
|
---|
50 | protected override BinaryVector Cross(IRandom random, ItemArray<BinaryVector> parents) {
|
---|
51 | if (parents.Length != 2) throw new ArgumentException("ERROR in SinglePointCrossover: The number of parents is not equal to 2");
|
---|
52 |
|
---|
53 | return NPointCrossover.Apply(random, parents[0], parents[1], new IntValue(1));
|
---|
54 | }
|
---|
55 | }
|
---|
56 | }
|
---|