[3183] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[12012] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3183] | 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.Core;
|
---|
| 23 | using HeuristicLab.Operators;
|
---|
| 24 | using HeuristicLab.Optimization;
|
---|
| 25 | using HeuristicLab.Parameters;
|
---|
| 26 | using HeuristicLab.Encodings.RealVectorEncoding;
|
---|
[3326] | 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[3183] | 28 |
|
---|
| 29 | namespace HeuristicLab.Algorithms.EvolutionStrategy {
|
---|
[3326] | 30 | [Item("SelfAdaptiveCrossover", "Applies one crossover on the endogeneous strategy parameters and another on the actual solution encoding.")]
|
---|
| 31 | [StorableClass]
|
---|
[3183] | 32 | public class SelfAdaptiveCrossover : SingleSuccessorOperator, ICrossover, IStochasticOperator {
|
---|
| 33 | public override bool CanChangeName {
|
---|
| 34 | get { return false; }
|
---|
| 35 | }
|
---|
| 36 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 37 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 38 | }
|
---|
| 39 | public ValueParameter<IRealVectorCrossover> StrategyVectorCrossoverParameter {
|
---|
| 40 | get { return (ValueParameter<IRealVectorCrossover>)Parameters["StrategyVectorCrossover"]; }
|
---|
| 41 | }
|
---|
| 42 | public ConstrainedValueParameter<ICrossover> CrossoverParameter {
|
---|
| 43 | get { return (ConstrainedValueParameter<ICrossover>)Parameters["Crossover"]; }
|
---|
| 44 | }
|
---|
| 45 |
|
---|
| 46 | public IRealVectorCrossover StrategyVectorCrossover {
|
---|
| 47 | get { return StrategyVectorCrossoverParameter.Value; }
|
---|
| 48 | set { StrategyVectorCrossoverParameter.Value = value; }
|
---|
| 49 | }
|
---|
| 50 | public ICrossover Crossover {
|
---|
| 51 | get { return CrossoverParameter.Value; }
|
---|
| 52 | set { CrossoverParameter.Value = value; }
|
---|
| 53 | }
|
---|
| 54 |
|
---|
| 55 | public SelfAdaptiveCrossover()
|
---|
| 56 | : base() {
|
---|
| 57 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator to use."));
|
---|
| 58 | Parameters.Add(new ValueParameter<IRealVectorCrossover>("StrategyVectorCrossover", "The crossover operator for the strategy vectors.", new AverageCrossover()));
|
---|
| 59 | Parameters.Add(new ConstrainedValueParameter<ICrossover>("Crossover", "The solution specific crossover operator."));
|
---|
| 60 | }
|
---|
| 61 |
|
---|
| 62 | public override IOperation Apply() {
|
---|
| 63 | OperationCollection next = new OperationCollection();
|
---|
| 64 | next.Add(ExecutionContext.CreateOperation(StrategyVectorCrossover));
|
---|
| 65 | if (Crossover != null)
|
---|
| 66 | next.Add(ExecutionContext.CreateOperation(Crossover));
|
---|
| 67 | next.Add(base.Apply());
|
---|
| 68 | return next;
|
---|
| 69 | }
|
---|
| 70 | }
|
---|
| 71 | }
|
---|