[3601] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17180] | 3 | * Copyright (C) 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;
|
---|
[16565] | 27 | using HEAL.Attic;
|
---|
[3601] | 28 |
|
---|
| 29 | namespace HeuristicLab.Selection {
|
---|
| 30 | [Item("RandomReplacer", "Replaces some randomly selected sub-scopes of the remaining scope with all those (or the best if there are more) from the selected scope.")]
|
---|
[16565] | 31 | [StorableType("526A1887-C636-4702-8041-36EE0C2F1DA0")]
|
---|
[3601] | 32 | public sealed class RandomReplacer : Replacer, IStochasticOperator, 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 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 47 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
| 48 | }
|
---|
| 49 |
|
---|
| 50 | [StorableConstructor]
|
---|
[16565] | 51 | private RandomReplacer(StorableConstructorFlag _) : base(_) { }
|
---|
[4722] | 52 | private RandomReplacer(RandomReplacer original, Cloner cloner)
|
---|
| 53 | : base(original, cloner) {
|
---|
| 54 | }
|
---|
| 55 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 56 | return new RandomReplacer(this, cloner);
|
---|
| 57 | }
|
---|
[3601] | 58 | public RandomReplacer()
|
---|
| 59 | : base() {
|
---|
[3659] | 60 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The quality of a solution."));
|
---|
[3601] | 61 | Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
|
---|
| 62 | Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator to use."));
|
---|
| 63 |
|
---|
| 64 | RandomSelector randomSelector = new RandomSelector();
|
---|
| 65 | randomSelector.RandomParameter.ActualName = RandomParameter.Name;
|
---|
| 66 | ReplacedSelectorParameter.Value = randomSelector;
|
---|
[6091] | 67 | ReplacedSelectorParameter.Hidden = true;
|
---|
[3601] | 68 | BestSelector bestSelector = new BestSelector();
|
---|
| 69 | bestSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
|
---|
| 70 | bestSelector.QualityParameter.ActualName = QualityParameter.Name;
|
---|
| 71 | SelectedSelectorParameter.Value = bestSelector;
|
---|
[6091] | 72 | SelectedSelectorParameter.Hidden = true;
|
---|
[3601] | 73 | }
|
---|
| 74 | }
|
---|
| 75 | }
|
---|