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.Linq;
|
---|
23 | using HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Parameters;
|
---|
26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
27 |
|
---|
28 | namespace HeuristicLab.EvolutionTracking {
|
---|
29 | [StorableClass]
|
---|
30 | [Item("AfterCrossoverOperator", "Performs an action after the crossover operator is applied.")]
|
---|
31 | public class BeforeManipulatorOperator<T> : EvolutionTrackingOperator<T>, IManipulatorOperator<T> where T : class,IItem {
|
---|
32 | private const string ChildParameterName = "Child";
|
---|
33 |
|
---|
34 | public ILookupParameter<T> ChildParameter {
|
---|
35 | get { return (ILookupParameter<T>)Parameters[ChildParameterName]; }
|
---|
36 | }
|
---|
37 |
|
---|
38 | protected BeforeManipulatorOperator(BeforeManipulatorOperator<T> original, Cloner cloner)
|
---|
39 | : base(original, cloner) {
|
---|
40 | }
|
---|
41 |
|
---|
42 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
43 | return new BeforeManipulatorOperator<T>(this, cloner);
|
---|
44 | }
|
---|
45 |
|
---|
46 | [StorableConstructor]
|
---|
47 | protected BeforeManipulatorOperator(bool deserializing) : base(deserializing) { }
|
---|
48 |
|
---|
49 | public BeforeManipulatorOperator() {
|
---|
50 | Parameters.Add(new LookupParameter<T>(ChildParameterName));
|
---|
51 | }
|
---|
52 |
|
---|
53 | public override IOperation Apply() {
|
---|
54 | // since mutation always takes place after crossover, the vertex for the current child is already in the tree
|
---|
55 | var childVertex = GenealogyGraph.GetByContent(ChildParameter.ActualValue);
|
---|
56 | var clonedVertex = (IGenealogyGraphNode<T>)childVertex.Clone();
|
---|
57 | clonedVertex.Rank = childVertex.Rank - 0.5;
|
---|
58 | GenealogyGraph.AddVertex(clonedVertex);
|
---|
59 |
|
---|
60 | var arcs = childVertex.InArcs.ToList();
|
---|
61 | foreach (var arc in arcs) {
|
---|
62 | var p = arc.Source;
|
---|
63 | GenealogyGraph.RemoveArc(arc);
|
---|
64 | GenealogyGraph.AddArc(new GenealogyGraphArc(p, clonedVertex));
|
---|
65 | }
|
---|
66 | // by convention, the arc connecting child with parent (non-root parent in case of crossover)
|
---|
67 | // holds fragment data when applicable. the following line of code preserves this data
|
---|
68 | // the graph arcs are now connecting parent (rank n) --> clone (rank n+0.5) --> child (rank n+1)
|
---|
69 | clonedVertex.InArcs.Last().Data = arcs.Last().Data;
|
---|
70 | GenealogyGraph.AddArc(new GenealogyGraphArc(clonedVertex, childVertex));
|
---|
71 |
|
---|
72 | return base.Apply();
|
---|
73 | }
|
---|
74 | }
|
---|
75 | }
|
---|