Free cookie consent management tool by TermsFeed Policy Generator

source: branches/ScatterSearch/HeuristicLab.Algorithms.ScatterSearch/3.3/Knapsack/NBinaryVectorCrossover.cs @ 7744

Last change on this file since 7744 was 7744, checked in by jkarder, 12 years ago

#1331:

  • added problem specific improvement operators (KnapsackImprovementOperator, TravelingSalesmanImprovementOperator)
  • added custom interface (IScatterSearchTargetProcessor) for Scatter Search specific operators that use a target parameter
  • added custom operator (OffspringProcessor) to process multiple children that were created by crossovers
  • extracted diversity calculation and added problem/encoding specific operators (BinaryVectorDiversityCalculator, PermutationDiversityCalculator) for it
  • added parameters and adjusted types
  • adjusted event handling
  • minor code improvements
File size: 3.4 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 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 HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Encodings.BinaryVectorEncoding;
25using HeuristicLab.Operators;
26using HeuristicLab.Optimization;
27using HeuristicLab.Parameters;
28using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
29
30namespace HeuristicLab.Algorithms.ScatterSearch.Knapsack {
31  /// <summary>
32  /// A base class for operators that perform a crossover of bool-valued vectors.
33  /// </summary>
34  [Item("NBinaryVectorCrossover", "A base class for operators that perform a crossover of bool-valued vectors.")]
35  [StorableClass]
36  public abstract class NBinaryVectorCrossover : SingleSuccessorOperator, INBinaryVectorCrossover, IStochasticOperator {
37    public override bool CanChangeName {
38      get { return false; }
39    }
40
41    #region Parameter properties
42    public ScopeParameter CurrentScopeParameter {
43      get { return (ScopeParameter)Parameters["CurrentScope"]; }
44    }
45    public ILookupParameter<IRandom> RandomParameter {
46      get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
47    }
48    public ILookupParameter<ItemArray<BinaryVector>> ParentsParameter {
49      get { return (IScopeTreeLookupParameter<BinaryVector>)Parameters["Parents"]; }
50    }
51    #endregion
52
53    #region Properties
54    private IScope CurrentScope {
55      get { return CurrentScopeParameter.ActualValue; }
56    }
57    #endregion
58
59    [StorableConstructor]
60    protected NBinaryVectorCrossover(bool deserializing) : base(deserializing) { }
61    protected NBinaryVectorCrossover(NBinaryVectorCrossover original, Cloner cloner) : base(original, cloner) { }
62    protected NBinaryVectorCrossover()
63      : base() {
64      #region Create parameters
65      Parameters.Add(new ScopeParameter("CurrentScope"));
66      Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator which should be used for stochastic crossover operators."));
67      Parameters.Add(new ScopeTreeLookupParameter<BinaryVector>("Parents", "The parent vectors which should be crossed."));
68      #endregion
69      ParentsParameter.ActualName = "BinaryVector";
70    }
71
72    public sealed override IOperation Apply() {
73      var offspringSolutions = Cross(RandomParameter.ActualValue, ParentsParameter.ActualValue);
74      for (int i = 0; i < offspringSolutions.Length; i++) {
75        CurrentScope.Variables.Add(new Variable(string.Format("Child {0}", i), offspringSolutions[i]));
76      }
77      return base.Apply();
78    }
79
80    protected abstract ItemArray<BinaryVector> Cross(IRandom random, ItemArray<BinaryVector> parents);
81  }
82}
Note: See TracBrowser for help on using the repository browser.