1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2014 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.Linq;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Parameters;
|
---|
27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
28 |
|
---|
29 | namespace HeuristicLab.EvolutionTracking {
|
---|
30 | [StorableClass]
|
---|
31 | [Item("AfterCrossoverOperator", "Performs an action after the crossover operator is applied.")]
|
---|
32 | public class BeforeManipulatorOperator<T> : EvolutionTrackingOperator<T>, IManipulatorOperator<T> where T : class,IItem {
|
---|
33 |
|
---|
34 | private const string ChildParameterName = "Child";
|
---|
35 |
|
---|
36 | public ILookupParameter<T> ChildParameter {
|
---|
37 | get { return (ILookupParameter<T>)Parameters[ChildParameterName]; }
|
---|
38 | }
|
---|
39 |
|
---|
40 | protected BeforeManipulatorOperator(BeforeManipulatorOperator<T> original, Cloner cloner)
|
---|
41 | : base(original, cloner) {
|
---|
42 | }
|
---|
43 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
44 | return new BeforeManipulatorOperator<T>(this, cloner);
|
---|
45 | }
|
---|
46 |
|
---|
47 | public BeforeManipulatorOperator() {
|
---|
48 | Parameters.Add(new LookupParameter<T>(ChildParameterName));
|
---|
49 | }
|
---|
50 |
|
---|
51 | public override IOperation Apply() {
|
---|
52 | // since mutation always takes place after crossover, the vertex for the current child is already in the tree
|
---|
53 | var v = (IGenealogyGraphNode<T>)GenealogyGraph.GetVertex(ChildParameter.ActualValue);
|
---|
54 |
|
---|
55 | if (!v.Rank.IsAlmost(Generations.Value + 1)) {
|
---|
56 | throw new Exception("Child rank should be generations.value + 1");
|
---|
57 | }
|
---|
58 | var clone = (T)ChildParameter.ActualValue.Clone();
|
---|
59 |
|
---|
60 | var c = new GenealogyGraphNode<T>(clone) { Rank = v.Rank - 0.5 };
|
---|
61 |
|
---|
62 | foreach (var a in v.InArcs) {
|
---|
63 | a.Target = c;
|
---|
64 | c.AddReverseArc(a);
|
---|
65 | }
|
---|
66 |
|
---|
67 | v.InArcs = Enumerable.Empty<IGenealogyGraphArc>();
|
---|
68 |
|
---|
69 | GenealogyGraph.AddVertex(c);
|
---|
70 | GenealogyGraph.AddArc(c, v);
|
---|
71 |
|
---|
72 | return base.Apply();
|
---|
73 | }
|
---|
74 | }
|
---|
75 | }
|
---|