Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2521_ProblemRefactoring/HeuristicLab.Algorithms.ALPS/3.3/MatingPoolCreator.cs @ 16819

Last change on this file since 16819 was 16723, checked in by abeham, 6 years ago

#2521: merged changes from r15684 to trunk HEAD (r16716) and resolved all merge conflicts

  • it doesn't build
File size: 3.3 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2019 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
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Operators;
26using HeuristicLab.Parameters;
27using HEAL.Attic;
28
29namespace HeuristicLab.Algorithms.ALPS {
30  [Item("MatingPoolCreator", "An operator which creates 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.")]
31  [StorableType("F8B8EAF4-84FC-4E38-B3CB-82EEDBAFE083")]
32  public sealed class MatingPoolCreator : SingleSuccessorOperator {
33    public IValueLookupParameter<IntValue> MatingPoolRangeParameter {
34      get { return (IValueLookupParameter<IntValue>)Parameters["MatingPoolRange"]; }
35    }
36
37    [StorableConstructor]
38    private MatingPoolCreator(StorableConstructorFlag _) : base(_) { }
39    private MatingPoolCreator(MatingPoolCreator original, Cloner cloner)
40      : base(original, cloner) { }
41    public override IDeepCloneable Clone(Cloner cloner) {
42      return new MatingPoolCreator(this, cloner);
43    }
44    public MatingPoolCreator()
45      : base() {
46      Parameters.Add(new ValueLookupParameter<IntValue>("MatingPoolRange", "The range of sub-populations used for creating a mating pool. (1 = current + previous sub-population)", new IntValue(1)));
47    }
48
49    /// <summary>
50    /// Copies the subscopes of the n previous scopes into the current scope. (default n = 1)
51    /// <pre>
52    ///          __ scope __              __ scope __
53    ///         /     |     \            /     |     \
54    ///       Pop1   Pop2   Pop3  =>   Pop1   Pop2   Pop3
55    ///       /|\    /|\    /|\         /|\   /|\    /|\
56    ///       ABC    DEF    GHI         ABC   DEF    GHI
57    ///                                       ABC    DEF
58    /// </pre>
59    /// </summary>
60    /// <returns>The next operation.</returns>
61    public override IOperation Apply() {
62      var subScopes = ExecutionContext.Scope.SubScopes;
63      int range = MatingPoolRangeParameter.ActualValue.Value;
64
65      for (int targetIndex = subScopes.Count - 1; targetIndex > 0; targetIndex--) {
66        var targetScope = subScopes[targetIndex];
67        for (int n = 1; (n <= range) && (targetIndex - n >= 0); n++) {
68          var prevScope = subScopes[targetIndex - n];
69          var individuals = prevScope.SubScopes;
70          foreach (var individual in individuals) {
71            targetScope.SubScopes.Add((IScope)individual.Clone());
72          }
73        }
74      }
75
76      return base.Apply();
77    }
78  }
79}
Note: See TracBrowser for help on using the repository browser.