[3065] | 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 |
|
---|
[4722] | 22 | using HeuristicLab.Common;
|
---|
[3065] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
[4068] | 25 | using HeuristicLab.Encodings.BinaryVectorEncoding;
|
---|
| 26 | using HeuristicLab.Operators;
|
---|
[3065] | 27 | using HeuristicLab.Parameters;
|
---|
| 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 29 |
|
---|
| 30 | namespace HeuristicLab.Problems.OneMax {
|
---|
| 31 | /// <summary>
|
---|
| 32 | /// A base class for operators which evaluates OneMax solutions given in BinaryVector encoding.
|
---|
| 33 | /// </summary>
|
---|
| 34 | [Item("OneMaxEvaluator", "Evaluates solutions for the OneMax problem.")]
|
---|
| 35 | [StorableClass]
|
---|
| 36 | public class OneMaxEvaluator : SingleSuccessorOperator, IOneMaxEvaluator {
|
---|
| 37 | public ILookupParameter<DoubleValue> QualityParameter {
|
---|
| 38 | get { return (ILookupParameter<DoubleValue>)Parameters["Quality"]; }
|
---|
| 39 | }
|
---|
[4068] | 40 |
|
---|
[3065] | 41 | public ILookupParameter<BinaryVector> BinaryVectorParameter {
|
---|
| 42 | get { return (ILookupParameter<BinaryVector>)Parameters["BinaryVector"]; }
|
---|
| 43 | }
|
---|
| 44 |
|
---|
[4722] | 45 | [StorableConstructor]
|
---|
| 46 | protected OneMaxEvaluator(bool deserializing) : base(deserializing) { }
|
---|
| 47 | protected OneMaxEvaluator(OneMaxEvaluator original, Cloner cloner) : base(original, cloner) { }
|
---|
[3065] | 48 | public OneMaxEvaluator()
|
---|
| 49 | : base() {
|
---|
| 50 | Parameters.Add(new LookupParameter<DoubleValue>("Quality", "The evaluated quality of the OneMax solution."));
|
---|
| 51 | Parameters.Add(new LookupParameter<BinaryVector>("BinaryVector", "The OneMax solution given in path representation which should be evaluated."));
|
---|
| 52 | }
|
---|
| 53 |
|
---|
[4722] | 54 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 55 | return new OneMaxEvaluator(this, cloner);
|
---|
| 56 | }
|
---|
| 57 |
|
---|
[3065] | 58 | public sealed override IOperation Apply() {
|
---|
| 59 | BinaryVector v = BinaryVectorParameter.ActualValue;
|
---|
| 60 |
|
---|
| 61 | double quality = 0;
|
---|
| 62 | for (int i = 0; i < v.Length; i++) {
|
---|
| 63 | if (v[i])
|
---|
| 64 | quality += 1.0;
|
---|
| 65 | }
|
---|
| 66 |
|
---|
| 67 | QualityParameter.ActualValue = new DoubleValue(quality);
|
---|
| 68 |
|
---|
| 69 | return base.Apply();
|
---|
| 70 | }
|
---|
| 71 | }
|
---|
| 72 | }
|
---|