[8924] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16565] | 3 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[8924] | 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;
|
---|
[5143] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Operators;
|
---|
| 26 | using HeuristicLab.Optimization;
|
---|
| 27 | using HeuristicLab.Parameters;
|
---|
[16565] | 28 | using HEAL.Attic;
|
---|
[5143] | 29 |
|
---|
| 30 | namespace HeuristicLab.Analysis {
|
---|
[5438] | 31 | [Item("ParetoFrontAnalyzer", "Analyzer for multiobjective problems that collects and presents the current Pareto front as double matrix as well as the solution scopes that lie on the current front.")]
|
---|
[16565] | 32 | [StorableType("972CEB70-3D0D-4602-97B1-B02DC7FBD9E8")]
|
---|
[11970] | 33 | public abstract class ParetoFrontAnalyzer : SingleSuccessorOperator, IAnalyzer, IMultiObjectiveOperator {
|
---|
[7172] | 34 | public virtual bool EnabledByDefault {
|
---|
| 35 | get { return true; }
|
---|
| 36 | }
|
---|
| 37 |
|
---|
[5143] | 38 | public IScopeTreeLookupParameter<DoubleArray> QualitiesParameter {
|
---|
| 39 | get { return (IScopeTreeLookupParameter<DoubleArray>)Parameters["Qualities"]; }
|
---|
| 40 | }
|
---|
| 41 | public ILookupParameter<ResultCollection> ResultsParameter {
|
---|
| 42 | get { return (ILookupParameter<ResultCollection>)Parameters["Results"]; }
|
---|
| 43 | }
|
---|
| 44 |
|
---|
| 45 | [StorableConstructor]
|
---|
[16565] | 46 | protected ParetoFrontAnalyzer(StorableConstructorFlag _) : base(_) { }
|
---|
[5143] | 47 | protected ParetoFrontAnalyzer(ParetoFrontAnalyzer original, Cloner cloner) : base(original, cloner) { }
|
---|
| 48 | public ParetoFrontAnalyzer() {
|
---|
| 49 | Parameters.Add(new ScopeTreeLookupParameter<DoubleArray>("Qualities", "The vector of qualities of each solution."));
|
---|
| 50 | Parameters.Add(new LookupParameter<ResultCollection>("Results", "The result collection to store the front to."));
|
---|
| 51 | }
|
---|
| 52 |
|
---|
| 53 | public override IOperation Apply() {
|
---|
| 54 | ItemArray<DoubleArray> qualities = QualitiesParameter.ActualValue;
|
---|
| 55 | ResultCollection results = ResultsParameter.ActualValue;
|
---|
| 56 | Analyze(qualities, results);
|
---|
| 57 | return base.Apply();
|
---|
| 58 | }
|
---|
| 59 |
|
---|
| 60 | protected abstract void Analyze(ItemArray<DoubleArray> qualities, ResultCollection results);
|
---|
| 61 | }
|
---|
| 62 | }
|
---|