1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2016 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.Analysis;
|
---|
23 | using HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Data;
|
---|
26 | using HeuristicLab.Optimization;
|
---|
27 | using HeuristicLab.Parameters;
|
---|
28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
29 | using System;
|
---|
30 | using System.Collections.Generic;
|
---|
31 | using System.Linq;
|
---|
32 |
|
---|
33 | namespace HeuristicLab.OptimizationExpertSystem.Common {
|
---|
34 | [Item("Overall Best Recommender", "")]
|
---|
35 | [StorableClass]
|
---|
36 | public class OverallBestRecommender : ParameterizedNamedItem, IAlgorithmInstanceRecommender {
|
---|
37 | private KnowledgeCenter okc;
|
---|
38 |
|
---|
39 | private IFixedValueParameter<EnumValue<ProblemInstanceProximityType>> ProximityTypeParameter {
|
---|
40 | get { return (IFixedValueParameter<EnumValue<ProblemInstanceProximityType>>)Parameters["ProximityType"]; }
|
---|
41 | }
|
---|
42 |
|
---|
43 | private IFixedValueParameter<DoubleValue> NeighborhoodFactorParameter {
|
---|
44 | get { return (IFixedValueParameter<DoubleValue>)Parameters["NeighborhoodFactor"]; }
|
---|
45 | }
|
---|
46 |
|
---|
47 | public ProblemInstanceProximityType ProximityType {
|
---|
48 | get { return ProximityTypeParameter.Value.Value; }
|
---|
49 | set { ProximityTypeParameter.Value.Value = value; }
|
---|
50 | }
|
---|
51 |
|
---|
52 | public double NeighborhoodFactor {
|
---|
53 | get { return NeighborhoodFactorParameter.Value.Value; }
|
---|
54 | set { NeighborhoodFactorParameter.Value.Value = value; }
|
---|
55 | }
|
---|
56 |
|
---|
57 | [StorableConstructor]
|
---|
58 | private OverallBestRecommender(bool deserializing) : base(deserializing) { }
|
---|
59 | private OverallBestRecommender(OverallBestRecommender original, Cloner cloner)
|
---|
60 | : base(original, cloner) { }
|
---|
61 | public OverallBestRecommender(KnowledgeCenter okc) {
|
---|
62 | this.okc = okc;
|
---|
63 | Parameters.Add(new FixedValueParameter<EnumValue<ProblemInstanceProximityType>>("ProximityType", "The type of neighbor proximity.", new EnumValue<ProblemInstanceProximityType>(ProblemInstanceProximityType.FeatureSpace)));
|
---|
64 | Parameters.Add(new FixedValueParameter<DoubleValue>("NeighborhoodFactor", "Penalize neighbors that are far away.", new DoubleValue(5)));
|
---|
65 | }
|
---|
66 |
|
---|
67 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
68 | return new OverallBestRecommender(this, cloner);
|
---|
69 | }
|
---|
70 |
|
---|
71 | public IEnumerable<IAlgorithm> GetRanking() {
|
---|
72 | if (okc.Problem.ProblemId == -1) yield break;
|
---|
73 |
|
---|
74 | var instances = new List<Tuple<IAlgorithm, double>>();
|
---|
75 | foreach (var relevantRuns in okc.GetKnowledgeBaseByAlgorithm()) {
|
---|
76 | var algorithm = relevantRuns.Key;
|
---|
77 | var pis = relevantRuns.Value.Select(x => ((StringValue)x.Parameters["Problem Name"]).Value).Distinct()
|
---|
78 | .Select(x => Tuple.Create(x, okc.ProblemInstances.SingleOrDefault(y => ((StringValue)y.Parameters["Problem Name"]).Value == x)))
|
---|
79 | .Where(x => x.Item2 != null)
|
---|
80 | .Select(x => Tuple.Create(x.Item1, ((DoubleValue)x.Item2.Parameters["BestKnownQuality"]).Value))
|
---|
81 | .ToDictionary(x => x.Item1, x => x.Item2);
|
---|
82 | var avgERT = 0.0;
|
---|
83 | var count = 0;
|
---|
84 | foreach (var problemRuns in relevantRuns.Value.GroupBy(x => ((StringValue)x.Parameters["Problem Name"]).Value)) {
|
---|
85 | var bkq = pis[problemRuns.Key];
|
---|
86 | var ert = ExpectedRuntimeHelper.CalculateErt(problemRuns.ToList(), "QualityPerEvaluations", (okc.Maximization ? (1 - okc.MinimumTarget.Value) : (1 + okc.MinimumTarget.Value)) * bkq, okc.Maximization).ExpectedRuntime;
|
---|
87 | if (double.IsNaN(ert)) ert = int.MaxValue;
|
---|
88 | avgERT += ert;
|
---|
89 | count++;
|
---|
90 | }
|
---|
91 | avgERT /= count;
|
---|
92 | instances.Add(Tuple.Create(algorithm, avgERT));
|
---|
93 | }
|
---|
94 |
|
---|
95 | foreach (var alg in instances.OrderBy(x => x.Item2).Select(x => (IAlgorithm)x.Item1.Clone()))
|
---|
96 | yield return alg;
|
---|
97 | }
|
---|
98 | }
|
---|
99 | }
|
---|