[13368] | 1 | #region License Information
|
---|
[3124] | 2 | /* HeuristicLab
|
---|
[12012] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3124] | 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 |
|
---|
[4722] | 22 | using HeuristicLab.Common;
|
---|
[3124] | 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Encodings.BinaryVectorEncoding;
|
---|
| 26 | using HeuristicLab.Parameters;
|
---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 28 |
|
---|
| 29 | namespace 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.")]
|
---|
[13368] | 34 | [StorableClass("14DF5681-3AC8-4DD8-B983-1F849973A7B4")]
|
---|
[3124] | 35 | public class KnapsackOneBitflipMoveEvaluator : KnapsackMoveEvaluator, IOneBitflipMoveOperator {
|
---|
| 36 | public ILookupParameter<OneBitflipMove> OneBitflipMoveParameter {
|
---|
| 37 | get { return (ILookupParameter<OneBitflipMove>)Parameters["OneBitflipMove"]; }
|
---|
| 38 | }
|
---|
| 39 |
|
---|
[4722] | 40 | [StorableConstructor]
|
---|
| 41 | protected KnapsackOneBitflipMoveEvaluator(bool deserializing) : base(deserializing) { }
|
---|
| 42 | protected KnapsackOneBitflipMoveEvaluator(KnapsackOneBitflipMoveEvaluator original, Cloner cloner) : base(original, cloner) { }
|
---|
[3124] | 43 | public KnapsackOneBitflipMoveEvaluator()
|
---|
| 44 | : base() {
|
---|
| 45 | Parameters.Add(new LookupParameter<OneBitflipMove>("OneBitflipMove", "The move to evaluate."));
|
---|
| 46 | }
|
---|
| 47 |
|
---|
[4722] | 48 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 49 | return new KnapsackOneBitflipMoveEvaluator(this, cloner);
|
---|
| 50 | }
|
---|
| 51 |
|
---|
[3124] | 52 | public override IOperation Apply() {
|
---|
| 53 | BinaryVector binaryVector = BinaryVectorParameter.ActualValue;
|
---|
| 54 | OneBitflipMove move = OneBitflipMoveParameter.ActualValue;
|
---|
| 55 |
|
---|
| 56 | BinaryVector newSolution = new BinaryVector(binaryVector);
|
---|
| 57 | newSolution[move.Index] = !newSolution[move.Index];
|
---|
| 58 |
|
---|
[3144] | 59 | DoubleValue quality = KnapsackEvaluator.Apply(newSolution,
|
---|
[3124] | 60 | KnapsackCapacityParameter.ActualValue,
|
---|
| 61 | PenaltyParameter.ActualValue,
|
---|
| 62 | WeightsParameter.ActualValue,
|
---|
[3537] | 63 | ValuesParameter.ActualValue).Quality;
|
---|
[3124] | 64 |
|
---|
| 65 | double moveQuality = quality.Value;
|
---|
[4068] | 66 |
|
---|
[3124] | 67 | if (MoveQualityParameter.ActualValue == null) MoveQualityParameter.ActualValue = new DoubleValue(moveQuality);
|
---|
| 68 | else MoveQualityParameter.ActualValue.Value = moveQuality;
|
---|
| 69 | return base.Apply();
|
---|
| 70 | }
|
---|
| 71 | }
|
---|
| 72 | }
|
---|