Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2817-BinPackingSpeedup/HeuristicLab.Problems.Binary/3.3/BinaryProblem.cs @ 15630

Last change on this file since 15630 was 14412, checked in by abeham, 8 years ago

#2706:

  • Encodings.BinaryVector:
    • Added HammingSimilarityCalculator
  • Problems.Knapsack:
    • Made KnapsackSimilarityCalculator NonDiscoverable and Obsolete
    • Added HammingSimilarityCalculator to KnapsackProblem and removed NoSimilarityCalculator
  • Problems.Binary:
    • Added HammingSimilarityCalculator and QualitySimilarityCalculator to BinaryProblem
    • Added PopulationSimilarityAnalyzer to BinaryProblem
File size: 4.3 KB
Line 
1#region License Information
2
3/* HeuristicLab
4 * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
5 *
6 * This file is part of HeuristicLab.
7 *
8 * HeuristicLab is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version.
12 *
13 * HeuristicLab is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
16 * GNU General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License
19 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
20 */
21
22#endregion
23
24using System;
25using System.Linq;
26using HeuristicLab.Analysis;
27using HeuristicLab.Common;
28using HeuristicLab.Core;
29using HeuristicLab.Data;
30using HeuristicLab.Encodings.BinaryVectorEncoding;
31using HeuristicLab.Optimization;
32using HeuristicLab.Optimization.Operators;
33using HeuristicLab.Parameters;
34using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
35
36namespace HeuristicLab.Problems.Binary {
37  [StorableClass]
38  public abstract class BinaryProblem : SingleObjectiveBasicProblem<BinaryVectorEncoding> {
39    public virtual int Length {
40      get { return Encoding.Length; }
41      set { Encoding.Length = value; }
42    }
43
44    private IFixedValueParameter<IntValue> LengthParameter {
45      get { return (IFixedValueParameter<IntValue>)Parameters["Length"]; }
46    }
47
48    [StorableConstructor]
49    protected BinaryProblem(bool deserializing) : base(deserializing) { }
50    [StorableHook(HookType.AfterDeserialization)]
51    private void AfterDeserialization() {
52      RegisterEventHandlers();
53    }
54
55    protected BinaryProblem(BinaryProblem original, Cloner cloner)
56      : base(original, cloner) {
57      RegisterEventHandlers();
58    }
59
60    protected BinaryProblem()
61      : base() {
62      var lengthParameter = new FixedValueParameter<IntValue>("Length", "The length of the BinaryVector.", new IntValue(10));
63      Parameters.Add(lengthParameter);
64      Encoding.LengthParameter = lengthParameter;
65      Operators.Add(new HammingSimilarityCalculator());
66      Operators.Add(new QualitySimilarityCalculator());
67      Operators.Add(new PopulationSimilarityAnalyzer(Operators.OfType<ISolutionSimilarityCalculator>()));
68      Parameterize();
69      RegisterEventHandlers();
70    }
71
72    public virtual bool IsBetter(double quality, double bestQuality) {
73      return (Maximization && quality > bestQuality || !Maximization && quality < bestQuality);
74    }
75
76    public abstract double Evaluate(BinaryVector vector, IRandom random);
77    public sealed override double Evaluate(Individual individual, IRandom random) {
78      return Evaluate(individual.BinaryVector(), random);
79    }
80
81    public override void Analyze(Individual[] individuals, double[] qualities, ResultCollection results, IRandom random) {
82      base.Analyze(individuals, qualities, results, random);
83      var orderedIndividuals = individuals.Zip(qualities, (i, q) => new { Individual = i, Quality = q }).OrderBy(z => z.Quality);
84      var best = Maximization ? orderedIndividuals.Last().Individual : orderedIndividuals.First().Individual;
85
86      if (!results.ContainsKey("Best Solution")) {
87        results.Add(new Result("Best Solution", typeof(BinaryVector)));
88      }
89      results["Best Solution"].Value = (IItem)best.BinaryVector().Clone();
90    }
91
92    protected override void OnEncodingChanged() {
93      base.OnEncodingChanged();
94      Encoding.LengthParameter = LengthParameter;
95      Parameterize();
96    }
97
98    private void Parameterize() {
99      foreach (var similarityCalculator in Operators.OfType<ISolutionSimilarityCalculator>()) {
100        similarityCalculator.SolutionVariableName = Encoding.SolutionCreator.BinaryVectorParameter.ActualName;
101        similarityCalculator.QualityVariableName = Evaluator.QualityParameter.ActualName;
102      }
103    }
104
105    private void RegisterEventHandlers() {
106      LengthParameter.Value.ValueChanged += LengthParameter_ValueChanged;
107    }
108
109    protected virtual void LengthParameter_ValueChanged(object sender, EventArgs e) { }
110  }
111}
Note: See TracBrowser for help on using the repository browser.