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 |
|
---|
22 | using HeuristicLab.Common;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Encodings.BinaryVectorEncoding;
|
---|
25 | using HeuristicLab.Operators;
|
---|
26 | using HeuristicLab.Optimization;
|
---|
27 | using HeuristicLab.Parameters;
|
---|
28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
29 |
|
---|
30 | namespace 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"));
|
---|
67 | Parameters.Add(new ScopeTreeLookupParameter<BinaryVector>("Parents"));
|
---|
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 | }
|
---|