Free cookie consent management tool by TermsFeed Policy Generator

source: branches/crossvalidation-2434/HeuristicLab.Problems.Knapsack/3.3/MoveEvaluators/KnapsackMoveEvaluator.cs @ 14419

Last change on this file since 14419 was 12012, checked in by ascheibe, 10 years ago

#2212 merged r12008, r12009, r12010 back into trunk

File size: 3.5 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 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
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Encodings.BinaryVectorEncoding;
26using HeuristicLab.Operators;
27using HeuristicLab.Optimization;
28using HeuristicLab.Parameters;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30
31namespace HeuristicLab.Problems.Knapsack {
32  /// <summary>
33  /// A base class for operators which evaluate Knapsack moves.
34  /// </summary>
35  [Item("KnapsackMoveEvaluator", "A base class for operators which evaluate Knapsack moves.")]
36  [StorableClass]
37  public abstract class KnapsackMoveEvaluator : SingleSuccessorOperator, IKnapsackMoveEvaluator, IBinaryVectorMoveOperator {
38    public ILookupParameter<DoubleValue> QualityParameter {
39      get { return (ILookupParameter<DoubleValue>)Parameters["Quality"]; }
40    }
41    public ILookupParameter<DoubleValue> MoveQualityParameter {
42      get { return (ILookupParameter<DoubleValue>)Parameters["MoveQuality"]; }
43    }
44    public ILookupParameter<BinaryVector> BinaryVectorParameter {
45      get { return (ILookupParameter<BinaryVector>)Parameters["BinaryVector"]; }
46    }
47    public ILookupParameter<IntValue> KnapsackCapacityParameter {
48      get { return (ILookupParameter<IntValue>)Parameters["KnapsackCapacity"]; }
49    }
50    public ILookupParameter<DoubleValue> PenaltyParameter {
51      get { return (ILookupParameter<DoubleValue>)Parameters["Penalty"]; }
52    }
53    public ILookupParameter<IntArray> WeightsParameter {
54      get { return (ILookupParameter<IntArray>)Parameters["Weights"]; }
55    }
56    public ILookupParameter<IntArray> ValuesParameter {
57      get { return (ILookupParameter<IntArray>)Parameters["Values"]; }
58    }
59
60    [StorableConstructor]
61    protected KnapsackMoveEvaluator(bool deserializing) : base(deserializing) { }
62    protected KnapsackMoveEvaluator(KnapsackMoveEvaluator original, Cloner cloner) : base(original, cloner) { }
63    protected KnapsackMoveEvaluator()
64      : base() {
65      Parameters.Add(new LookupParameter<DoubleValue>("Quality", "The quality of a Knapsack solution."));
66      Parameters.Add(new LookupParameter<DoubleValue>("MoveQuality", "The evaluated quality of a move on a Knapsack solution."));
67      Parameters.Add(new LookupParameter<BinaryVector>("BinaryVector", "The solution as BinaryVector."));
68      Parameters.Add(new LookupParameter<IntValue>("KnapsackCapacity", "Capacity of the Knapsack."));
69      Parameters.Add(new LookupParameter<IntArray>("Weights", "The weights of the items."));
70      Parameters.Add(new LookupParameter<IntArray>("Values", "The values of the items."));
71      Parameters.Add(new LookupParameter<DoubleValue>("Penalty", "The penalty value for each unit of overweight."));
72    }
73  }
74}
Note: See TracBrowser for help on using the repository browser.