1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 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 System;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using System.Linq;
|
---|
25 | using HeuristicLab.Common;
|
---|
26 | using HeuristicLab.Core;
|
---|
27 | using HeuristicLab.Data;
|
---|
28 | using HeuristicLab.Optimization;
|
---|
29 | using HeuristicLab.Parameters;
|
---|
30 | using HEAL.Attic;
|
---|
31 |
|
---|
32 | namespace HeuristicLab.Problems.TestFunctions.MultiObjective {
|
---|
33 | [StorableType("13D363E4-76FF-4A5A-9B2C-767D9E880E4B")]
|
---|
34 | [Item("HypervolumeAnalyzer", "Computes the enclosed Hypervolume between the current front and a given reference Point")]
|
---|
35 | public class HypervolumeAnalyzer : MOTFAnalyzer {
|
---|
36 |
|
---|
37 | public ILookupParameter<DoubleArray> ReferencePointParameter {
|
---|
38 | get { return (ILookupParameter<DoubleArray>)Parameters["ReferencePoint"]; }
|
---|
39 | }
|
---|
40 | public IResultParameter<DoubleValue> HypervolumeResultParameter {
|
---|
41 | get { return (IResultParameter<DoubleValue>)Parameters["Hypervolume"]; }
|
---|
42 | }
|
---|
43 | public IResultParameter<DoubleValue> BestKnownHypervolumeResultParameter {
|
---|
44 | get { return (IResultParameter<DoubleValue>)Parameters["Best known hypervolume"]; }
|
---|
45 | }
|
---|
46 | public IResultParameter<DoubleValue> HypervolumeDistanceResultParameter {
|
---|
47 | get { return (IResultParameter<DoubleValue>)Parameters["Absolute Distance to BestKnownHypervolume"]; }
|
---|
48 | }
|
---|
49 |
|
---|
50 |
|
---|
51 | [StorableConstructor]
|
---|
52 | protected HypervolumeAnalyzer(StorableConstructorFlag _) : base(_) {
|
---|
53 | }
|
---|
54 |
|
---|
55 | protected HypervolumeAnalyzer(HypervolumeAnalyzer original, Cloner cloner)
|
---|
56 | : base(original, cloner) {
|
---|
57 | }
|
---|
58 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
59 | return new HypervolumeAnalyzer(this, cloner);
|
---|
60 | }
|
---|
61 |
|
---|
62 | public HypervolumeAnalyzer() {
|
---|
63 | Parameters.Add(new LookupParameter<DoubleArray>("ReferencePoint", "The reference point for hypervolume calculation"));
|
---|
64 | Parameters.Add(new ResultParameter<DoubleValue>("Hypervolume", "The hypervolume of the current generation"));
|
---|
65 | Parameters.Add(new ResultParameter<DoubleValue>("Best known hypervolume", "The optimal hypervolume"));
|
---|
66 | Parameters.Add(new ResultParameter<DoubleValue>("Absolute Distance to BestKnownHypervolume", "The difference between the best known and the current hypervolume"));
|
---|
67 | HypervolumeResultParameter.DefaultValue = new DoubleValue(0);
|
---|
68 | BestKnownHypervolumeResultParameter.DefaultValue = new DoubleValue(0);
|
---|
69 | HypervolumeDistanceResultParameter.DefaultValue = new DoubleValue(0);
|
---|
70 |
|
---|
71 |
|
---|
72 | }
|
---|
73 |
|
---|
74 | public override IOperation Apply() {
|
---|
75 | var qualities = QualitiesParameter.ActualValue;
|
---|
76 | var testFunction = TestFunctionParameter.ActualValue;
|
---|
77 | int objectives = qualities[0].Length;
|
---|
78 | var referencePoint = ReferencePointParameter.ActualValue;
|
---|
79 |
|
---|
80 | double best = BestKnownHypervolumeResultParameter.ActualValue.Value;
|
---|
81 | if (referencePoint.SequenceEqual(testFunction.ReferencePoint(objectives))) {
|
---|
82 | best = Math.Max(best, testFunction.OptimalHypervolume(objectives));
|
---|
83 | }
|
---|
84 |
|
---|
85 | IEnumerable<double[]> front = NonDominatedSelect.SelectNonDominatedVectors(qualities.Select(q => q.ToArray()), testFunction.Maximization(objectives), true);
|
---|
86 |
|
---|
87 | double hv = Hypervolume.Calculate(front, referencePoint.ToArray(), testFunction.Maximization(objectives));
|
---|
88 |
|
---|
89 | if (hv > best) {
|
---|
90 | best = hv;
|
---|
91 | }
|
---|
92 |
|
---|
93 | HypervolumeResultParameter.ActualValue.Value = hv;
|
---|
94 | BestKnownHypervolumeResultParameter.ActualValue.Value = best;
|
---|
95 | HypervolumeDistanceResultParameter.ActualValue.Value = best - hv;
|
---|
96 |
|
---|
97 | return base.Apply();
|
---|
98 | }
|
---|
99 |
|
---|
100 | }
|
---|
101 | }
|
---|