[2] | 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 |
|
---|
| 22 | using System;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Text;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Data;
|
---|
| 27 |
|
---|
| 28 | namespace HeuristicLab.Selection {
|
---|
| 29 | public class TournamentSelector : StochasticSelectorBase {
|
---|
| 30 | public override string Description {
|
---|
| 31 | get { return @"TODO\r\nOperator description still missing ..."; }
|
---|
| 32 | }
|
---|
| 33 |
|
---|
| 34 | public TournamentSelector() {
|
---|
| 35 | AddVariableInfo(new VariableInfo("Maximization", "Maximization problem", typeof(BoolData), VariableKind.In));
|
---|
| 36 | AddVariableInfo(new VariableInfo("Quality", "Quality value", typeof(DoubleData), VariableKind.In));
|
---|
| 37 | AddVariableInfo(new VariableInfo("GroupSize", "Size of the tournament group", typeof(IntData), VariableKind.In));
|
---|
| 38 | GetVariableInfo("GroupSize").Local = true;
|
---|
| 39 | AddVariable(new Variable("GroupSize", new IntData(2)));
|
---|
| 40 | GetVariable("CopySelected").GetValue<BoolData>().Data = true;
|
---|
| 41 | }
|
---|
| 42 |
|
---|
| 43 | protected override void Select(IRandom random, IScope source, int selected, IScope target, bool copySelected) {
|
---|
| 44 | IVariableInfo qualityInfo = GetVariableInfo("Quality");
|
---|
| 45 | bool maximization = GetVariableValue<BoolData>("Maximization", source, true).Data;
|
---|
| 46 | int groupSize = GetVariableValue<IntData>("GroupSize", source, true).Data;
|
---|
| 47 | for (int i = 0; i < selected; i++) {
|
---|
| 48 | if (source.SubScopes.Count < 1) throw new InvalidOperationException("No source scopes available to select.");
|
---|
| 49 |
|
---|
| 50 | double best = maximization ? double.MinValue : double.MaxValue;
|
---|
| 51 | IScope selectedScope = null;
|
---|
| 52 | for (int j = 0; j < groupSize; j++) {
|
---|
| 53 | IScope scope = source.SubScopes[random.Next(source.SubScopes.Count)];
|
---|
[77] | 54 | double quality = scope.GetVariableValue<DoubleData>(qualityInfo.FormalName, false).Data;
|
---|
[2] | 55 | if (((maximization) && (quality > best)) ||
|
---|
| 56 | ((!maximization) && (quality < best))) {
|
---|
| 57 | best = quality;
|
---|
| 58 | selectedScope = scope;
|
---|
| 59 | }
|
---|
| 60 | }
|
---|
| 61 |
|
---|
| 62 | if (copySelected)
|
---|
| 63 | target.AddSubScope((IScope)selectedScope.Clone());
|
---|
| 64 | else {
|
---|
| 65 | source.RemoveSubScope(selectedScope);
|
---|
| 66 | target.AddSubScope(selectedScope);
|
---|
| 67 | }
|
---|
| 68 | }
|
---|
| 69 | }
|
---|
| 70 | }
|
---|
| 71 | }
|
---|