[3070] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17181] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3070] | 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 |
|
---|
[4068] | 22 | using System;
|
---|
[4722] | 23 | using HeuristicLab.Common;
|
---|
[3070] | 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Data;
|
---|
[4068] | 26 | using HeuristicLab.Encodings.BinaryVectorEncoding;
|
---|
| 27 | using HeuristicLab.Operators;
|
---|
[3070] | 28 | using HeuristicLab.Parameters;
|
---|
[17097] | 29 | using HEAL.Attic;
|
---|
[3070] | 30 |
|
---|
| 31 | namespace HeuristicLab.Problems.Knapsack {
|
---|
| 32 | /// <summary>
|
---|
[4513] | 33 | /// A base class for operators which evaluate Knapsack solutions given in BinaryVector encoding.
|
---|
[3070] | 34 | /// </summary>
|
---|
| 35 | [Item("KnapsackEvaluator", "Evaluates solutions for the Knapsack problem.")]
|
---|
[17097] | 36 | [StorableType("905F6A31-FDC1-48EA-9229-DA23956F1929")]
|
---|
[10507] | 37 | public class KnapsackEvaluator : InstrumentedOperator, IKnapsackEvaluator {
|
---|
[3070] | 38 | public ILookupParameter<DoubleValue> QualityParameter {
|
---|
| 39 | get { return (ILookupParameter<DoubleValue>)Parameters["Quality"]; }
|
---|
| 40 | }
|
---|
[3537] | 41 |
|
---|
| 42 | public ILookupParameter<DoubleValue> SumWeightsParameter {
|
---|
| 43 | get { return (ILookupParameter<DoubleValue>)Parameters["SumWeights"]; }
|
---|
| 44 | }
|
---|
| 45 |
|
---|
| 46 | public ILookupParameter<DoubleValue> SumValuesParameter {
|
---|
| 47 | get { return (ILookupParameter<DoubleValue>)Parameters["SumValues"]; }
|
---|
| 48 | }
|
---|
| 49 |
|
---|
| 50 | public ILookupParameter<DoubleValue> AppliedPenaltyParameter {
|
---|
| 51 | get { return (ILookupParameter<DoubleValue>)Parameters["AppliedPenalty"]; }
|
---|
| 52 | }
|
---|
[4068] | 53 |
|
---|
[3070] | 54 | public ILookupParameter<BinaryVector> BinaryVectorParameter {
|
---|
| 55 | get { return (ILookupParameter<BinaryVector>)Parameters["BinaryVector"]; }
|
---|
| 56 | }
|
---|
| 57 |
|
---|
| 58 | public ILookupParameter<IntValue> KnapsackCapacityParameter {
|
---|
| 59 | get { return (ILookupParameter<IntValue>)Parameters["KnapsackCapacity"]; }
|
---|
| 60 | }
|
---|
| 61 | public ILookupParameter<DoubleValue> PenaltyParameter {
|
---|
| 62 | get { return (ILookupParameter<DoubleValue>)Parameters["Penalty"]; }
|
---|
| 63 | }
|
---|
| 64 | public ILookupParameter<IntArray> WeightsParameter {
|
---|
| 65 | get { return (ILookupParameter<IntArray>)Parameters["Weights"]; }
|
---|
| 66 | }
|
---|
| 67 | public ILookupParameter<IntArray> ValuesParameter {
|
---|
| 68 | get { return (ILookupParameter<IntArray>)Parameters["Values"]; }
|
---|
| 69 | }
|
---|
| 70 |
|
---|
[4722] | 71 | [StorableConstructor]
|
---|
[17097] | 72 | protected KnapsackEvaluator(StorableConstructorFlag _) : base(_) { }
|
---|
[4722] | 73 | protected KnapsackEvaluator(KnapsackEvaluator original, Cloner cloner) : base(original, cloner) { }
|
---|
[3070] | 74 | public KnapsackEvaluator()
|
---|
| 75 | : base() {
|
---|
| 76 | Parameters.Add(new LookupParameter<DoubleValue>("Quality", "The evaluated quality of the OneMax solution."));
|
---|
[3537] | 77 | Parameters.Add(new LookupParameter<DoubleValue>("SumWeights", "The evaluated quality of the OneMax solution."));
|
---|
| 78 | Parameters.Add(new LookupParameter<DoubleValue>("SumValues", "The evaluated quality of the OneMax solution."));
|
---|
| 79 | Parameters.Add(new LookupParameter<DoubleValue>("AppliedPenalty", "The evaluated quality of the OneMax solution."));
|
---|
[3070] | 80 | Parameters.Add(new LookupParameter<BinaryVector>("BinaryVector", "The OneMax solution given in path representation which should be evaluated."));
|
---|
| 81 | Parameters.Add(new LookupParameter<IntValue>("KnapsackCapacity", "Capacity of the Knapsack."));
|
---|
| 82 | Parameters.Add(new LookupParameter<IntArray>("Weights", "The weights of the items."));
|
---|
| 83 | Parameters.Add(new LookupParameter<IntArray>("Values", "The values of the items."));
|
---|
| 84 | Parameters.Add(new LookupParameter<DoubleValue>("Penalty", "The penalty value for each unit of overweight."));
|
---|
| 85 | }
|
---|
| 86 |
|
---|
[4722] | 87 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 88 | return new KnapsackEvaluator(this, cloner);
|
---|
| 89 | }
|
---|
| 90 |
|
---|
[17097] | 91 | [StorableType(StorableMemberSelection.AllFields, "0968A5F3-5E3A-4357-A042-06E4BDEAFA6C")]
|
---|
[3537] | 92 | public struct KnapsackEvaluation {
|
---|
| 93 | public DoubleValue Quality;
|
---|
| 94 | public DoubleValue SumWeights;
|
---|
| 95 | public DoubleValue SumValues;
|
---|
| 96 | public DoubleValue AppliedPenalty;
|
---|
| 97 | }
|
---|
| 98 |
|
---|
| 99 | public static KnapsackEvaluation Apply(BinaryVector v, IntValue capacity, DoubleValue penalty, IntArray weights, IntArray values) {
|
---|
[3124] | 100 | if (weights.Length != values.Length)
|
---|
[3537] | 101 | throw new InvalidOperationException("The weights and values parameters of the Knapsack problem have different sizes");
|
---|
| 102 |
|
---|
| 103 | KnapsackEvaluation result = new KnapsackEvaluation();
|
---|
| 104 |
|
---|
[3124] | 105 | double quality = 0;
|
---|
[3070] | 106 |
|
---|
| 107 | int weight = 0;
|
---|
| 108 | int value = 0;
|
---|
[3537] | 109 | double appliedPenalty = 0;
|
---|
[3070] | 110 |
|
---|
| 111 | for (int i = 0; i < v.Length; i++) {
|
---|
| 112 | if (v[i]) {
|
---|
[3124] | 113 | weight += weights[i];
|
---|
| 114 | value += values[i];
|
---|
[3070] | 115 | }
|
---|
| 116 | }
|
---|
| 117 |
|
---|
[3124] | 118 | if (weight > capacity.Value) {
|
---|
[3537] | 119 | appliedPenalty = penalty.Value * (weight - capacity.Value);
|
---|
[4068] | 120 | }
|
---|
[3070] | 121 |
|
---|
[4068] | 122 | quality = value - appliedPenalty;
|
---|
[3537] | 123 |
|
---|
| 124 | result.AppliedPenalty = new DoubleValue(appliedPenalty);
|
---|
| 125 | result.SumWeights = new DoubleValue(weight);
|
---|
| 126 | result.SumValues = new DoubleValue(value);
|
---|
| 127 | result.Quality = new DoubleValue(quality);
|
---|
| 128 |
|
---|
| 129 | return result;
|
---|
[3124] | 130 | }
|
---|
[3070] | 131 |
|
---|
[10507] | 132 | public sealed override IOperation InstrumentedApply() {
|
---|
[3124] | 133 | BinaryVector v = BinaryVectorParameter.ActualValue;
|
---|
| 134 |
|
---|
[3537] | 135 | KnapsackEvaluation evaluation = Apply(BinaryVectorParameter.ActualValue,
|
---|
[4068] | 136 | KnapsackCapacityParameter.ActualValue,
|
---|
| 137 | PenaltyParameter.ActualValue,
|
---|
| 138 | WeightsParameter.ActualValue,
|
---|
[3124] | 139 | ValuesParameter.ActualValue);
|
---|
| 140 |
|
---|
[3537] | 141 | QualityParameter.ActualValue = evaluation.Quality;
|
---|
| 142 | SumWeightsParameter.ActualValue = evaluation.SumWeights;
|
---|
| 143 | SumValuesParameter.ActualValue = evaluation.SumValues;
|
---|
| 144 | AppliedPenaltyParameter.ActualValue = evaluation.AppliedPenalty;
|
---|
[3124] | 145 |
|
---|
[10507] | 146 | return base.InstrumentedApply();
|
---|
[3070] | 147 | }
|
---|
| 148 | }
|
---|
| 149 | }
|
---|