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 |
|
---|
22 | using System.Collections.Generic;
|
---|
23 | using System.Linq;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Data;
|
---|
27 | using HeuristicLab.Optimization;
|
---|
28 | using HeuristicLab.Parameters;
|
---|
29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
30 |
|
---|
31 | namespace HeuristicLab.Selection {
|
---|
32 | /// <summary>
|
---|
33 | /// A tournament selection operator which considers a single double quality value for selection.
|
---|
34 | /// </summary>
|
---|
35 | [Item("TournamentSelector", "A tournament selection operator which considers a single double quality value for selection.")]
|
---|
36 | [StorableClass]
|
---|
37 | public sealed class TournamentSelector : StochasticSingleObjectiveSelector, ISingleObjectiveSelector {
|
---|
38 | public ValueLookupParameter<IntValue> GroupSizeParameter {
|
---|
39 | get { return (ValueLookupParameter<IntValue>)Parameters["GroupSize"]; }
|
---|
40 | }
|
---|
41 |
|
---|
42 | public TournamentSelector() : base() {
|
---|
43 | Parameters.Add(new ValueLookupParameter<IntValue>("GroupSize", "The size of the tournament group.", new IntValue(2)));
|
---|
44 | }
|
---|
45 |
|
---|
46 | protected override IScope[] Select(List<IScope> scopes) {
|
---|
47 | int count = NumberOfSelectedSubScopesParameter.ActualValue.Value;
|
---|
48 | bool copy = CopySelectedParameter.Value.Value;
|
---|
49 | IRandom random = RandomParameter.ActualValue;
|
---|
50 | bool maximization = MaximizationParameter.ActualValue.Value;
|
---|
51 | List<double> qualities = QualityParameter.ActualValue.Select(x => x.Value).ToList();
|
---|
52 | int groupSize = GroupSizeParameter.ActualValue.Value;
|
---|
53 | IScope[] selected = new IScope[count];
|
---|
54 |
|
---|
55 | for (int i = 0; i < count; i++) {
|
---|
56 | int best = random.Next(scopes.Count);
|
---|
57 | int index;
|
---|
58 | for (int j = 1; j < groupSize; j++) {
|
---|
59 | index = random.Next(scopes.Count);
|
---|
60 | if (((maximization) && (qualities[index] > qualities[best])) ||
|
---|
61 | ((!maximization) && (qualities[index] < qualities[best]))) {
|
---|
62 | best = index;
|
---|
63 | }
|
---|
64 | }
|
---|
65 |
|
---|
66 | if (copy)
|
---|
67 | selected[i] = (IScope)scopes[best].Clone();
|
---|
68 | else {
|
---|
69 | selected[i] = scopes[best];
|
---|
70 | scopes.RemoveAt(best);
|
---|
71 | qualities.RemoveAt(best);
|
---|
72 | }
|
---|
73 | }
|
---|
74 | return selected;
|
---|
75 | }
|
---|
76 | }
|
---|
77 | }
|
---|