[11583] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[12018] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[11583] | 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 |
|
---|
[12040] | 22 | using System;
|
---|
[12045] | 23 | using System.Linq;
|
---|
[11583] | 24 | using HeuristicLab.Common;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
[12040] | 26 | using HeuristicLab.Data;
|
---|
[11583] | 27 | using HeuristicLab.Operators;
|
---|
[12040] | 28 | using HeuristicLab.Parameters;
|
---|
[11583] | 29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 30 |
|
---|
| 31 | namespace HeuristicLab.Algorithms.ALPS {
|
---|
| 32 | [Item("MatingPoolCreator", "An operator which creating mating pools based on a set of sub-populations. For each sub-population, the individuals from the previous sub-population are copied into the current sub-population.")]
|
---|
| 33 | [StorableClass]
|
---|
| 34 | public sealed class MatingPoolCreator : SingleSuccessorOperator {
|
---|
| 35 |
|
---|
[12045] | 36 | public ILookupParameter<IntValue> MatingPoolRangeParameter {
|
---|
[12040] | 37 | get { return (ILookupParameter<IntValue>)Parameters["MatingPoolRange"]; }
|
---|
| 38 | }
|
---|
[12045] | 39 | public ILookupParameter<PercentValue> MatingPoolSelectionPercentageParameter {
|
---|
| 40 | get { return (ILookupParameter<PercentValue>)Parameters["MatingPoolSelectionPercentage"]; }
|
---|
| 41 | }
|
---|
[12040] | 42 |
|
---|
[11583] | 43 | [StorableConstructor]
|
---|
| 44 | private MatingPoolCreator(bool deserializing)
|
---|
| 45 | : base(deserializing) { }
|
---|
| 46 | private MatingPoolCreator(MatingPoolCreator original, Cloner cloner)
|
---|
| 47 | : base(original, cloner) { }
|
---|
| 48 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 49 | return new MatingPoolCreator(this, cloner);
|
---|
| 50 | }
|
---|
| 51 | public MatingPoolCreator()
|
---|
| 52 | : base() {
|
---|
[12040] | 53 | Parameters.Add(new LookupParameter<IntValue>("MatingPoolRange"));
|
---|
[12045] | 54 | Parameters.Add(new LookupParameter<PercentValue>("MatingPoolSelectionPercentage"));
|
---|
[11583] | 55 | }
|
---|
| 56 |
|
---|
| 57 | public override IOperation Apply() {
|
---|
[12040] | 58 | var layers = ExecutionContext.Scope.SubScopes;
|
---|
| 59 | int range = MatingPoolRangeParameter.ActualValue.Value;
|
---|
[12045] | 60 | double percentage = MatingPoolSelectionPercentageParameter.ActualValue.Value;
|
---|
[11583] | 61 |
|
---|
[12040] | 62 | for (int layer = layers.Count - 1; layer > 0; layer--) {
|
---|
| 63 | var layerScope = layers[layer];
|
---|
| 64 | for (int n = 1; (n <= range) && (layer - n >= 0); n++) {
|
---|
| 65 | var prevLayerScope = layers[layer - n];
|
---|
[12045] | 66 | var individuals = prevLayerScope.SubScopes;
|
---|
| 67 | foreach (var individual in individuals.Take((int)(individuals.Count * percentage))) {
|
---|
[12040] | 68 | layerScope.SubScopes.Add((IScope)individual.Clone(new Cloner()));
|
---|
| 69 | }
|
---|
| 70 | }
|
---|
[11583] | 71 | }
|
---|
[11586] | 72 |
|
---|
[11583] | 73 | return base.Apply();
|
---|
| 74 | }
|
---|
| 75 | }
|
---|
| 76 | } |
---|