| 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| 3 | * Copyright (C) 2002-2010 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.Core;
|
|---|
| 23 | using HeuristicLab.Data;
|
|---|
| 24 | using HeuristicLab.Operators;
|
|---|
| 25 | using HeuristicLab.Parameters;
|
|---|
| 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
|---|
| 27 |
|
|---|
| 28 | namespace HeuristicLab.Optimization.Operators {
|
|---|
| 29 | [Item("QualityComparator", "Compares two qualities and creates a boolean flag that indicates if the left side is better than the right side.")]
|
|---|
| 30 | [StorableClass]
|
|---|
| 31 | public class QualityComparator : SingleSuccessorOperator, IQualityComparator {
|
|---|
| 32 | public ILookupParameter<DoubleValue> LeftSideParameter {
|
|---|
| 33 | get { return (ILookupParameter<DoubleValue>)Parameters["LeftSide"]; }
|
|---|
| 34 | }
|
|---|
| 35 | public IValueLookupParameter<DoubleValue> RightSideParameter {
|
|---|
| 36 | get { return (IValueLookupParameter<DoubleValue>)Parameters["RightSide"]; }
|
|---|
| 37 | }
|
|---|
| 38 | public ILookupParameter<BoolValue> ResultParameter {
|
|---|
| 39 | get { return (ILookupParameter<BoolValue>)Parameters["Result"]; }
|
|---|
| 40 | }
|
|---|
| 41 | public IValueLookupParameter<BoolValue> MaximizationParameter {
|
|---|
| 42 | get { return (IValueLookupParameter<BoolValue>)Parameters["Maximization"]; }
|
|---|
| 43 | }
|
|---|
| 44 |
|
|---|
| 45 | public QualityComparator()
|
|---|
| 46 | : base() {
|
|---|
| 47 | Parameters.Add(new LookupParameter<DoubleValue>("LeftSide", "The left side of the comparison."));
|
|---|
| 48 | Parameters.Add(new ValueLookupParameter<DoubleValue>("RightSide", "The right side of the comparison."));
|
|---|
| 49 | Parameters.Add(new LookupParameter<BoolValue>("Result", "The result of the comparison."));
|
|---|
| 50 | Parameters.Add(new ValueLookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem, otherwise false."));
|
|---|
| 51 | }
|
|---|
| 52 |
|
|---|
| 53 | public override IOperation Apply() {
|
|---|
| 54 | DoubleValue left = LeftSideParameter.ActualValue;
|
|---|
| 55 | DoubleValue right = RightSideParameter.ActualValue;
|
|---|
| 56 | BoolValue maximization = MaximizationParameter.ActualValue;
|
|---|
| 57 | bool better = Compare(maximization.Value, left.Value, right.Value);
|
|---|
| 58 | if (ResultParameter.ActualValue == null)
|
|---|
| 59 | ResultParameter.ActualValue = new BoolValue(better);
|
|---|
| 60 | else ResultParameter.ActualValue.Value = better;
|
|---|
| 61 | return base.Apply();
|
|---|
| 62 | }
|
|---|
| 63 |
|
|---|
| 64 | protected virtual bool Compare(bool maximization, double left, double right) {
|
|---|
| 65 | return maximization && left > right || !maximization && left < right;
|
|---|
| 66 | }
|
|---|
| 67 | }
|
|---|
| 68 | }
|
|---|
