source: branches/2839_HiveProjectManagement/HeuristicLab.Encodings.LinearLinkageEncoding/3.4/Crossovers/SinglePointCrossover.cs @ 16057

Last change on this file since 16057 was 16057, checked in by jkarder, 15 months ago

#2839:

File size: 2.3 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2018 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
22using System;
23using HeuristicLab.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
26
27namespace HeuristicLab.Encodings.LinearLinkageEncoding {
28  [Item("Single Point Crossover", "The single point crossover concatenates two linkage strings at a randomly chosen point.")]
29  [StorableClass]
30  public sealed class SinglePointCrossover : LinearLinkageCrossover {
31
32    [StorableConstructor]
33    private SinglePointCrossover(bool deserializing) : base(deserializing) { }
34    private SinglePointCrossover(SinglePointCrossover original, Cloner cloner) : base(original, cloner) { }
35    public SinglePointCrossover() { }
36
37    public override IDeepCloneable Clone(Cloner cloner) {
38      return new SinglePointCrossover(this, cloner);
39    }
40
41    public static LinearLinkage Apply(IRandom random, LinearLinkage p1, LinearLinkage p2) {
42      var length = p1.Length;
43      var child = LinearLinkage.SingleElementGroups(length);
44      var bp = random.Next(length - 1);
45      for (var i = 0; i <= bp; i++) child[i] = p1[i];
46      for (var i = bp + 1; i < length; i++) child[i] = p2[i];
47      child.LinearizeTreeStructures();
48      return child;
49    }
50
51    protected override LinearLinkage Cross(IRandom random, ItemArray<LinearLinkage> parents) {
52      if (parents.Length != 2) throw new InvalidOperationException(Name + ": Can only cross exactly two parents.");
53      return Apply(random, parents[0], parents[1]);
54    }
55  }
56}
Note: See TracBrowser for help on using the repository browser.