Free cookie consent management tool by TermsFeed Policy Generator

source: branches/3.0/sources/HeuristicLab.Selection/LinearRankSelector.cs @ 5817

Last change on this file since 5817 was 2, checked in by swagner, 17 years ago

Added HeuristicLab 3.0 sources from former SVN repository at revision 52

File size: 2.3 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2008 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;
23using System.Collections.Generic;
24using System.Text;
25using HeuristicLab.Core;
26using HeuristicLab.Data;
27
28namespace HeuristicLab.Selection {
29  public class LinearRankSelector : StochasticSelectorBase {
30    public override string Description {
31      get { return @"TODO\r\nOperator description still missing ..."; }
32    }
33
34    public LinearRankSelector() {
35      GetVariable("CopySelected").GetValue<BoolData>().Data = true;
36    }
37
38    protected override void Select(IRandom random, IScope source, int selected, IScope target, bool copySelected) {
39      int subScopes = source.SubScopes.Count;
40      int lotSum = (subScopes * (subScopes + 1)) / 2;
41      int selectedLot;
42      int currentLot;
43      int index;
44
45      for (int i = 0; i < selected; i++) {
46        if (subScopes < 1) throw new InvalidOperationException("No source scopes available to select.");
47
48        selectedLot = random.Next(1, lotSum + 1);
49        currentLot = subScopes;  // first individual is the best one
50        index = 0;
51        while (currentLot < selectedLot) {
52          index++;
53          currentLot += subScopes - index;
54        }
55        IScope selectedScope = source.SubScopes[index];
56        if (copySelected)
57          target.AddSubScope((IScope)selectedScope.Clone());
58        else {
59          source.RemoveSubScope(selectedScope);
60          target.AddSubScope(selectedScope);
61          subScopes--;
62          lotSum = (subScopes * (subScopes + 1)) / 2;
63        }
64      }
65    }
66  }
67}
Note: See TracBrowser for help on using the repository browser.