source: branches/2936_GQAPIntegration/HeuristicLab.Problems.GeneralizedQuadraticAssignment/3.3/Operators/Crossovers/GQAPCrossover.cs @ 16077

Last change on this file since 16077 was 16077, checked in by abeham, 12 months ago

#2936: Added integration branch

File size: 3.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2018 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.IntegerVectorEncoding;
25using HeuristicLab.Operators;
26using HeuristicLab.Optimization;
27using HeuristicLab.Parameters;
28using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
29
30namespace HeuristicLab.Problems.GeneralizedQuadraticAssignment {
31
32  [Item("GQAPCrossover", "A base class for operators that cross assignment vectors of the GeneralizedQuadraticAssignment problems.")]
33  [StorableClass]
34  public abstract class GQAPCrossover : SingleSuccessorOperator, IGQAPCrossover, IStochasticOperator {
35    public override bool CanChangeName {
36      get { return false; }
37    }
38
39    public IScopeTreeLookupParameter<IntegerVector> ParentsParameter {
40      get { return (ScopeTreeLookupParameter<IntegerVector>)Parameters["Parents"]; }
41    }
42    public ILookupParameter<IntegerVector> ChildParameter {
43      get { return (ILookupParameter<IntegerVector>)Parameters["Child"]; }
44    }
45    public ILookupParameter<IRandom> RandomParameter {
46      get { return (LookupParameter<IRandom>)Parameters["Random"]; }
47    }
48    public ILookupParameter<GQAPInstance> ProblemInstanceParameter {
49      get { return (ILookupParameter<GQAPInstance>)Parameters["ProblemInstance"]; }
50    }
51
52    [StorableConstructor]
53    protected GQAPCrossover(bool deserializing) : base(deserializing) { }
54    protected GQAPCrossover(GQAPCrossover original, Cloner cloner) : base(original, cloner) { }
55    protected GQAPCrossover()
56      : base() {
57      Parameters.Add(new ScopeTreeLookupParameter<IntegerVector>("Parents", "The parent vectors which should be crossed.", "Assignment"));
58      Parameters.Add(new LookupParameter<IntegerVector>("Child", "The child vector resulting from the crossover.", "Assignment"));
59      Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator which should be used for stochastic crossover operators."));
60      Parameters.Add(new LookupParameter<GQAPInstance>("ProblemInstance", GQAP.ProblemInstanceDescription));
61    }
62
63    public sealed override IOperation Apply() {
64      ChildParameter.ActualValue = Cross(RandomParameter.ActualValue, ParentsParameter.ActualValue, ProblemInstanceParameter.ActualValue);
65      return base.Apply();
66    }
67
68    protected abstract IntegerVector Cross(IRandom random, ItemArray<IntegerVector> parents, GQAPInstance problemInstance);
69  }
70}
Note: See TracBrowser for help on using the repository browser.