Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Selection/3.3/LinearRankSelector.cs @ 2817

Last change on this file since 2817 was 2817, checked in by swagner, 14 years ago

Operator architecture refactoring (#95)

  • worked on selection
File size: 3.0 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2010 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 System.Linq;
23using System.Collections.Generic;
24using HeuristicLab.Core;
25using HeuristicLab.Data;
26using HeuristicLab.Parameters;
27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
28
29namespace HeuristicLab.Selection {
30  /// <summary>
31  /// A linear rank selection operator which considers the rank based on a single double quality value for selection.
32  /// </summary>
33  [Item("LinearRankSelector", "A linear rank selection operator which considers the rank based on a single double quality value for selection.")]
34  [EmptyStorableClass]
35  [Creatable("Test")]
36  public sealed class LinearRankSelector : StochasticSingleObjectiveSelector {
37    public LinearRankSelector()
38      : base() {
39      CopySelected.Value = true;
40    }
41
42    protected override ScopeList Select(ScopeList scopes) {
43      int count = NumberOfSelectedSubScopesParameter.ActualValue.Value;
44      bool copy = CopySelectedParameter.Value.Value;
45      IRandom random = RandomParameter.ActualValue;
46      bool maximization = MaximizationParameter.ActualValue.Value;
47      ItemArray<DoubleData> qualities = QualityParameter.ActualValue;
48      ScopeList selected = new ScopeList();
49
50      // create a list for each scope that contains the scope's index in the original scope list and its lots
51      var temp = qualities.Select((x, index) => new { index, x.Value });
52      if (maximization)
53        temp = temp.OrderBy(x => x.Value);
54      else
55        temp = temp.OrderByDescending(x => x.Value);
56      var list = temp.Select((x, lots) => new { x.index, lots }).ToList();
57
58      int lotSum = list.Count * (list.Count + 1) / 2;
59      for (int i = 0; i < count; i++) {
60        int selectedLot = random.Next(lotSum) + 1;
61        int index = 0;
62        int currentLot = list[index].lots;
63        while (currentLot < selectedLot) {
64          index++;
65          currentLot += list[index].lots;
66        }
67        if (copy)
68          selected.Add((IScope)scopes[list[index].index].Clone());
69        else {
70          selected.Add(scopes[list[index].index]);
71          scopes.RemoveAt(list[index].index);
72          lotSum -= list[index].lots;
73          list.RemoveAt(index);
74        }
75      }
76      return selected;
77    }
78  }
79}
Note: See TracBrowser for help on using the repository browser.