[2907] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[14185] | 3 | * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[2907] | 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 |
|
---|
[4722] | 22 | using HeuristicLab.Common;
|
---|
[2907] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Operators;
|
---|
| 25 | using HeuristicLab.Optimization;
|
---|
| 26 | using HeuristicLab.Parameters;
|
---|
[14927] | 27 | using HeuristicLab.Persistence;
|
---|
[2907] | 28 |
|
---|
[3053] | 29 | namespace HeuristicLab.Encodings.PermutationEncoding {
|
---|
[2907] | 30 | /// <summary>
|
---|
| 31 | /// A base class for permutation crossover operators.
|
---|
| 32 | /// </summary>
|
---|
| 33 | [Item("PermutationCrossover", "A base class for permutation crossover operators.")]
|
---|
[14927] | 34 | [StorableType("ff44e933-e475-4a6e-8334-7d109891aa49")]
|
---|
[10291] | 35 | public abstract class PermutationCrossover : InstrumentedOperator, IPermutationCrossover, IStochasticOperator {
|
---|
[3034] | 36 | public override bool CanChangeName {
|
---|
| 37 | get { return false; }
|
---|
| 38 | }
|
---|
| 39 |
|
---|
[2907] | 40 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 41 | get { return (LookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 42 | }
|
---|
| 43 | public ILookupParameter<ItemArray<Permutation>> ParentsParameter {
|
---|
[3659] | 44 | get { return (ScopeTreeLookupParameter<Permutation>)Parameters["Parents"]; }
|
---|
[2907] | 45 | }
|
---|
| 46 | public ILookupParameter<Permutation> ChildParameter {
|
---|
| 47 | get { return (ILookupParameter<Permutation>)Parameters["Child"]; }
|
---|
| 48 | }
|
---|
| 49 |
|
---|
[4722] | 50 | [StorableConstructor]
|
---|
[15018] | 51 | protected PermutationCrossover(StorableConstructorFlag deserializing) : base(deserializing) { }
|
---|
[4722] | 52 | protected PermutationCrossover(PermutationCrossover original, Cloner cloner) : base(original, cloner) { }
|
---|
[2907] | 53 | protected PermutationCrossover()
|
---|
| 54 | : base() {
|
---|
| 55 | Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator which should be used for stochastic crossover operators."));
|
---|
[3659] | 56 | Parameters.Add(new ScopeTreeLookupParameter<Permutation>("Parents", "The parent permutations which should be crossed."));
|
---|
[2947] | 57 | ParentsParameter.ActualName = "Permutation";
|
---|
[2907] | 58 | Parameters.Add(new LookupParameter<Permutation>("Child", "The child permutation resulting from the crossover."));
|
---|
[2947] | 59 | ChildParameter.ActualName = "Permutation";
|
---|
[2907] | 60 | }
|
---|
| 61 |
|
---|
[10291] | 62 | public sealed override IOperation InstrumentedApply() {
|
---|
[2907] | 63 | ChildParameter.ActualValue = Cross(RandomParameter.ActualValue, ParentsParameter.ActualValue);
|
---|
[10291] | 64 | return base.InstrumentedApply();
|
---|
[2907] | 65 | }
|
---|
| 66 |
|
---|
| 67 | protected abstract Permutation Cross(IRandom random, ItemArray<Permutation> parents);
|
---|
| 68 | }
|
---|
| 69 | }
|
---|