Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding/3.4/Crossovers/SymbolicExpressionTreeCrossover.cs @ 10355

Last change on this file since 10355 was 10291, checked in by mkommend, 11 years ago

#2119: Added interface for instrumented operators and adapted problem and encoding specific operators to provide instrumentation capabilities.

File size: 3.6 KB
RevLine 
[3223]1#region License Information
2/* HeuristicLab
[9456]3 * Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[3223]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
[4068]22using System;
[4722]23using HeuristicLab.Common;
[3223]24using HeuristicLab.Core;
25using HeuristicLab.Parameters;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
[5499]28namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding {
[3223]29  /// <summary>
[3237]30  /// A base class for operators that perform a crossover of symbolic expression trees.
[3223]31  /// </summary>
[3237]32  [Item("SymbolicExpressionTreeCrossover", "A base class for operators that perform a crossover of symbolic expression trees.")]
[3223]33  [StorableClass]
[3534]34  public abstract class SymbolicExpressionTreeCrossover : SymbolicExpressionTreeOperator, ISymbolicExpressionTreeCrossover {
[3294]35    private const string ParentsParameterName = "Parents";
36    private const string ChildParameterName = "Child";
[5499]37    #region Parameter Properties
[5510]38    public ILookupParameter<ItemArray<ISymbolicExpressionTree>> ParentsParameter {
39      get { return (ScopeTreeLookupParameter<ISymbolicExpressionTree>)Parameters[ParentsParameterName]; }
[3223]40    }
[5510]41    public ILookupParameter<ISymbolicExpressionTree> ChildParameter {
42      get { return (ILookupParameter<ISymbolicExpressionTree>)Parameters[ChildParameterName]; }
[3223]43    }
[5499]44    #endregion
45    #region Properties
[5510]46    public ItemArray<ISymbolicExpressionTree> Parents {
[5499]47      get { return ParentsParameter.ActualValue; }
[3223]48    }
[5510]49    public ISymbolicExpressionTree Child {
[5499]50      get { return ChildParameter.ActualValue; }
51      set { ChildParameter.ActualValue = value; }
[3237]52    }
[5499]53    #endregion
[4722]54    [StorableConstructor]
55    protected SymbolicExpressionTreeCrossover(bool deserializing) : base(deserializing) { }
56    protected SymbolicExpressionTreeCrossover(SymbolicExpressionTreeCrossover original, Cloner cloner) : base(original, cloner) { }
[3237]57    protected SymbolicExpressionTreeCrossover()
[3223]58      : base() {
[5510]59      Parameters.Add(new ScopeTreeLookupParameter<ISymbolicExpressionTree>(ParentsParameterName, "The parent symbolic expression trees which should be crossed."));
60      Parameters.Add(new LookupParameter<ISymbolicExpressionTree>(ChildParameterName, "The child symbolic expression tree resulting from the crossover."));
[8344]61      ParentsParameter.ActualName = "SymbolicExpressionTree";
62      ChildParameter.ActualName = "SymbolicExpressionTree";
[3223]63    }
64
[10291]65    public sealed override IOperation InstrumentedApply() {
[5499]66      if (Parents.Length != 2)
[3237]67        throw new ArgumentException("Number of parents must be exactly two for symbolic expression tree crossover operators.");
68
[7506]69      ISymbolicExpressionTree result = Crossover(Random, Parents[0], Parents[1]);
[3237]70
[5499]71      Child = result;
[10291]72      return base.InstrumentedApply();
[3223]73    }
74
[7506]75    public abstract ISymbolicExpressionTree Crossover(IRandom random, ISymbolicExpressionTree parent0, ISymbolicExpressionTree parent1);
[3223]76  }
[3294]77}
Note: See TracBrowser for help on using the repository browser.