[3094] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17097] | 3 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3094] | 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;
|
---|
[4722] | 23 | using HeuristicLab.Common;
|
---|
[3094] | 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Data;
|
---|
| 26 | using HeuristicLab.Parameters;
|
---|
[17097] | 27 | using HEAL.Attic;
|
---|
[3094] | 28 |
|
---|
| 29 | namespace HeuristicLab.Optimization.Operators {
|
---|
| 30 | /// <summary>
|
---|
| 31 | /// Compares two qualities and creates a boolean flag that indicates if the left side is better than the right side or if the difference in quality is acceptable given a certain probability.
|
---|
| 32 | /// </summary>
|
---|
| 33 | /// <remarks>
|
---|
| 34 | /// The probabilty is that of simulated annealing: A randomly drawn (uniformly) real value in
|
---|
| 35 | /// the interval [0;1) has to be smaller than e^(-diff/T) where diff is the absolute quality difference
|
---|
| 36 | /// and T is the temperature (here called dampening).
|
---|
| 37 | /// </remarks>
|
---|
| 38 | [Item("ProbabilisticQualityComparator", "Compares two qualities and creates a boolean flag that indicates if the left side is better than the right side or if the difference in quality is acceptable given a certain probability.")]
|
---|
[17097] | 39 | [StorableType("E8467C96-D88F-4EFA-B3BF-78DBFA63B36A")]
|
---|
[3094] | 40 | public class ProbabilisticQualityComparator : QualityComparator, IStochasticOperator {
|
---|
| 41 | public ILookupParameter<DoubleValue> DampeningParameter {
|
---|
| 42 | get { return (ILookupParameter<DoubleValue>)Parameters["Dampening"]; }
|
---|
| 43 | }
|
---|
| 44 | public ILookupParameter<IRandom> RandomParameter {
|
---|
| 45 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
---|
[4068] | 46 | }
|
---|
[3094] | 47 |
|
---|
[4722] | 48 | [StorableConstructor]
|
---|
[17097] | 49 | protected ProbabilisticQualityComparator(StorableConstructorFlag _) : base(_) { }
|
---|
[4722] | 50 | protected ProbabilisticQualityComparator(ProbabilisticQualityComparator original, Cloner cloner) : base(original, cloner) { }
|
---|
[3094] | 51 | public ProbabilisticQualityComparator()
|
---|
| 52 | : base() {
|
---|
| 53 | Parameters.Add(new LookupParameter<DoubleValue>("Dampening", "The dampening factor that influences the probability."));
|
---|
| 54 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator."));
|
---|
| 55 | }
|
---|
| 56 |
|
---|
[4722] | 57 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 58 | return new ProbabilisticQualityComparator(this, cloner);
|
---|
| 59 | }
|
---|
| 60 |
|
---|
[3094] | 61 | protected override bool Compare(bool maximization, double left, double right) {
|
---|
| 62 | if (base.Compare(maximization, left, right)) return true;
|
---|
| 63 | double t = DampeningParameter.ActualValue.Value;
|
---|
| 64 | double probability = Math.Exp(-Math.Abs(left - right) / t);
|
---|
| 65 | return RandomParameter.ActualValue.NextDouble() < probability;
|
---|
| 66 | }
|
---|
| 67 | }
|
---|
| 68 | }
|
---|