[3601] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16723] | 3 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3601] | 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 |
|
---|
[4722] | 22 | using HeuristicLab.Common;
|
---|
[3601] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Optimization;
|
---|
| 26 | using HeuristicLab.Parameters;
|
---|
[16723] | 27 | using HEAL.Attic;
|
---|
[3601] | 28 |
|
---|
| 29 | namespace HeuristicLab.Selection {
|
---|
| 30 | [Item("WorstReplacer", "Replaces the worst sub-scopes of the remaining scope with all those (or the best if there are more) from the selected scope.")]
|
---|
[16723] | 31 | [StorableType("9B56E562-0E21-4FED-AB2F-553D49AEC47D")]
|
---|
[3601] | 32 | public sealed class WorstReplacer : Replacer, ISingleObjectiveReplacer {
|
---|
| 33 | public override bool CanChangeName {
|
---|
| 34 | get { return false; }
|
---|
| 35 | }
|
---|
| 36 | public override bool CanChangeDescription {
|
---|
| 37 | get { return false; }
|
---|
| 38 | }
|
---|
| 39 |
|
---|
| 40 | public ILookupParameter<ItemArray<DoubleValue>> QualityParameter {
|
---|
| 41 | get { return (ILookupParameter<ItemArray<DoubleValue>>)Parameters["Quality"]; }
|
---|
| 42 | }
|
---|
| 43 | public IValueLookupParameter<BoolValue> MaximizationParameter {
|
---|
| 44 | get { return (IValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
|
---|
| 45 | }
|
---|
| 46 |
|
---|
| 47 | [StorableConstructor]
|
---|
[16723] | 48 | private WorstReplacer(StorableConstructorFlag _) : base(_) { }
|
---|
[4722] | 49 | private WorstReplacer(WorstReplacer original, Cloner cloner) : base(original, cloner) { }
|
---|
| 50 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 51 | return new WorstReplacer(this, cloner);
|
---|
| 52 | }
|
---|
[3601] | 53 | public WorstReplacer()
|
---|
| 54 | : base() {
|
---|
[3659] | 55 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The quality of a solution."));
|
---|
[3601] | 56 | Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
|
---|
| 57 |
|
---|
| 58 | WorstSelector worstSelector = new WorstSelector();
|
---|
| 59 | worstSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
|
---|
| 60 | worstSelector.QualityParameter.ActualName = QualityParameter.Name;
|
---|
| 61 | ReplacedSelectorParameter.Value = worstSelector;
|
---|
[6091] | 62 | ReplacedSelectorParameter.Hidden = true;
|
---|
[3601] | 63 | BestSelector bestSelector = new BestSelector();
|
---|
| 64 | bestSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
|
---|
| 65 | bestSelector.QualityParameter.ActualName = QualityParameter.Name;
|
---|
| 66 | SelectedSelectorParameter.Value = bestSelector;
|
---|
[6091] | 67 | SelectedSelectorParameter.Hidden = true;
|
---|
[3601] | 68 | }
|
---|
| 69 | }
|
---|
| 70 | }
|
---|