1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2012 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 HeuristicLab.Common;
|
---|
26 | using HeuristicLab.Core;
|
---|
27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.Encodings.DecisionList.Crossover {
|
---|
30 | [Item("SinglePointCrossover", "Description missing")]
|
---|
31 | [StorableClass]
|
---|
32 | public class SinglePointCrossover : DecisionListCrossover {
|
---|
33 |
|
---|
34 | #region Parameter Properties
|
---|
35 | #endregion
|
---|
36 |
|
---|
37 | [StorableConstructor]
|
---|
38 | protected SinglePointCrossover(bool deserializing) : base(deserializing) { }
|
---|
39 | protected SinglePointCrossover(SinglePointCrossover original, Cloner cloner)
|
---|
40 | : base(original, cloner) {
|
---|
41 | }
|
---|
42 | public SinglePointCrossover()
|
---|
43 | : base() {
|
---|
44 | }
|
---|
45 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
46 | return new SinglePointCrossover(this, cloner);
|
---|
47 | }
|
---|
48 |
|
---|
49 | public static DecisionList Apply(IRandom random, DecisionList parent1, DecisionList parent2) {
|
---|
50 | if (parent1 == null && parent1 != parent2) { throw new ArgumentException("Either both parents have a default action or none does."); }
|
---|
51 | if (parent1.DefaultAction != null && !parent1.DefaultAction.Match(parent2.DefaultAction)) { throw new ArgumentException("Default action of parents have to match!"); }
|
---|
52 |
|
---|
53 | int rulesP1 = random.Next(0, parent1.Rules.Count());
|
---|
54 | int rulesP2 = random.Next(0, parent2.Rules.Count());
|
---|
55 |
|
---|
56 | var rules = new List<Rule>(rulesP1 + rulesP2);
|
---|
57 | for (int i = 0; i < rulesP1; i++) {
|
---|
58 | rules.Add((Rule)parent1.Rules[i].Clone());
|
---|
59 | }
|
---|
60 |
|
---|
61 | rules.Add(parent1.Rules[rulesP1].Crossover(parent2.Rules[rulesP2], random));
|
---|
62 |
|
---|
63 | for (int i = rulesP2 + 1; i < parent2.Rules.Count(); i++) {
|
---|
64 | rules.Add((Rule)parent2.Rules[i].Clone());
|
---|
65 | }
|
---|
66 |
|
---|
67 | if (parent1.DefaultAction == null) {
|
---|
68 | return new DecisionList(rules);
|
---|
69 | }
|
---|
70 | return new DecisionList(rules, parent1.DefaultAction);
|
---|
71 | }
|
---|
72 |
|
---|
73 | protected override DecisionList Cross(IRandom random, ItemArray<DecisionList> parents) {
|
---|
74 | if (parents.Length != 2) throw new ArgumentException("ERROR in SinglePointCrossover: The number of parents is not equal to 2");
|
---|
75 | return Apply(random, parents[0], parents[1]);
|
---|
76 | }
|
---|
77 | }
|
---|
78 | }
|
---|