Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.EvolutionTracking/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/Tracking/SymbolicDataAnalysisExpressionBeforeManipulatorOperator.cs @ 16130

Last change on this file since 16130 was 12951, checked in by bburlacu, 9 years ago

#1772:

  • Slight refactor in QueryMatch.cs
  • Added a parameter to the genealogy analyzer for removing older generations from the graph (useful to conserve memory in experiments)
  • Updated wildcard nodes (added persistence & cloning)
  • Implemented diversification strategy based on schema frequencies & phenotypic similarity as a separate operator (for now keep also the analyzer)
  • Updated license headers
  • Added QueryMatch performance test (to be expanded)
File size: 3.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 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.Linq;
23using HeuristicLab.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
26using HeuristicLab.EvolutionTracking;
27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
28
29namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
30  [StorableClass]
31  [Item("SymbolicDataAnalysisExpressionBeforeManipulatorOperator", "An operator which sets up tracking for mutation fragments.")]
32  public class SymbolicDataAnalysisExpressionBeforeManipulatorOperator : BeforeManipulatorOperator<ISymbolicExpressionTree> {
33    public SymbolicDataAnalysisExpressionBeforeManipulatorOperator() { }
34
35    protected SymbolicDataAnalysisExpressionBeforeManipulatorOperator(SymbolicDataAnalysisExpressionBeforeManipulatorOperator original, Cloner cloner)
36      : base(original, cloner) {
37    }
38
39    public override IDeepCloneable Clone(Cloner cloner) {
40      return new SymbolicDataAnalysisExpressionBeforeManipulatorOperator(this, cloner);
41    }
42
43    [StorableConstructor]
44    protected SymbolicDataAnalysisExpressionBeforeManipulatorOperator(bool deserializing) : base(deserializing) { }
45
46    public override IOperation Apply() {
47      // the call below does the following things:
48      // 1) creates a clone of the individual to be manipulated, and adds it in the genealogy graph with rank = currentRank - 0.5.
49      //    the cloning will also clone the vertex data object, therefore reference comparison of node lists will not work
50      // 2) replaces the parent of the current individual with the clone, and alters graph connections accordingly
51      //    so that vChild vertex will represent the child, and vClone will represent the cloned parent
52      var result = base.Apply();
53      var vChild = GenealogyGraph.GetByContent(ChildParameter.ActualValue);
54      var vClone = vChild.Parents.Last();
55
56      var fragment = (IFragment<ISymbolicExpressionTreeNode>)vClone.InArcs.Last().Data;
57      if (fragment != null) {
58        // this step must be performed because the fragment root actually references the original child (not the clone).
59        // when mutation occurs the fragment root would point to the mutated subtree in the child instead of the original one in the clone
60        fragment.Root = vClone.Data.IterateNodesPrefix().ElementAt(fragment.Index1);
61      }
62
63      return result;
64    }
65  }
66}
Note: See TracBrowser for help on using the repository browser.