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.IntegerVectorEncoding;
|
---|
25 | using HeuristicLab.Operators;
|
---|
26 | using HeuristicLab.Optimization;
|
---|
27 | using HeuristicLab.Parameters;
|
---|
28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
29 |
|
---|
30 | namespace 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 |
|
---|
49 | [StorableConstructor]
|
---|
50 | protected GQAPCrossover(bool deserializing) : base(deserializing) { }
|
---|
51 | protected GQAPCrossover(GQAPCrossover original, Cloner cloner) : base(original, cloner) { }
|
---|
52 | protected GQAPCrossover()
|
---|
53 | : base() {
|
---|
54 | Parameters.Add(new ScopeTreeLookupParameter<IntegerVector>("Parents", "The parent vectors which should be crossed.", "Assignment"));
|
---|
55 | Parameters.Add(new LookupParameter<IntegerVector>("Child", "The child vector resulting from the crossover.", "Assignment"));
|
---|
56 | Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator which should be used for stochastic crossover operators."));
|
---|
57 | }
|
---|
58 |
|
---|
59 | public sealed override IOperation Apply() {
|
---|
60 | ChildParameter.ActualValue = Cross(RandomParameter.ActualValue, ParentsParameter.ActualValue);
|
---|
61 | return base.Apply();
|
---|
62 | }
|
---|
63 |
|
---|
64 | protected abstract IntegerVector Cross(IRandom random, ItemArray<IntegerVector> parents);
|
---|
65 | }
|
---|
66 | }
|
---|