source: branches/HeuristicLab.EvolutionTracking/HeuristicLab.EvolutionTracking/3.4/Operators/BeforeCrossoverOperator.cs @ 10886

Last change on this file since 10886 was 10886, checked in by bburlacu, 8 years ago

#1772: Simplified GenealogyGraph (and related components) API in an effort to improve speed and memory consumption (eg., by sharing the same arc when walking the graph in both directions: parent-child and child-parent).

File size: 3.6 KB
Line 
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
22using System;
23using System.Collections.Generic;
24using System.Linq;
25using HeuristicLab.Common;
26using HeuristicLab.Core;
27using HeuristicLab.Data;
28using HeuristicLab.Parameters;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30
31namespace HeuristicLab.EvolutionTracking {
32  [StorableClass]
33  [Item("AfterCrossoverOperator", "A generic operator that can record genealogical relationships between crossover parents and children.")]
34  public class BeforeCrossoverOperator<T> : EvolutionTrackingOperator<T>, ICrossoverOperator<T> where T : class,IItem {
35    private const string ParentsParameterName = "Parents";
36    private const string ChildParameterName = "Child";
37
38    public IScopeTreeLookupParameter<T> ParentsParameter {
39      get { return (IScopeTreeLookupParameter<T>)Parameters[ParentsParameterName]; }
40    }
41    public ILookupParameter<T> ChildParameter {
42      get { return (ILookupParameter<T>)Parameters[ChildParameterName]; }
43    }
44
45    protected BeforeCrossoverOperator(BeforeCrossoverOperator<T> original, Cloner cloner)
46      : base(original, cloner) {
47    }
48    public override IDeepCloneable Clone(Cloner cloner) {
49      return new BeforeCrossoverOperator<T>(this, cloner);
50    }
51
52    public BeforeCrossoverOperator() {
53      Parameters.Add(new ScopeTreeLookupParameter<T>(ParentsParameterName));
54      Parameters.Add(new LookupParameter<T>(ChildParameterName));
55    }
56
57    protected List<IGenealogyGraphNode<T>> CurrentGeneration {
58      get {
59        if (GenealogyGraph.Ranks.ContainsKey(Generations.Value))
60          return GenealogyGraph.Ranks[Generations.Value].Cast<IGenealogyGraphNode<T>>().ToList();
61        return null;
62      }
63    }
64
65    private readonly Func<IScope, string> getScopeId = s => ((StringValue)s.Variables["Id"].Value).Value;
66    public override IOperation Apply() {
67      if (CurrentGeneration == null) throw new Exception();
68      var subScopes = ExecutionContext.Scope.SubScopes;
69      var parentVertices = subScopes.Select(x => (GenealogyGraphNode<T>)GenealogyGraph.GetVertex(getScopeId(x))).ToList();
70
71      var parents = ParentsParameter.ActualValue.ToList();
72
73      var childVertex = new GenealogyGraphNode<T> {
74        // the child parameter does not have a value yet (it will be assigned after crossover),
75        // but the first parent is actually the future child so we use this
76        Content = parents[0],
77        Rank = parentVertices[0].Rank + 1
78      };
79      GenealogyGraph.AddVertex(childVertex);
80      foreach (var parentVertex in parentVertices) {
81        GenealogyGraph.AddArc(parentVertex, childVertex);
82      }
83      ExecutionContext.Scope.Variables.Add(new Variable("Id", new StringValue(childVertex.Id)));
84
85      return base.Apply();
86    }
87  }
88}
Note: See TracBrowser for help on using the repository browser.