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