Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2521_ProblemRefactoring/HeuristicLab.Problems.Knapsack/3.3/KnapsackProblem.cs @ 17356

Last change on this file since 17356 was 17356, checked in by abeham, 5 years ago

#2521: fixed some problems in Samples.Create unit tests and updated samples

File size: 11.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 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 System;
23using System.Collections.Generic;
24using System.Linq;
25using System.Threading;
26using HEAL.Attic;
27using HeuristicLab.Analysis;
28using HeuristicLab.Common;
29using HeuristicLab.Core;
30using HeuristicLab.Data;
31using HeuristicLab.Encodings.BinaryVectorEncoding;
32using HeuristicLab.Optimization;
33using HeuristicLab.Optimization.Operators;
34using HeuristicLab.Parameters;
35
36namespace HeuristicLab.Problems.Knapsack {
37  [Item("Knapsack Problem (KSP)", "Represents a Knapsack problem.")]
38  [Creatable(CreatableAttribute.Categories.CombinatorialProblems, Priority = 200)]
39  [StorableType("8CEDAFA2-6E0A-4D4B-B6C6-F85CC58B824E")]
40  public sealed class KnapsackProblem : BinaryVectorProblem {
41
42    #region Parameter Properties
43    public ValueParameter<IntValue> KnapsackCapacityParameter {
44      get { return (ValueParameter<IntValue>)Parameters["KnapsackCapacity"]; }
45    }
46    public ValueParameter<IntArray> WeightsParameter {
47      get { return (ValueParameter<IntArray>)Parameters["Weights"]; }
48    }
49    public ValueParameter<IntArray> ValuesParameter {
50      get { return (ValueParameter<IntArray>)Parameters["Values"]; }
51    }
52    public OptionalValueParameter<BinaryVector> BestKnownSolutionParameter {
53      get { return (OptionalValueParameter<BinaryVector>)Parameters["BestKnownSolution"]; }
54    }
55    #endregion
56
57    #region Properties
58    public int KnapsackCapacity {
59      get { return KnapsackCapacityParameter.Value.Value; }
60      set { KnapsackCapacityParameter.Value.Value = value; }
61    }
62    public IntArray Weights {
63      get { return WeightsParameter.Value; }
64      set { WeightsParameter.Value = value; }
65    }
66    public IntArray Values {
67      get { return ValuesParameter.Value; }
68      set { ValuesParameter.Value = value; }
69    }
70    public BinaryVector BestKnownSolution {
71      get { return BestKnownSolutionParameter.Value; }
72      set { BestKnownSolutionParameter.Value = value; }
73    }
74    private BestKnapsackSolutionAnalyzer BestKnapsackSolutionAnalyzer {
75      get { return Operators.OfType<BestKnapsackSolutionAnalyzer>().FirstOrDefault(); }
76    }
77    #endregion
78
79    [StorableConstructor]
80    private KnapsackProblem(StorableConstructorFlag _) : base(_) { }
81    private KnapsackProblem(KnapsackProblem original, Cloner cloner)
82      : base(original, cloner) {
83      RegisterEventHandlers();
84    }
85    public KnapsackProblem()
86      : base(new BinaryVectorEncoding("Selection")) {
87      Maximization = true;
88      Parameters.Add(new ValueParameter<IntValue>("KnapsackCapacity", "Capacity of the Knapsack.", new IntValue(1)));
89      Parameters.Add(new ValueParameter<IntArray>("Weights", "The weights of the items.", new IntArray(5)));
90      Parameters.Add(new ValueParameter<IntArray>("Values", "The values of the items.", new IntArray(5)));
91      Parameters.Add(new OptionalValueParameter<BinaryVector>("BestKnownSolution", "The best known solution of this Knapsack instance."));
92
93      InitializeRandomKnapsackInstance();
94
95      InitializeOperators();
96      RegisterEventHandlers();
97    }
98
99    public override double Evaluate(BinaryVector solution, IRandom random, CancellationToken cancellationToken) {
100      var totalWeight = 0.0;
101      var totalValue = 0.0;
102      for (var i = 0; i < solution.Length; i++) {
103        if (!solution[i]) continue;
104        totalWeight += Weights[i];
105        totalValue += Values[i];
106      }
107      return totalWeight > KnapsackCapacity ? KnapsackCapacity - totalWeight : totalValue;
108    }
109
110    public override IDeepCloneable Clone(Cloner cloner) {
111      return new KnapsackProblem(this, cloner);
112    }
113
114    [StorableHook(HookType.AfterDeserialization)]
115    private void AfterDeserialization() {
116      RegisterEventHandlers();
117    }
118
119    private void RegisterEventHandlers() {
120      Evaluator.QualityParameter.ActualNameChanged += Evaluator_QualityParameter_ActualNameChanged;
121      KnapsackCapacityParameter.ValueChanged += KnapsackCapacityParameter_ValueChanged;
122      WeightsParameter.ValueChanged += WeightsParameter_ValueChanged;
123      WeightsParameter.Value.Reset += WeightsValue_Reset;
124      ValuesParameter.ValueChanged += ValuesParameter_ValueChanged;
125      ValuesParameter.Value.Reset += ValuesValue_Reset;
126      // TODO: There is no even to detect if the parameter itself was changed
127      Encoding.LengthParameter.ValueChanged += Encoding_LengthParameter_ValueChanged;
128    }
129
130    #region Events
131    protected override void OnEncodingChanged() {
132      base.OnEncodingChanged();
133      Parameterize();
134    }
135    //TODO check with abeham if this is really necessary
136    //protected override void OnSolutionCreatorChanged() {
137    //  base.OnSolutionCreatorChanged();
138    //  Parameterize();
139    //}
140    protected override void OnEvaluatorChanged() {
141      base.OnEvaluatorChanged();
142      Evaluator.QualityParameter.ActualNameChanged += Evaluator_QualityParameter_ActualNameChanged;
143      Parameterize();
144    }
145    private void Evaluator_QualityParameter_ActualNameChanged(object sender, EventArgs e) {
146      Parameterize();
147    }
148    private void KnapsackCapacityParameter_ValueChanged(object sender, EventArgs e) {
149      Parameterize();
150    }
151    private void WeightsParameter_ValueChanged(object sender, EventArgs e) {
152      Parameterize();
153      WeightsParameter.Value.Reset += WeightsValue_Reset;
154    }
155    private void WeightsValue_Reset(object sender, EventArgs e) {
156      if (WeightsParameter.Value != null && ValuesParameter.Value != null) {
157        ((IStringConvertibleArray)ValuesParameter.Value).Length = Weights.Length;
158        Encoding.Length = Weights.Length;
159      }
160      Parameterize();
161    }
162    private void ValuesParameter_ValueChanged(object sender, EventArgs e) {
163      Parameterize();
164      ValuesParameter.Value.Reset += ValuesValue_Reset;
165    }
166    private void ValuesValue_Reset(object sender, EventArgs e) {
167      if (WeightsParameter.Value != null && ValuesParameter.Value != null) {
168        ((IStringConvertibleArray)WeightsParameter.Value).Length = Values.Length;
169        Encoding.Length = Values.Length;
170      }
171      Parameterize();
172    }
173    private void Encoding_LengthParameter_ValueChanged(object sender, EventArgs e) {
174      if (Weights.Length != Encoding.Length) {
175        ((IStringConvertibleArray)WeightsParameter.Value).Length = Encoding.Length;
176      }
177      if (Values.Length != Encoding.Length) {
178        ((IStringConvertibleArray)ValuesParameter.Value).Length = Encoding.Length;
179      }
180      Parameterize();
181    }
182    #endregion
183
184    #region Helpers
185    private void InitializeOperators() {
186      Operators.Add(new KnapsackImprovementOperator());
187      Operators.Add(new KnapsackPathRelinker());
188      Operators.Add(new KnapsackSimultaneousPathRelinker());
189      Operators.Add(new QualitySimilarityCalculator());
190      Operators.Add(new NoSimilarityCalculator());
191
192      Operators.Add(new BestKnapsackSolutionAnalyzer());
193      Operators.Add(new PopulationSimilarityAnalyzer(Operators.OfType<ISolutionSimilarityCalculator>()));
194
195      Operators.Add(new KnapsackOneBitflipMoveEvaluator());
196      Parameterize();
197    }
198    private void Parameterize() {
199      var operators = new List<IItem>();
200
201      if (BestKnapsackSolutionAnalyzer != null) {
202        operators.Add(BestKnapsackSolutionAnalyzer);
203        BestKnapsackSolutionAnalyzer.MaximizationParameter.ActualName = MaximizationParameter.Name;
204        BestKnapsackSolutionAnalyzer.MaximizationParameter.Hidden = true;
205        BestKnapsackSolutionAnalyzer.BestKnownQualityParameter.ActualName = BestKnownQualityParameter.Name;
206        BestKnapsackSolutionAnalyzer.BestKnownQualityParameter.Hidden = true;
207        BestKnapsackSolutionAnalyzer.BestKnownSolutionParameter.ActualName = BestKnownSolutionParameter.Name;
208        BestKnapsackSolutionAnalyzer.BestKnownSolutionParameter.Hidden = true;
209        BestKnapsackSolutionAnalyzer.KnapsackCapacityParameter.ActualName = KnapsackCapacityParameter.Name;
210        BestKnapsackSolutionAnalyzer.KnapsackCapacityParameter.Hidden = true;
211        BestKnapsackSolutionAnalyzer.WeightsParameter.ActualName = WeightsParameter.Name;
212        BestKnapsackSolutionAnalyzer.WeightsParameter.Hidden = true;
213        BestKnapsackSolutionAnalyzer.ValuesParameter.ActualName = ValuesParameter.Name;
214        BestKnapsackSolutionAnalyzer.ValuesParameter.Hidden = true;
215      }
216      foreach (var op in Operators.OfType<IKnapsackMoveEvaluator>()) {
217        operators.Add(op);
218        op.KnapsackCapacityParameter.ActualName = KnapsackCapacityParameter.Name;
219        op.KnapsackCapacityParameter.Hidden = true;
220        op.WeightsParameter.ActualName = WeightsParameter.Name;
221        op.WeightsParameter.Hidden = true;
222        op.ValuesParameter.ActualName = ValuesParameter.Name;
223        op.ValuesParameter.Hidden = true;
224
225        var bitflipMoveEval = op as IKnapsackOneBitflipMoveEvaluator;
226        if (bitflipMoveEval != null) {
227          foreach (var moveOp in Encoding.Operators.OfType<IOneBitflipMoveQualityOperator>()) {
228            moveOp.MoveQualityParameter.ActualName = bitflipMoveEval.MoveQualityParameter.ActualName;
229            moveOp.MoveQualityParameter.Hidden = true;
230          }
231        }
232      }
233      foreach (var op in Operators.OfType<ISingleObjectiveImprovementOperator>()) {
234        operators.Add(op);
235        op.SolutionParameter.ActualName = Encoding.Name;
236        op.SolutionParameter.Hidden = true;
237      }
238      foreach (var op in Operators.OfType<ISingleObjectivePathRelinker>()) {
239        operators.Add(op);
240        op.ParentsParameter.ActualName = Encoding.Name;
241        op.ParentsParameter.Hidden = true;
242      }
243      foreach (var op in Operators.OfType<ISolutionSimilarityCalculator>()) {
244        operators.Add(op);
245        op.SolutionVariableName = Encoding.Name;
246        op.QualityVariableName = Evaluator.QualityParameter.ActualName;
247      }
248
249      if (operators.Count > 0) Encoding.ConfigureOperators(Operators);
250    }
251    #endregion
252
253    private void InitializeRandomKnapsackInstance() {
254      var sysrand = new System.Random();
255
256      var itemCount = sysrand.Next(10, 100);
257      Weights = new IntArray(itemCount);
258      Values = new IntArray(itemCount);
259
260      double totalWeight = 0;
261
262      for (int i = 0; i < itemCount; i++) {
263        var value = sysrand.Next(1, 10);
264        var weight = sysrand.Next(1, 10);
265
266        Values[i] = value;
267        Weights[i] = weight;
268        totalWeight += weight;
269      }
270
271      KnapsackCapacity = (int)Math.Round(0.7 * totalWeight);
272    }
273  }
274}
Note: See TracBrowser for help on using the repository browser.