#region License Information
/* HeuristicLab
* Copyright (C) 2002-2018 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
*
* This file is part of HeuristicLab.
*
* HeuristicLab is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* HeuristicLab is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with HeuristicLab. If not, see .
*/
#endregion
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Data;
using HeuristicLab.Optimization;
using HeuristicLab.Parameters;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
namespace HeuristicLab.Selection {
[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.")]
[StorableClass]
public sealed class WorstReplacer : Replacer, ISingleObjectiveReplacer {
public override bool CanChangeName {
get { return false; }
}
public override bool CanChangeDescription {
get { return false; }
}
public ILookupParameter> QualityParameter {
get { return (ILookupParameter>)Parameters["Quality"]; }
}
public IValueLookupParameter MaximizationParameter {
get { return (IValueLookupParameter)Parameters["Maximization"]; }
}
[StorableConstructor]
private WorstReplacer(bool deserializing) : base(deserializing) { }
private WorstReplacer(WorstReplacer original, Cloner cloner) : base(original, cloner) { }
public override IDeepCloneable Clone(Cloner cloner) {
return new WorstReplacer(this, cloner);
}
public WorstReplacer()
: base() {
Parameters.Add(new ScopeTreeLookupParameter("Quality", "The quality of a solution."));
Parameters.Add(new ValueLookupParameter("Maximization", "True if the problem is a maximization problem, otherwise false."));
WorstSelector worstSelector = new WorstSelector();
worstSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
worstSelector.QualityParameter.ActualName = QualityParameter.Name;
ReplacedSelectorParameter.Value = worstSelector;
ReplacedSelectorParameter.Hidden = true;
BestSelector bestSelector = new BestSelector();
bestSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
bestSelector.QualityParameter.ActualName = QualityParameter.Name;
SelectedSelectorParameter.Value = bestSelector;
SelectedSelectorParameter.Hidden = true;
}
}
}