Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Selection/3.3/TournamentSelector.cs @ 7711

Last change on this file since 7711 was 7259, checked in by swagner, 13 years ago

Updated year of copyrights to 2012 (#1716)

File size: 3.3 KB
RevLine 
[2]1#region License Information
2/* HeuristicLab
[7259]3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[2]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 System.Collections.Generic;
[2818]23using System.Linq;
[4722]24using HeuristicLab.Common;
[2]25using HeuristicLab.Core;
26using HeuristicLab.Data;
[3138]27using HeuristicLab.Optimization;
[2805]28using HeuristicLab.Parameters;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
[2]30
31namespace HeuristicLab.Selection {
[817]32  /// <summary>
[2805]33  /// A tournament selection operator which considers a single double quality value for selection.
[817]34  /// </summary>
[2805]35  [Item("TournamentSelector", "A tournament selection operator which considers a single double quality value for selection.")]
[3017]36  [StorableClass]
[3138]37  public sealed class TournamentSelector : StochasticSingleObjectiveSelector, ISingleObjectiveSelector {
[3048]38    public ValueLookupParameter<IntValue> GroupSizeParameter {
39      get { return (ValueLookupParameter<IntValue>)Parameters["GroupSize"]; }
[2]40    }
41
[4722]42    [StorableConstructor]
43    private TournamentSelector(bool deserializing) : base(deserializing) { }
44    private TournamentSelector(TournamentSelector original, Cloner cloner) : base(original, cloner) { }
45    public override IDeepCloneable Clone(Cloner cloner) {
46      return new TournamentSelector(this, cloner);
47    }
48
[4068]49    public TournamentSelector()
50      : base() {
[3048]51      Parameters.Add(new ValueLookupParameter<IntValue>("GroupSize", "The size of the tournament group.", new IntValue(2)));
[2]52    }
53
[2830]54    protected override IScope[] Select(List<IScope> scopes) {
[2805]55      int count = NumberOfSelectedSubScopesParameter.ActualValue.Value;
56      bool copy = CopySelectedParameter.Value.Value;
57      IRandom random = RandomParameter.ActualValue;
58      bool maximization = MaximizationParameter.ActualValue.Value;
[2818]59      List<double> qualities = QualityParameter.ActualValue.Select(x => x.Value).ToList();
[2805]60      int groupSize = GroupSizeParameter.ActualValue.Value;
[2830]61      IScope[] selected = new IScope[count];
[2]62
[2805]63      for (int i = 0; i < count; i++) {
[2817]64        int best = random.Next(scopes.Count);
[2805]65        int index;
[1063]66        for (int j = 1; j < groupSize; j++) {
[2817]67          index = random.Next(scopes.Count);
[2818]68          if (((maximization) && (qualities[index] > qualities[best])) ||
69              ((!maximization) && (qualities[index] < qualities[best]))) {
[2805]70            best = index;
[2]71          }
72        }
73
[2805]74        if (copy)
[2830]75          selected[i] = (IScope)scopes[best].Clone();
[2]76        else {
[2830]77          selected[i] = scopes[best];
[2817]78          scopes.RemoveAt(best);
[2805]79          qualities.RemoveAt(best);
[2]80        }
81      }
[2817]82      return selected;
[2]83    }
84  }
85}
Note: See TracBrowser for help on using the repository browser.