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