| 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| 3 | * Copyright (C) 2002-2018 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.Common;
|
|---|
| 23 | using HeuristicLab.Core;
|
|---|
| 24 | using HeuristicLab.Data;
|
|---|
| 25 | using HeuristicLab.Operators;
|
|---|
| 26 | using HeuristicLab.Optimization;
|
|---|
| 27 | using HeuristicLab.Parameters;
|
|---|
| 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
|---|
| 29 | using HEAL.Attic;
|
|---|
| 30 |
|
|---|
| 31 |
|
|---|
| 32 | namespace HeuristicLab.Analysis {
|
|---|
| 33 | [StorableType("3659291a-927c-4016-88be-8a0f65476660")]
|
|---|
| 34 | public abstract class MultiObjectiveSuccessAnalyzer : SingleSuccessorOperator, IAnalyzer, IMultiObjectiveOperator {
|
|---|
| 35 | public virtual bool EnabledByDefault {
|
|---|
| 36 | get { return true; }
|
|---|
| 37 | }
|
|---|
| 38 | public abstract string ResultName { get; }
|
|---|
| 39 |
|
|---|
| 40 | public IScopeTreeLookupParameter<DoubleArray> QualitiesParameter {
|
|---|
| 41 | get { return (IScopeTreeLookupParameter<DoubleArray>)Parameters["Qualities"]; }
|
|---|
| 42 | }
|
|---|
| 43 |
|
|---|
| 44 | public ILookupParameter<BoolArray> MaximizationParameter {
|
|---|
| 45 | get { return (ILookupParameter<BoolArray>)Parameters["Maximization"]; }
|
|---|
| 46 | }
|
|---|
| 47 |
|
|---|
| 48 | public ResultParameter<DoubleValue> ResultParameter {
|
|---|
| 49 | get { return (ResultParameter<DoubleValue>)Parameters[ResultName]; }
|
|---|
| 50 | }
|
|---|
| 51 |
|
|---|
| 52 | protected MultiObjectiveSuccessAnalyzer(MultiObjectiveSuccessAnalyzer original, Cloner cloner) : base(original, cloner) { }
|
|---|
| 53 | [StorableConstructor]
|
|---|
| 54 | protected MultiObjectiveSuccessAnalyzer(StorableConstructorFlag _) : base(_) { }
|
|---|
| 55 | protected MultiObjectiveSuccessAnalyzer() {
|
|---|
| 56 | Parameters.Add(new ScopeTreeLookupParameter<DoubleArray>("Qualities", "The qualities of the parameter vector."));
|
|---|
| 57 | Parameters.Add(new LookupParameter<DoubleMatrix>("BestKnownFront", "The currently best known Pareto front"));
|
|---|
| 58 | Parameters.Add(new LookupParameter<BoolArray>("Maximization", ""));
|
|---|
| 59 | }
|
|---|
| 60 | }
|
|---|
| 61 | } |
|---|
