| [3601] | 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| 3 | * Copyright (C) 2002-2010 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 HeuristicLab.Core;
|
|---|
| 23 | using HeuristicLab.Data;
|
|---|
| 24 | using HeuristicLab.Optimization;
|
|---|
| 25 | using HeuristicLab.Parameters;
|
|---|
| 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
|---|
| 27 |
|
|---|
| 28 | namespace HeuristicLab.Selection {
|
|---|
| 29 | [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.")]
|
|---|
| 30 | [StorableClass]
|
|---|
| 31 | public sealed class RandomReplacer : Replacer, IStochasticOperator, ISingleObjectiveReplacer {
|
|---|
| 32 | public override bool CanChangeName {
|
|---|
| 33 | get { return false; }
|
|---|
| 34 | }
|
|---|
| 35 | public override bool CanChangeDescription {
|
|---|
| 36 | get { return false; }
|
|---|
| 37 | }
|
|---|
| 38 |
|
|---|
| 39 | public ILookupParameter<ItemArray<DoubleValue>> QualityParameter {
|
|---|
| 40 | get { return (ILookupParameter<ItemArray<DoubleValue>>)Parameters["Quality"]; }
|
|---|
| 41 | }
|
|---|
| 42 | public IValueLookupParameter<BoolValue> MaximizationParameter {
|
|---|
| 43 | get { return (IValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
|
|---|
| 44 | }
|
|---|
| 45 | public ILookupParameter<IRandom> RandomParameter {
|
|---|
| 46 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
|---|
| 47 | }
|
|---|
| 48 |
|
|---|
| 49 | [StorableConstructor]
|
|---|
| 50 | private RandomReplacer(bool deserializing) : base(deserializing) { }
|
|---|
| 51 | public RandomReplacer()
|
|---|
| 52 | : base() {
|
|---|
| [3659] | 53 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The quality of a solution."));
|
|---|
| [3601] | 54 | Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
|
|---|
| 55 | Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator to use."));
|
|---|
| 56 |
|
|---|
| 57 | RandomSelector randomSelector = new RandomSelector();
|
|---|
| 58 | randomSelector.RandomParameter.ActualName = RandomParameter.Name;
|
|---|
| 59 | ReplacedSelectorParameter.Value = randomSelector;
|
|---|
| 60 | BestSelector bestSelector = new BestSelector();
|
|---|
| 61 | bestSelector.MaximizationParameter.ActualName = MaximizationParameter.Name;
|
|---|
| 62 | bestSelector.QualityParameter.ActualName = QualityParameter.Name;
|
|---|
| 63 | SelectedSelectorParameter.Value = bestSelector;
|
|---|
| 64 | }
|
|---|
| 65 | }
|
|---|
| 66 | }
|
|---|
