[12285] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16453] | 3 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[12285] | 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 System;
|
---|
| 23 | using HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Operators;
|
---|
| 26 | using HeuristicLab.Optimization;
|
---|
| 27 | using HeuristicLab.Parameters;
|
---|
[16559] | 28 | using HEAL.Attic;
|
---|
[12285] | 29 |
|
---|
| 30 | namespace HeuristicLab.Encodings.LinearLinkageEncoding {
|
---|
| 31 | [Item("Linear Linkage Crossover", "Base class for linear linkage crossovers.")]
|
---|
[16462] | 32 | [StorableType("AB45F937-ECD4-4658-BC9E-793EE0453A0C")]
|
---|
[12285] | 33 | public abstract class LinearLinkageCrossover : InstrumentedOperator, ILinearLinkageCrossover, IStochasticOperator {
|
---|
| 34 |
|
---|
| 35 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 36 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 37 | }
|
---|
| 38 |
|
---|
| 39 | public ILookupParameter<LinearLinkage> ChildParameter {
|
---|
| 40 | get { return (ILookupParameter<LinearLinkage>)Parameters["Child"]; }
|
---|
| 41 | }
|
---|
| 42 |
|
---|
| 43 | public IScopeTreeLookupParameter<LinearLinkage> ParentsParameter {
|
---|
| 44 | get { return (IScopeTreeLookupParameter<LinearLinkage>)Parameters["Parents"]; }
|
---|
| 45 | }
|
---|
| 46 |
|
---|
| 47 | [StorableConstructor]
|
---|
[16462] | 48 | protected LinearLinkageCrossover(StorableConstructorFlag _) : base(_) { }
|
---|
[12285] | 49 | protected LinearLinkageCrossover(LinearLinkageCrossover original, Cloner cloner) : base(original, cloner) { }
|
---|
| 50 | protected LinearLinkageCrossover() {
|
---|
| 51 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator to use."));
|
---|
| 52 | Parameters.Add(new LookupParameter<LinearLinkage>("Child", "The child that is to be created."));
|
---|
| 53 | Parameters.Add(new ScopeTreeLookupParameter<LinearLinkage>("Parents", "The parents that are to be crossed."));
|
---|
| 54 | }
|
---|
| 55 |
|
---|
| 56 | public override IOperation InstrumentedApply() {
|
---|
| 57 | var random = RandomParameter.ActualValue;
|
---|
| 58 | var parents = ParentsParameter.ActualValue;
|
---|
| 59 | if (parents == null) throw new InvalidOperationException(Name + ": Parents could not be found.");
|
---|
| 60 | var child = Cross(random, parents);
|
---|
| 61 | ChildParameter.ActualValue = child;
|
---|
| 62 | return base.InstrumentedApply();
|
---|
| 63 | }
|
---|
| 64 |
|
---|
| 65 | protected abstract LinearLinkage Cross(IRandom random, ItemArray<LinearLinkage> parents);
|
---|
| 66 | }
|
---|
| 67 | }
|
---|