Free cookie consent management tool by TermsFeed Policy Generator

source: branches/ScopedAlgorithms/HeuristicLab.Problems.Knapsack/3.3/MoveEvaluators/KnapsackOneBitflipMoveEvaluator.cs @ 14791

Last change on this file since 14791 was 13404, checked in by abeham, 9 years ago

#2521:

  • Adapted Knapsack problem to new problem infrastructure
  • Introduced additional interfaces in binary vector encoding
  • Improved KnapsackImprovementOperator which requires less evaluated solutions in case of an infeasible start solution

Loosely related change:

  • All LookupParameters are now shown by default
  • Wiring code should make sure that wired parameters are hidden
File size: 3.1 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.Parameters;
27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
28
29namespace HeuristicLab.Problems.Knapsack {
30  /// <summary>
31  /// An operator to evaluate one bitflip moves.
32  /// </summary>
33  [Item("KnapsackOneBitflipMoveEvaluator", "Base class for evaluating one bitflip moves.")]
34  [StorableClass]
35  public class KnapsackOneBitflipMoveEvaluator : KnapsackMoveEvaluator, IOneBitflipMoveOperator {
36    public ILookupParameter<OneBitflipMove> OneBitflipMoveParameter {
37      get { return (ILookupParameter<OneBitflipMove>)Parameters["OneBitflipMove"]; }
38    }
39
40    [StorableConstructor]
41    protected KnapsackOneBitflipMoveEvaluator(bool deserializing) : base(deserializing) { }
42    protected KnapsackOneBitflipMoveEvaluator(KnapsackOneBitflipMoveEvaluator original, Cloner cloner) : base(original, cloner) { }
43    public KnapsackOneBitflipMoveEvaluator()
44      : base() {
45      Parameters.Add(new LookupParameter<OneBitflipMove>("OneBitflipMove", "The move to evaluate."));
46    }
47
48    public override IDeepCloneable Clone(Cloner cloner) {
49      return new KnapsackOneBitflipMoveEvaluator(this, cloner);
50    }
51
52    public override IOperation Apply() {
53      var move = OneBitflipMoveParameter.ActualValue;
54      var solution = BinaryVectorParameter.ActualValue;
55      var weights = WeightsParameter.ActualValue;
56      var values = ValuesParameter.ActualValue;
57      var capacity = KnapsackCapacityParameter.ActualValue.Value;
58
59      var totalWeight = !solution[move.Index] ? weights[move.Index] : 0.0;
60      var totalValue = !solution[move.Index] ? values[move.Index] : 0.0; ;
61      for (var i = 0; i < solution.Length; i++) {
62        if (i == move.Index || !solution[i]) continue;
63        totalWeight += weights[i];
64        totalValue += values[i];
65      }
66
67      var moveQuality = totalWeight > capacity ? capacity - totalWeight : totalValue;
68
69      if (MoveQualityParameter.ActualValue == null) MoveQualityParameter.ActualValue = new DoubleValue(moveQuality);
70      else MoveQualityParameter.ActualValue.Value = moveQuality;
71      return base.Apply();
72    }
73  }
74}
Note: See TracBrowser for help on using the repository browser.