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.Collections.Generic;
|
---|
23 | using System.Linq;
|
---|
24 | using HEAL.Attic;
|
---|
25 | using HeuristicLab.Common;
|
---|
26 | using HeuristicLab.Core;
|
---|
27 | using HeuristicLab.Optimization;
|
---|
28 | using HeuristicLab.Problems.TestFunctions.MultiObjective;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Algorithms.MOCMAEvolutionStrategy {
|
---|
31 | [Item("HypervolumeIndicator", "Selection of offspring based on contributing Hypervolume")]
|
---|
32 | [StorableType("ADF439D6-64E4-4C92-A4D3-E8C05B050406")]
|
---|
33 | internal class HypervolumeIndicator : Item, IIndicator {
|
---|
34 | #region Constructors and Cloning
|
---|
35 | [StorableConstructor]
|
---|
36 | protected HypervolumeIndicator(StorableConstructorFlag _) : base(_) { }
|
---|
37 | protected HypervolumeIndicator(HypervolumeIndicator original, Cloner cloner) : base(original, cloner) { }
|
---|
38 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
39 | return new HypervolumeIndicator(this, cloner);
|
---|
40 | }
|
---|
41 | public HypervolumeIndicator() { }
|
---|
42 | #endregion
|
---|
43 |
|
---|
44 | public int LeastContributer(IReadOnlyList<Individual> front, IMultiObjectiveProblemDefinition problem) {
|
---|
45 | var frontCopy = front.Select(x => x.PenalizedFitness).ToList();
|
---|
46 | if (frontCopy.Count <= 1) return 0;
|
---|
47 | //TODO discuss with bwerth
|
---|
48 | var tep = problem != null ? frontCopy.Concat(new[] {problem.ReferencePoint}) : frontCopy;
|
---|
49 | var refPoint = HypervolumeCalculator.CalculateNadirPoint(tep, problem.Maximization);
|
---|
50 | var contributions = Enumerable.Range(0, frontCopy.Count).Select(i => Contribution(frontCopy, i, problem.Maximization, refPoint));
|
---|
51 | return contributions.Select((value, index) => new {value, index}).OrderBy(x => x.value).First().index;
|
---|
52 | }
|
---|
53 |
|
---|
54 | #region Helpers
|
---|
55 | private static double Contribution(IList<double[]> front, int idx, bool[] maximization, double[] refPoint) {
|
---|
56 | var point = front[idx];
|
---|
57 | front.RemoveAt(idx);
|
---|
58 | var contribution = -HypervolumeCalculator.CalculateHypervolume(front.ToArray(), refPoint, maximization);
|
---|
59 | front.Insert(idx, point);
|
---|
60 | return contribution;
|
---|
61 | }
|
---|
62 | #endregion
|
---|
63 | }
|
---|
64 | } |
---|